#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1998

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Harry Buhrman, Christoph Dürr, +4 authors Ronald de Wolf
- SIAM J. Comput.
- 2001

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)

- Mark Heiligman, Emil J. Volcheck
- ACM SIGSAM Bulletin
- 1998

<i>Weierstrass points</i> are an important geometric feature and birational invariant of an algebraic curve. A place <i>P</i> on a curve of genus <i>g</i> is a Weierstrass point if the corresponding point on the canonical embedding of the curve is an inflection point where the tangent plane is tangent to order at least <i>g.</i> This condition is equivalent… (More)

- Mark Heiligman
- 2000

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)

- Mark Heiligman
- ArXiv
- 2011

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.

- ‹
- 1
- ›