Physics – Quantum Physics
Scientific paper
2007-02-20
Quantum Information & Computation, vol. 9, no. 7&8, pp. 0628-0647, 2009
Physics
Quantum Physics
21 pages, 3 figures; v2 has minor corrections and improvements
Scientific paper
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can achieve at most a quadratic improvement in query complexity over classical algorithms, up to logarithmic factors; we also give quantum algorithms that almost achieve this optimal reduction in complexity. In one model, we give an improved quantum algorithm for searching forest-like posets; in the other, we give an optimal O(sqrt(m))-query quantum algorithm for searching posets derived from m*m arrays sorted by rows and columns. This leads to a quantum algorithm that finds the intersection of two sorted lists of n integers in O(sqrt(n)) time, which is optimal.
No associations
LandOfFree
Quantum search of partially ordered sets 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 search of partially ordered sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum search of partially ordered sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383855