Binary Subdivision for Quantum Search

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider in this paper the possibility of embedding a quantum search algorithm within a classical binary search framework. The result appears promising: taking full advantage of quantum parallelism, we show that it may actually be possible to search an unstructured list in O(lg(N)), provided we are willing to restart the quantum search multiple times with a different sequence of qubits and perform a series of non-unitary measurements at the end of each.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Binary Subdivision for Quantum Search 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 Binary Subdivision for Quantum Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Subdivision for Quantum Search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-541380

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.