2017/11/07 by Simon C. Benjamin, Benjamin, Simon C., Liming Zhao +3 · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1711.02687
openalex publication_date 2017/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the performance of a quantum algorithm for solving classical 3-SAT problems. A cycle of post-selected measurements drives the computer's register monotonically toward a steady state which is correlated to the classical solution(s). An internal parameter θ determines both the degree of correlation and the success probability, thus controlling the algorithm's runtime. Optionally this parameter can be gradually evolved during the algorithm's execution to create a Zeno-like effect; this can be viewed as an adiabatic evolution of a Hamiltonian which remains frustration-free at all points, and we lower-bound the corresponding gap. In exact numerical simulations of small systems up to 34 qubits our approach competes favourably with a high-performing classical 3-SAT solver, which itself outperforms a brute-force application of Grover's search.