REVIEW 2 cited by
A Quantum Version of Sch\"oning's Algorithm Applied to Quantum 2-SAT
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
We study a quantum algorithm that consists of a simple quantum Markov process, and we analyze its behavior on restricted versions of Quantum 2-SAT. We prove that the algorithm solves this decision problem with high probability for n qubits, L clauses, and promise gap c in time O(n^2 L^2 c^{-2}). If the Hamiltonian is additionally polynomially gapped, our algorithm efficiently produces a state that has high overlap with the satisfying subspace. The Markov process we study is a quantum analogue of Sch\"oning's probabilistic algorithm for k-SAT.
Forward citations
Cited by 2 Pith papers
-
Optimal schedule of multi-channel quantum Zeno dragging with application to solving the k-SAT problem
Multi-channel Zeno dragging converges fastest in the weak continuous measurement limit, and optimal control finds schedules that beat linear interpolation.
-
Training Optimization for Gate-Model Quantum Neural Networks
The paper maps gate-model quantum neural networks into a constraint-machine framework and declares supervised learning and backpropagation optimal, but the proofs rely on textbook results and do not validate the propo...
Discussion (0). Continue with ORCID to comment.