REVIEW 4 cited by
NP-complete Problems and Physical Reality
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 4 Pith papers
-
Quantum algorithm for Valiant-Vazirani reduction
Constructs quantum filtered oracle for Valiant-Vazirani theorem reducing SAT to UNIQUE SAT, enabling polynomial-time NP solution via torsion nonlinearity in noise-free limit but not #P.
-
Nonlinear Hamiltonians and Boolean satisfiability
Nonlinear Hamiltonians on ancilla qubits enable efficient solution of UNIQUE SAT with ⟨σ^z⟩σ^z, 3SAT with ⟨σ^x⟩σ^y - ⟨σ^y⟩σ^x, and #SAT with ⟨σ^y⟩⟨σ^z⟩σ^x - ⟨σ^x⟩⟨σ^z⟩σ^y nonlinearity.
-
A Compressive Sensing Inspired Monte-Carlo Method for Combinatorial Optimization
Random samples of a compressible combinatorial objective, converted to moment sketches and decoded by matching pursuit, can recover the optimum with far fewer function calls than brute force.
-
From spin squeezing to fast state discrimination
In the large-N limit, spin squeezing torsion yields a nonlinear qubit governed by the two-state Gross-Pitaevskii equation that solves single-input state discrimination on the Bloch sphere.
Discussion (0). Continue with ORCID to comment.