Quantum search by measurement

Simple item page
dc.creatorChilds, Andrew M.
dc.creatorDeotto, Enrico
dc.creatorFarhi, Edward
dc.creatorGoldstone, Jeffrey
dc.creatorGutmann, Sam
dc.creatorLandahl, Andrew J.
dc.date2002-04-03
dc.date.accessioned2026-07-07T06:03:55Z
dc.date.available2026-07-07T06:03:55Z
dc.descriptionWe 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.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0204013
dc.identifierhttp://arxiv.org/abs/quant-ph/0204013
dc.identifierPhys. Rev. A 66, 032314 (2002)
dc.identifierdoi:10.1103/PhysRevA.66.032314
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90120
dc.subjectQuantum Physics
dc.titleQuantum search by measurement
dc.typetext

Files

Collections

arXiv