Quantum random walk search on satisfiability problems

Abstract

Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of… (More)

Topics

23 Figures and Tables

Cite this paper

@inproceedings{Hoyer2008QuantumRW, title={Quantum random walk search on satisfiability problems}, author={Stephan Hoyer and David A. Meyer}, year={2008} }