NPcomplete Problems and Physical Reality
Abstract
Can NPcomplete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantummechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, MalamentHogarth 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 NPcomplete problems efficiently, I argue that by studying them, we can learn something not only about computation but also about physics.
 Publication:

arXiv eprints
 Pub Date:
 February 2005
 DOI:
 10.48550/arXiv.quantph/0502072
 arXiv:
 arXiv:quantph/0502072
 Bibcode:
 2005quant.ph..2072A
 Keywords:

 Quantum Physics;
 Computational Complexity
 EPrint:
 23 pages, minor corrections