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 条
  • [31] Probabilistic Proofs of Classical Theorems
    Burdzy, Krzysztof
    BROWNIAN MOTION AND ITS APPLICATIONS TO MATHEMATICAL ANALYSIS: ECOLE D'ETE DE PROBABILITES DE SAINT-FLOUR XLIII - 2013, 2014, 2106 : 11 - 19
  • [32] Classical Proofs as Parallel Programs
    Aschieri, Federico
    Ciabattoni, Agata
    Genco, Francesco A.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (277): : 43 - 57
  • [33] Polarization of classical proofs and reversion
    Quatrini, M
    DeFalco, LT
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1996, 323 (02): : 113 - 116
  • [34] Minimal from classical proofs
    Schwichtenberg, Helmut
    Senjak, Christoph
    ANNALS OF PURE AND APPLIED LOGIC, 2013, 164 (06) : 740 - 748
  • [35] Experimental verification of differences between classical and quantum polarization properties
    Usachev, P
    Söderholm, J
    Björk, G
    Trifonov, A
    OPTICS COMMUNICATIONS, 2001, 193 (1-6) : 161 - 173
  • [36] Constant-Round Blind Classical Verification of Quantum Sampling
    Chung, Kai-Min
    Lee, Yi
    Lin, Han-Hsuan
    Wu, Xiaodi
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT III, 2022, 13277 : 707 - 736
  • [37] Classical verification of quantum circuits containing few basis changes
    Demarie, Tommaso F.
    Ouyang, Yingkai
    Fitzsimons, Joseph F.
    PHYSICAL REVIEW A, 2018, 97 (04)
  • [38] Verification of proofs of unsatisfiability for CNF formulas
    Goldberg, E
    Novikov, Y
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, PROCEEDINGS, 2003, : 886 - 891
  • [39] Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm
    Franco, Nicola
    Wollschlaeger, Tom
    Gao, Nicholas
    Lorenz, Jeanette Miriam
    Guennemann, Stephan
    2022 IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE 2022), 2022, : 142 - 153
  • [40] Verification of Hardware and Software with Fuzzing and Proofs
    Muduli, Sujit Kumar
    COMPANION PROCEEDINGS OF THE 2022 ACM SIGPLAN INTERNATIONAL CONFERENCE ON SYSTEMS, PROGRAMMING, LANGUAGES, AND APPLICATIONS: SOFTWARE FOR HUMANITY, SPLASH COMPANION 2022, 2022, : 34 - 37
12345