Quantum search by measurement

Details Quantum search by measurement Quantum search by measurement

2002-04-03

arxiv.org/abs/quant-ph/0204013v1

Phys. Rev. A 66, 032314 (2002)

Physics

Quantum Physics

8 pages, 2 figures

Scientific paper

10.1103/PhysRevA.66.032314

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.

Affiliated with

Also associated with

No associations

Rating

Quantum search by measurement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum search by measurement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum search by measurement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340489