Finding Matches between Two Databases on a Quantum Computer
Quantum Physics
2007-05-23 v1
Abstract
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 quantum memory accesses and accesses to each list). The amount of quantum memory required is . The quantum algorithm that accomplishes this consists of an inner Grover search combined with a partial sort all sitting inside of an outer Grover search.
Cite
@article{arxiv.quant-ph/0006136,
title = {Finding Matches between Two Databases on a Quantum Computer},
author = {Mark Heiligman},
journal= {arXiv preprint arXiv:quant-ph/0006136},
year = {2007}
}