Abstract

Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and “anthropic computing. ” The section on soap bubbles even includes some “experimental ” results. While I do not believe that any of the proposals will let us solve NP-complete problems efficiently, I argue that by studying them, we can learn something not only about computation but also about physics. 1

Citations

10436	Computers and Intractability: A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
1294	Quantum Computation and Quantum Information - Nielsen, Chuang - 2000
844	Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer - Shor - 1997
825	A fast quantum mechanical algorithm for database search - Grover - 1996
361	On the power of quantum computation - Simon - 1997
323	Complexity and Real Computation - Blum, Cucker, et al. - 1997
318	Strengths and weaknesses of quantum computation - Bennet, Bernstein, et al. - 1999
261	Quantum lower bounds by polynomials - Beals, Buhrman, et al.
235	A Suggested Interpretation of the Quantum Theory in Terms of Hidden Variables - Bohm - 1952
193	Average case complete problems - Levin - 1986
180	Algebraic Complexity Theory - Bürgisser, Clausen, et al. - 1997
169	Natural proofs - Razborov, Rudich - 1997
139	Quantum lower bounds by quantum arguments - Ambainis - 2000
112	S.: Does co-NP have short interactive proofs - Boppana, Hastad, et al. - 1987
112	Angular momentum: an approach to combinatorial space-time - Penrose - 1971
104	Y.: Quantum lower bounds for the collision and element distinctness problems - Aaronson, Shi
89	PP is closed under intersection - Beigel, Reingold, et al. - 1995
81	A modular functor which is universal for quantum computation - Freedman, Larsen, et al.
78	Some NP-complete geometric problems - Garey, Graham, et al. - 1976
68	The Holographic principle - Bousso - 2002
62	Turing machines that take advice - Karp, Lipton - 1982
60	Quantum lower bound for the collision problem - AARONSON - 2002
56	Quantum algorithm for the Hilbert’s tenth problem, Archive quant-ph/0110136 - Kieu - 2001
52	A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem - Farhi - 2001
50	Relativizations of the P=?NP question - Baker, Gill, et al. - 1975
48	The history and status of the P versus NP question - Sipser - 1992
47	Limitations of Quantum Advice and One-Way Communication - Aaronson
47	A Universal Upper Bound On The Entropy To Energy Ratio For Bounded Systems,” Phys - Bekenstein - 1981
45	A polynomial quantum algorithm for approximating the Jones polynomial - Aharonov, Jones, et al. - 2006
43	B.: What is Thought - Baum - 2004
42	How powerful is adiabatic Quantum Computation - Dam, Mosca, et al. - 2001
40	Testing Quantum Mechanics - Weinberg - 1989
38	Quantum computing, postselection, and probabilistic - Aaronson - 2005
37	Threshold computation and cryptographic security - Han, Hemaspaandra, et al. - 1997
36	P=BPP unless E has subexponential circuits: derandomizing the XOR Lemma - Impagliazzo, Wigderson - 1997
35	The complexity of analog computation - Vergis, Steiglitz, et al. - 1986
34	Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #p problems - ABRAMS, LLOYD - 1998
28	Zur Quantenmechanik der Stoßvorgänge,” Z. Phys - Born - 1926
25	The black hole final state - Horowitz, Maldacena - 2004
24	Circuit minimization problem - Kabanets, Cai - 2000
22	One complexity theorist’s view of quantum computing - Fortnow
21	Quantum mechanics near closed timelike lines - Deutsch - 1991
21	The End of Science - Horgan - 1996
20	On the power of random access machines - Schönhage - 1979
19	Weinberg’s non-linear quantum mechanics and superluminal communications - Gisin - 1990
19	The computational complexity of the Tutte plane: the bipartite case - Vertigan, Welsh - 1992
18	Subquantum information and computation - Valentini
16	Weinberg’s nonlinear quantum mechanics and the Einstein-PodolskyRosen paradox - Polchinski - 1991
15	The quantum adiabatic optimization algorithm and local minima - Reichardt - 2004
14	Cosmological lower bound on the circuit complexity of a small problem in logic - Stockmeyer, Meyer