Lower Bounds on Quantum Query Complexity
量子物理
2015-06-02 v1
摘要
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods.
引用
@article{arxiv.quant-ph/0509153,
title = {Lower Bounds on Quantum Query Complexity},
author = {Peter Hoyer and Robert Spalek},
journal= {arXiv preprint arXiv:quant-ph/0509153},
year = {2015}
}
备注
survey, 23 pages