Multi-channel Zeno dragging converges fastest in the weak continuous measurement limit, and optimal control finds schedules that beat linear interpolation.
A Quantum Version of Sch\"oning's Algorithm Applied to Quantum 2-SAT
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
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.