A Novel Approach to Quantum Heuristics for Structured Database Search
量子物理
2007-05-23 v1
摘要
An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially with problem size. Each oracle call is followed by a measurement, implying that it is necessary to maintain quantum coherence for only one oracle call at a time.
引用
@article{arxiv.quant-ph/0106152,
title = {A Novel Approach to Quantum Heuristics for Structured Database Search},
author = {Brian Murphy},
journal= {arXiv preprint arXiv:quant-ph/0106152},
year = {2007}
}
备注
17 pages, 4 figures