A Quantum Version of Schoening's Algorithm Applied to Quantum 2-Sat
Name
A quantum version.pdf
Size
149.03 KB
Format
Adobe PDF
Checksum (MD5)
edd367b1ba1b7eca8706dbbacb972c05
Author(s)
Kimmel, Shelby
Temme, Kristan
Farhi, Edward H
Alternative Title
A Quantum Version of Schoning's Algorithm Applied to Quantum 2-Sat
Date Issued
October 2016
Journal
Quantum Information & Computation
Publisher
Rinton Press
Citation
Farhi, Edward, Shelby Kimmel and Kristan Temme. "A Quantum Version of Schoening's Algorithm Applied to Quantum 2-Sat." Quantum Information & Computation 16:13-14 (2016): 1212–1227.
Version
Original manuscript
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[superscript 2]L[superscript 2]c[superscript −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.
MIT Department
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://www.rintonpress.com/xxqic16/qic-16-1314/1212-1227.pdf
