arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0502072quant-phcs.CCgr-qc

NP-complete Problems and Physical Reality

Scott Aaronson

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑