On the Complexity of Quantum Searching Using Complex Queries
量子物理
2007-05-23 v1
摘要
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version of the algorithm we discuss its complexity.
引用
@article{arxiv.quant-ph/9706052,
title = {On the Complexity of Quantum Searching Using Complex Queries},
author = {Markus Grassl and Thomas Beth},
journal= {arXiv preprint arXiv:quant-ph/9706052},
year = {2007}
}
备注
4 pages, RevTeX, no figures