Title: A Quantum Version of Sch\"oning's Algorithm Applied to Quantum 2-SAT
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 Schoning's probabilistic algorithm for k-SAT.
Publication Year: 2016
Publication Date: 2016-03-22
Language: en
Type: preprint
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot