A Quantum Version of Schoening's Algorithm Applied to Quantum 2-Sat
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[su...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Rinton Press
2017
|
| Online Access: | http://hdl.handle.net/1721.1/108412 https://orcid.org/0000-0002-7309-8489 |