REVIEW 3 cited by
Searching via nonlinear quantum walk on the 2D-grid
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
abstract
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage \BHg{with} respect to the classical algorithms. For this purpose, we have considered the free lattice Hamiltonian, with linear dispersion relation introduced by Childs and Ge \cite{Childs_2014}. The numerical simulations showed that the walker finds the marked vertex in $O(N^{1/4} \log^{3/4} N) $ steps, with probability $O(1/\log N)$, for an overall complexity of $O(N^{1/4}\log^{7/4}N)$. We also proved that there exists an optimal choice of the walker parameters to avoid that the time measurement precision affects the complexity searching time of the algorithm.
Forward citations
Cited by 3 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.
-
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). Sign in to comment.