Quantum query complexity of some graph problems

Details Quantum query complexity of some graph problems Quantum query complexity of some graph problems

2004-01-15

arxiv.org/abs/quant-ph/0401091v2

Physics

Quantum Physics

7 figures. Subsumes and replaces quant-ph/9607014, quant-ph/0303131, and quant-ph/0303169

Scientific paper

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

Affiliated with

Also associated with

No associations

Rating

Quantum query complexity of some graph problems 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 query complexity of some graph problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum query complexity of some graph problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585774