pith. sign in

Notes on nonlinear quantum algorithms

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Recenty Abrams and Lloyd have proposed a fast algorithm that is based on a nonlinear evolution of a state of a quantum computer. They have explicitly used the fact that nonlinear evolutions in Hilbert spaces do not conserve scalar products of states, and applied a description of separated systems taken from Weinberg's nonlinear quantum mechanics. On the other hand it is known that violation of orthogonality combined with the Weinberg-type description generates unphysical, arbitrarily fast influences between noninteracting systems. It was not therefore clear whether the algorithm is fast because arbitrarily fast unphysical effects are involved. In these notes I show that this is not the case. I analyze both algorithms proposed by Abrams and Lloyd on concrete, simple models of nonlinear evolution. The description I choose is known to be free of the unphysical influences (therefore it is not the Weinberg one). I show, in particular, that the correct local formalism allows even to simplify the algorithm.

fields

quant-ph 2

years

2026 2

verdicts

UNVERDICTED 2

clear filters

representative citing papers

Quantum algorithm for Valiant-Vazirani reduction

quant-ph · 2026-06-16 · unverdicted · novelty 6.0

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

quant-ph · 2026-05-14 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Quantum algorithm for Valiant-Vazirani reduction quant-ph · 2026-06-16 · unverdicted · none · ref 5 · internal anchor

    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 quant-ph · 2026-05-14 · unverdicted · none · ref 13 · internal anchor

    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.