Quantum Mechanical Square Root Speedup in a Structured Search Problem

Details Quantum Mechanical Square Root Speedup in a Structured Search Problem Quantum Mechanical Square Root Speedup in a Structured Search Problem

1997-11-18

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

Physics

Quantum Physics

6 pages, REVTeX; correspondence to farhi@mitlns.mit.edu

Scientific paper

An unstructured search for one item out of N can be performed quantum mechanically in time of order square root of N whereas classically this requires of order N steps. This raises the question of whether square root speedup persists in problems with more structure. In this note we focus on one example of a structured problem and find a quantum algorithm which takes time of order the square root of the classical time.

Affiliated with

Also associated with

No associations

Rating

Quantum Mechanical Square Root Speedup in a Structured Search Problem 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 Mechanical Square Root Speedup in a Structured Search Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Mechanical Square Root Speedup in a Structured Search Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461050