6 citations · 6 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2003★ 6 cited
Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs
Mark Heiligman
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 mini…
quant-ph2000
Finding Matches between Two Databases on a Quantum Computer
Mark Heiligman
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 (measured in q…