Quantum search by measurement
量子物理
2007-05-23 v1
摘要
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.
引用
@article{arxiv.quant-ph/0204013,
title = {Quantum search by measurement},
author = {Andrew M. Childs and Enrico Deotto and Edward Farhi and Jeffrey Goldstone and Sam Gutmann and Andrew J. Landahl},
journal= {arXiv preprint arXiv:quant-ph/0204013},
year = {2007}
}
备注
8 pages, 2 figures