NP-complete Problems and Physical Reality
量子物理
2007-05-23 v2 计算复杂性
广义相对论与量子宇宙学
摘要
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.
引用
@article{arxiv.quant-ph/0502072,
title = {NP-complete Problems and Physical Reality},
author = {Scott Aaronson},
journal= {arXiv preprint arXiv:quant-ph/0502072},
year = {2007}
}
备注
23 pages, minor corrections