Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum Mechanics

This chapter contains sections titled: 11.1 Polynomial Time and the Extended Church—Turing Thesis, 11.2 Interactive Proofs, 11.3 Interactive Proofs for Quantum Mechanics, 11.4 How Weak Verifiers Can Test Strong Machines: Proof Idea, 11.5 Further Complications: Can the Prover Apply the Gates?, 11.6 Summary, 11.7 Related Work, Acknowledgments, Notes, References