Quantum proofs
From MaRDI portal
Publication:2808277
Abstract: Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class class{NP}, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, the fact that a quantum proof state could be a superposition over exponentially many classical states appears to offer computational advantages over classical proof strings. In the interactive proof system setting, one may consider a verifier and one or more provers that exchange and process quantum information rather than classical information during an interaction for a given input string, giving rise to quantum complexity classes such as QIP, QSZK, and QMIP* that represent natural quantum analogues of IP, SZK, and MIP. While quantum interactive proof systems inherit some properties from their classical counterparts, they also possess distinct and uniquely quantum features that lead to an interesting landscape of complexity classes based on variants of this model. In this survey we provide an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define. In particular, we discuss non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive proof systems and the complexity class class{QSZK}, and multiprover interactive proof systems and the complexity classes QMIP, QMIP*, and MIP*.
Recommendations
Cited in
(19)- Quantum interactive proofs and the complexity of separability testing
- Classical verification of quantum proofs
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Quantum interactive proofs using quantum energy teleportation
- Proofs of proximity for distribution testing
- The Connes embedding problem: a guided tour
- On quantum interactive proofs with short messages
- Efficient Quantum Algorithms for Testing Symmetries of Open Quantum Systems
- A quantum characterization of NP
- The complexity of translationally invariant spin chains with low local dimension
- Spectral representation of some computably enumerable sets with an application to quantum provability
- Ancilla dimension in quantum channel discrimination
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
- Brief announcement: Distributed quantum proofs for replicated data
- Bounds on the power of proofs and advice in general physical theories
- Temporally unstructured quantum computation
- Quantum versus classical proofs and advice
- Distinguishing short quantum computations
This page was built for publication: Quantum proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808277)
