analiza aiqbench
This research investigates the computational power of interactive proofs within general probabilistic theories, determining how much their efficacy relies on specific physical laws versus classical constraints. The study establishes that while classical and quantum message exchanges are bounded by PSPACE, allowing arbitrary physical systems for messages can strictly exceed these limits. This work advances our understanding of the fundamental relationship between physical theory and computational complexity classes in quantum information science.
Beyond IP = PSPACE and QIP = PSPACE: Interactive Proofs in Arbitrary Physical Theories
arXiv:2610.00847v1 Announce Type: new 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.
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.
Quantum Physics (quant-ph); Computational Complexity (cs.CC)
arXiv:2610.00847 [quant-ph]
(or arXiv:2610.00847v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.00847 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 226 cuvinte
Subiecte conexe

The Alignment Problem: Computer Science Meets Analytic Philosophy
LessWrong · 18 oct. 2026

The Entangled Dimensions of Decision Theory
LessWrong · 30 iul. 2026
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026