Classical Verification of Quantum Proofs

被引：22
|
作者：
Ji, Zhengfeng [1 ,2 ,3 ]
机构：
[1] Univ Technol Sydney, Ctr Quantum Computat & Intelligent Syst, Sch Software, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
[2] Univ Waterloo, Inst Quantum Comp, Waterloo, ON, Canada
[3] Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing, Peoples R China
来源：
STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING | 2016年
基金：
加拿大自然科学与工程研究理事会;
关键词：
Quantum Interactive Proofs; Local Hamiltonian Problem; Non-Local Games; Entanglement; Bell Inequalities; HIDDEN-VARIABLES; COMPLEXITY; SYSTEMS;
D O I：
10.1145/2897518.2897634
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It follows from this protocol that approximating the non-local value of a multi-player one-round game to inverse polynomial precision is QMA-hard. Our work makes an interesting connection between the theory of QMA-completeness and Hamiltonian complexity on one hand and the study of non-local games and Bell inequalities on the other.
引用
收藏
页码：885 / 898
页数：14
相关论文
共 50 条
  • [21] AN INTERPRETATION OF CLASSICAL PROOFS
    HELMAN, G
    JOURNAL OF PHILOSOPHICAL LOGIC, 1983, 12 (01) : 39 - 71
  • [22] Practically Feasible Robust Quantum Money with Classical Verification
    Kumar, Niraj
    CRYPTOGRAPHY, 2019, 3 (04) : 1 - 24
  • [23] Non-interactive Classical Verification of Quantum Computation
    Alagic, Gorjan
    Childs, Andrew M.
    Grilo, Alex B.
    Hung, Shih-Han
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT III, 2020, 12552 : 153 - 180
  • [24] Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
    Li, Xingjian
    Liu, Qipeng
    Pelecanos, Angelos
    Yamakawa, Takashi
    Leibniz International Proceedings in Informatics, LIPIcs, 2024, 287
  • [25] Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle
    Li, Xingjian
    Liu, Qipeng
    Pelecanos, Angelos
    Yamakawa, Takashi
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [26] Quantum Proofs
    Vidick, Thomas
    Watrous, John
    FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2015, 11 (1-2): : 1 - +
  • [27] Reuse of proofs in software verification
    Reif, W
    Stenzel, K
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 1996, 21 : 229 - 244
  • [28] Probabilistic verification of proofs in calculuses
    Dantsin E.Y.
    Journal of Mathematical Sciences, 2000, 98 (4) : 479 - 489
  • [29] MINIMAL FROM CLASSICAL PROOFS
    SCHWICHTENBERG, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 326 - 328
  • [30] Short proofs of classical theorems
    Bondy, JA
    JOURNAL OF GRAPH THEORY, 2003, 44 (03) : 159 - 165
12345