Beyond IP = PSPACE and QIP = PSPACE: Interactive Proofs in Arbitrary Physical Theories
Kishor Bharti
Abstract
The equalities IP = PSPACE and QIP = PSPACE, the latter achievable with three messages, raise a basic question: how much of an interactive proof's power comes from the underlying physical theory? We study interactive proofs in general probabilistic theories, which include classical and quantum theory. The answer depends on what the prover and verifier exchange and how the theory specifies efficient operations. When they exchange only classical messages, protocols in every theory satisfying our standard assumptions decide exactly PSPACE. For protocols with a quantum verifier and quantum messages, allowing a prover to use any theory containing quantum theory does not increase the maximum acceptance probability. Thus, the three-message PSPACE result remains valid against such provers. When messages may be arbitrary systems, the interactive-proof class can strictly exceed PSPACE.
Create a lesson
Related papers
Single-Particle Spectral Estimation
Adrian Chapman, Charles Derby, Steven T. Flammia et al.
Learning SYK Hamiltonians
Anurag Anshu, Srinivasan Arunachalam, Sitan Chen et al.
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Fuchuan Wei, Kong-Wing Wu, Zhengwei Liu et al.
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh et al.
Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
Omar Al-Ghattas, David Gamarnik, Bobak T Kiani