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

Feynman, R., The character of physical law, Ch. 6, Probability and Uncertainty Transcript of the Messenger Lectures at Cornell University, presented in November 1964

1964

Earlier work this paper cites.

Laszlo Babai, Trading group theory for randomness. Proceedings of the Seventeenth Annual Symposium on the Theory of Computing, ACM. (STOC ’85), 1985

1985

Earlier work this paper cites.

Feynman, R., Quantum Mechanical Computers, Optics News, Vol. 11, Issue 2, pp. 11-20 (1985)

1985

Earlier work this paper cites.

Goldwasser, S. and Micali, S. and Rackoff, C., The knowledge complexity of interactive proof-systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, pp. 291–304, 1985

1985

Earlier work this paper cites.

Simon D.R., ”On the power of quantum computation”, Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS ’94), pp 116–123, (1994)

1994

Earlier work this paper cites.

Aharonov, D. and Ben-Or, M., Polynomial simulations of decohered quantum computers, In proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS ’96) (1996)

1996

Earlier work this paper cites.

Aharonov, D. and Ben-Or, M., Fault-tolerant quantum computation with constant error, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 176–188, 1997, ACM Press New York, NY, USA

1997

Cited alongside, same era.

Bernstein, E., and Vazirani, U. (1993) Proceedings of Symposium on the Theory of Computing, 1993. Special issue on Quantum Computation of the Siam Journal of Computing, Oct. 1997

1997

Cited alongside, same era.

Shor, P. W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM journal on computing, 26

1997

Cited alongside, same era.

Nielsen, M. and Chuang, I., Quantum computation and quantum information Cambridge University Press New York, NY, USA, 2000

2000

Cited alongside, same era.

Watrous J., “PSPACE has constant-round quantum interactive proof systems”. Theoretical Computer Science, 292(3): 575–588, 2003

Vazirani, U., “Computational constraints on scientific theories: insights from quantum computing” Workshop on the Computational World View and the Sciences, Caltech, (2007)

2007

Later among the works it cites.

, Arora, S. and Barak, B., “Computational Complexity: A Modern Approach”, Cambridge University Press, (2009)

2009

Later among the works it cites.

Broadbent, A. and Fitzsimons, J. and Kashefi, E., Universal blind quantum computation, In Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), Pages 517–527, 2009

2009

Later among the works it cites.

Aharonov, D., Ben-Or, M., and Eban E., Interactive proofs for quantum computation, Proceedings of Innovations of Computer Science (ICS 2010), China, pp. 453–469 (2010)

2010

Later among the works it cites.

Yaari, J., Ph. D. thesis, “Interactive Proofs as a Theory of Confirmation”, The Hebrew University of Jerusalem, 2011