Classical verification of quantum proofs

DOI10.4086/TOC.2019.V015A005MaRDI QIDQ5204823zbMATH OpenOpenAlexFDO

Authors Zhengfeng Ji

Publication date 5 December 2019

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2019.v015a005

zbMATH Keywords

Bell inequalitiesentanglementlocal Hamiltonian problemnonlocal gamesquantum interactive proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coherence, entanglement, quantum correlations (81P40) Quantum computation (81P68)

Recommendations

• Classical verification of quantum proofs
• Classical verification of quantum computations
• A multiprover interactive proof system for the local Hamiltonian problem (extended abtract)
• Compression of quantum multi-prover interactive proofs
• How to Verify a Quantum Computation

Cited in

(10)

• Verification of quantum computation: an overview of existing approaches
• QMA with subset state witnesses
• A multiprover interactive proof system for the local Hamiltonian problem (extended abtract)
• The power of unentanglement
• Compression of quantum multi-prover interactive proofs
• Classical verification of quantum proofs
• "NON-IDENTITY-CHECK" IS QMA-COMPLETE
• NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE
• Quantum interactive proofs using quantum energy teleportation
• Robustness verification of quantum classifiers

This page was built for publication: Classical verification of quantum proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204823)