Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics

Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity. We describe how QM can be tested in this regime by extending the usual scientific paradigm to include {\it interactive experiments}.

[1]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[2]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[3]  Dorit Aharonov,et al.  Polynomial simulations of decohered quantum computers , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  Avinatan Hassidim,et al.  Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[5]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[6]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[7]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Richard Phillips Feynman,et al.  Quantum mechanical computers , 1984, Feynman Lectures on Computation.

[9]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[10]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[11]  John Watrous,et al.  PSPACE has constant-round quantum interactive proof systems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  R. Feynman.  The Character of Physical Law , 1965 .

[13]  Adam D. Smith,et al.  Authentication of quantum messages , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[15]  R. Feynman.  Quantum mechanical computers , 1986 .