Quantum computers can search rapidly by using almost any transformation

Details Quantum computers can search rapidly by using almost any transformation Quantum computers can search rapidly by using almost any transformation

1997-12-03

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

Phys.Rev.Lett.80:4329-4332,1998

Physics

Quantum Physics

This paper is an adapted version of quant-ph/9711043. It has been modified to make it more readable for physicists. 9 pages, p

Scientific paper

10.1103/PhysRevLett.80.4329

A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology.

Affiliated with

Also associated with

No associations

Rating

Quantum computers can search rapidly by using almost any transformation 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 computers can search rapidly by using almost any transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum computers can search rapidly by using almost any transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221325