Curator's Take
This theoretical work explores a fascinating hybrid approach that combines conventional quantum circuits with hypothetical nonlinear quantum evolution to tackle some of computer science's hardest problems, including NP-complete satisfiability. The authors demonstrate that if we could couple standard fault-tolerant quantum computers to ancilla qubits governed by nonlinear Schrödinger equations, we could efficiently solve problems like 3SAT that are believed to be intractable even for quantum computers operating under normal physics. While purely theoretical since nonlinear quantum mechanics violates fundamental principles like unitarity and the no-cloning theorem, this work provides valuable insights into the computational boundaries imposed by quantum mechanics itself. The research effectively illustrates why quantum mechanics' linear structure, while enabling quantum speedups for certain problems, also fundamentally limits what quantum computers can achieve compared to hypothetical nonlinear quantum systems.
— Mark Eatherly
Summary
We consider an extended model of quantum computation where a scalable fault-tolerant quantum computer is coupled to one or more ancilla qubits that evolve according to a nonlinear Schrödinger equation. Following the approach of Abrams and Lloyd, an efficient quantum circuit evaluating an $n$-bit Boolean function in conjunctive normal form is used to prepare an ancilla encoding its number $s$ of satisfying assignments ($0 \le s \le 2^n$). This is followed by a nonlinear quantum state discrimination gate on the ancilla qubit that is used to learn properties of $s$. Here we consider three types of state discriminators generated by different nonlinear Hamiltonians. First, given a restricted Boolean satisfiability problem with the promise of at most one satisfying assignment ($ 0 \le s \le 1$), we show that a qubit with $\langle σ^z \rangle σ^z$ nonlinearity can be used to efficiently determine whether $s = 0$ or $s = 1$, solving the UNIQUE SAT problem. Here $\langle A \rangle := \langle ψ| A |ψ\rangle $ denotes expectation in the current state. UNIQUE SAT is NP-hard under a randomized polynomial-time reduction (of course any discussion of complexity assumes a scalable, fault-tolerant implementation). Second, for unrestricted satisfiability problems with $ 0 \le s \le 2^n$, a Hamiltonian with $ \langle σ^x \rangle σ^y - \langle σ^y \rangle σ^x$ nonlinearity can be used to efficiently determine whether $s=0$ or $s>0$, thereby solving 3SAT, which is NP-complete. Finally, we show that $ \langle σ^y \rangle \langle σ^z \rangle σ^x - \langle σ^x \rangle \langle σ^z \rangle σ^y $ nonlinearity can be used to efficiently measure $s$ and solve #SAT, which is #P-complete. The nonlinear models are of mean field type and might be simulated with ultracold atoms.