Affiliation:
1. University of Rochester, Rochester, NY
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.
Publisher
Association for Computing Machinery (ACM)
Reference75 articles.
1. Quantum lower bound for the collision problem
2. S. Aaronson. Quantum computing and hidden variables. Accepted to Phys. Rev. A. quant-ph/0408035 and quant-ph/0408119 2004. S. Aaronson. Quantum computing and hidden variables. Accepted to Phys. Rev. A. quant-ph/0408035 and quant-ph/0408119 2004.
3. S. Aaronson. Quantum computing postselection and probabilistic polynomial-time. Submitted. quant-ph/0412187 2004. S. Aaronson. Quantum computing postselection and probabilistic polynomial-time. Submitted. quant-ph/0412187 2004.
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献