Quantum computers can search rapidly by using almost any selective transformations

Details Quantum computers can search rapidly by using almost any selective transformations Quantum computers can search rapidly by using almost any selective transformations

2007-11-27

arxiv.org/abs/0711.4299v2

Physics

Quantum Physics

8 pages, Accepted for publication in PRA

Scientific paper

10.1103/PhysRevA.78.022332

The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a classical computer. The algorithm uses selective transformations to distinguish the initial state and target state from other states. It does not succeed unless the selective transformations are very close to phase-inversions. Here we show a way to go beyond this limitation. An important application lies in quantum error-correction, where the errors can cause the selective transformations to deviate from phase-inversions. The algorithms presented here are robust to errors as long as the errors are reproducible and reversible. This particular class of systematic errors arise often from imperfections in apparatus setup. Hence our algorithms offer a significant flexibility in the physical implementation of quantum search.

Affiliated with

Also associated with

No associations

Rating

Quantum computers can search rapidly by using almost any selective transformations 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 selective transformations, 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 selective transformations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687001