NP-complete Problems and Physical Reality
Scott Aaronson
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.
Create a lesson
Related papers
Generative learning of time series with holographic quantum circuit sampling
Bingzhi Zhang, Matthew W. Lee, Tom Finke et al.
Entanglement detection in dynamical quantum systems
Xingjian Zhang, Jiayi Wu, Jue Xu et al.
Partial-coherence weak measurement of polarization qubits with a temporal pointer: theory and experiment
Shane P. Gervais, Lambert Giner
A complete classification of operator controllability for closed three-level quantum systems driven by a single control
Sergey Kuznetsov, Alexander Pechen
Entanglement generation from degeneracy breaking of superradiant Liouvillian steady states by local operations
Adam Burgess, Erik M. Gauger
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour