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 条
  • [41] On the power of quantum proofs
    Raz, R
    Shpilka, A
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 260 - 274
  • [42] Quantum Proofs of Proximity
    Dall'Agnol, Marcel
    Gur, Tom
    Moulik, Subhayan Roy
    Thaler, Justin
    QUANTUM, 2022, 6
  • [43] Quantum Proofs of Knowledge
    Unruh, Dominique
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2012, 2012, 7237 : 135 - 152
  • [44] Nullstellensatz-Proofs for Multiplier Verification
    Kaufmann, Daniela
    Biere, Armin
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2020, 2020, 12291 : 368 - 389
  • [45] Efficient non-interactive zero-knowledge proofs for quantum range verification in blockchain
    Sriman, B.
    Kumar, S. Ganesh
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2024, 17 (05) : 2661 - 2674
  • [46] Existential Inertia and Classical Theistic Proofs
    Oppy, Graham
    RELIGIOUS STUDIES, 2025, 61 (01) : 258 - 262
  • [47] A note on the complexity of classical and intuitionistic proofs
    Baaz, Matthias
    Leitsch, Alexander
    Reis, Giselle
    2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 657 - 666
  • [48] Polarized and focalized linear and classical proofs
    Laurent, O
    Quatrini, M
    de Falco, LT
    ANNALS OF PURE AND APPLIED LOGIC, 2005, 134 (2-3) : 217 - 264
  • [49] A Constructive Logic with Classical Proofs and Refutations
    Barenbaum, Pablo
    Freund, Teodoro
    2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
  • [50] Classical Proofs' Essence and Diagrammatic Computation
    Lescanne, Pierre
    Zunic, Dragisa
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS A-C, 2011, 1389
12345