Experimental verification of quantum computation

被引:0
|
作者
Stefanie Barz
Joseph F. Fitzsimons
Elham Kashefi
Philip Walther
机构
[1] University of Vienna,
[2] Faculty of Physics,undefined
[3] Singapore University of Technology and Design,undefined
[4] Centre for Quantum Technologies,undefined
[5] National University of Singapore,undefined
[6] School of Informatics,undefined
[7] University of Edinburgh,undefined
来源
Nature Physics | 2013年 / 9卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Quantum computers are expected to offer substantial speed-ups over their classical counterparts and to solve problems intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens up fundamental questions, among them the issue of whether quantum computations can be certified by entities that are inherently unable to compute the results themselves. Here we present the first experimental verification of quantum computation. We show, in theory and experiment, how a verifier with minimal quantum resources can test a significantly more powerful quantum computer. The new verification protocol introduced here uses the framework of blind quantum computing and is independent of the experimental quantum-computation platform used. In our scheme, the verifier is required only to generate single qubits and transmit them to the quantum computer. We experimentally demonstrate this protocol using four photonic qubits and show how the verifier can test the computer’s ability to perform quantum computation.
引用
收藏
页码:727 / 731
页数:4
相关论文
共 50 条
  • [1] Experimental verification of quantum computation
    Barz, Stefanie
    Fitzsimons, Joseph F.
    Kashefi, Elham
    Walther, Philip
    [J]. NATURE PHYSICS, 2013, 9 (11) : 727 - 731
  • [2] Towards experimental classical verification of quantum computation
    Stricker, Roman
    Carrasco, Jose
    Ringbauer, Martin
    Postler, Lukas
    Meth, Michael
    Edmunds, Claire
    Schindler, Philipp
    Blatt, Rainer
    Zoller, Peter
    Kraus, Barbara
    Monz, Thomas
    [J]. QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (02)
  • [3] Verification of Quantum Computation and the Price of Trust
    Gheorghiu, Alexandru
    Kapourniotis, Theodoros
    Kashefi, Elham
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 15 - 19
  • [4] Post hoc Verification of Quantum Computation
    Fitzsimons, Joseph F.
    Hajdusek, Michal
    Morimae, Tomoyuki
    [J]. PHYSICAL REVIEW LETTERS, 2018, 120 (04)
  • [5] Succinct Classical Verification of Quantum Computation
    Bartusek, James
    Kalai, Yael Tauman
    Lombardi, Alex
    Ma, Fermi
    Malavolta, Giulio
    Vaikuntanathan, Vinod
    Vidick, Thomas
    Yang, Lisa
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT II, 2022, 13508 : 195 - 211
  • [6] Verification of Quantum Computation: An Overview of Existing Approaches
    Gheorghiu, Alexandru
    Kapourniotis, Theodoros
    Kashefi, Elham
    [J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (04) : 715 - 808
  • [7] Verification of blind quantum computation with entanglement witnesses
    Xu, Qingshan
    Tan, Xiaoqing
    Huang, Rui
    Li, Meiqi
    [J]. PHYSICAL REVIEW A, 2021, 104 (04)
  • [8] Verification of Quantum Computation: An Overview of Existing Approaches
    Alexandru Gheorghiu
    Theodoros Kapourniotis
    Elham Kashefi
    [J]. Theory of Computing Systems, 2019, 63 : 715 - 808
  • [9] Experimental quantum computation with molecules
    Kitagawa, M
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 21 - 27
  • [10] Non-interactive Classical Verification of Quantum Computation
    Alagic, Gorjan
    Childs, Andrew M.
    Grilo, Alex B.
    Hung, Shih-Han
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2020, PT III, 2020, 12552 : 153 - 180