# Title: NP-complete Problems and Physical Reality
Authors: [Scott Aaronson][32]
(Submitted on 12 Feb 2005 ([v1][33]), last revised 21 Feb 2005 (this version, v2))
> 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.
| ----- |
| Comments: | 23 pages, minor corrections |
| Subjects: | Quantum Physics (quant-ph); Computational Complexity (cs.CC); General Relativity and Quantum Cosmology (gr-qc) |
| Journalreference: | ACM SIGACT News, March 2005 |
| Citeas: | [arXiv:quant-ph/0502072][34] |
| | (or [arXiv:quant-ph/0502072v2][35] for this version) |
## Submission history
From: Scott Aaronson [[view email][36]]
[**[v1]][33]** Sat, 12 Feb 2005 15:14:11 GMT (50kb)
[**v2]** Mon, 21 Feb 2005 10:19:21 GMT (50kb)
[Which authors of this paper are endorsers?][37] | [Disable MathJax][38] ([What is MathJax?][39])
Link back to: [arXiv][40], [form interface][41], [contact][42].