Robustness of the quantum search algorithm

Details Robustness of the quantum search algorithm Robustness of the quantum search algorithm

Oct 1999

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999aipc..490..405p&link_type=abstract

The eighth mexican school on particles and fields. AIP Conference Proceedings, Volume 490, pp. 405-408 (1999).

Computer Science

Radiation Detectors, Computer Data Analysis, Data Acquisition: Hardware And Software, Data Analysis: Algorithms And Implementation, Data Management

Scientific paper

We find exact results for Grover's quantum search algorithm and analyze
its behavior under noisy situations when no quantum correction codes are
available. We compute how the algorithm slows down: it is still better
than a classical one, provided the noise is smaller than some bound,
which we also compute.

Affiliated with

Also associated with

No associations

Rating

Robustness of the quantum search algorithm 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 Robustness of the quantum search algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of the quantum search algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1082887