Work

Adiabatic quantum computing for random satisfiability problems

Year: 2003
Type: article
Abstract: The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables, the adiabatic method gives solution probabilities close to 1 for problem sizes feasible to evaluate via simulation on current computers. However, for these sizes the minimum energy gaps of most instances are fairly large, so the good performance scaling seen for small problems may not reflect asymptotic behavior where costs are dominated by tiny gaps. Moreover, the resulting search costs are much higher than for other methods. Variants of the quantum algorithm that do not match the adiabatic limit give lower costs, on average, and slower growth than the conventional GSAT heuristic method.
Author: Tad Hogg
Language: English
Open Access status: green
OpenAlex ID: W2031963870
FWCI: 5.961
Cites: 34
Cited by: 115
Related to: 10