Finding Matches between Two Databases on a Quantum Computer

Details Finding Matches between Two Databases on a Quantum Computer Finding Matches between Two Databases on a Quantum Computer

2000-06-30

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

Physics

Quantum Physics

Scientific paper

Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memory accesses and accesses to each list). The amount of quantum memory required is $O(N^{1/2})$. The quantum algorithm that accomplishes this consists of an inner Grover search combined with a partial sort all sitting inside of an outer Grover search.

Affiliated with

Also associated with

No associations

Rating

Finding Matches between Two Databases on a Quantum Computer 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 Finding Matches between Two Databases on a Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Matches between Two Databases on a Quantum Computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-288399