We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an Ç´AE ¿ ÐÓÓ AEµ quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with ¢´AE ÐÓÓ AEµ classical… (More)
We present several applications of quantum amplitude ampliication to nding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, HHyer, and Tapp, and imply an O(N 3=4 log N) quantum upper bound for the element distinctness problem in the comparison complexity model (contrasting with (N log N) classical… (More)
Quantum algorithms for several problems in graph theory are considered. Classical algorithms for finding the lowest weight path between two points in a graph and for finding a minimal weight spanning tree involve searching over some space. Modification of classical algorithms due to Dijkstra and Prim allows quantum search to replace classical search and… (More)
Previous studies has shown that for a weighted undirected graph having n vertices and m edges, a minimal weight spanning tree can be found with O * √ mn calls to the weight oracle. The present note shows that a given spanning tree can be verified to be a minimal weight spanning tree with only O n calls to the weight oracle and O n + √ m log n total work.
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… (More)