On The Power of Exact Quantum Polynomial Time
Quantum Physics
2007-05-23 v1
Abstract
We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst case. In an oracle setting, it is shown that such machines can solve problems that would take exponential time on any classical bounded-error probabilistic computer.
Cite
@article{arxiv.quant-ph/9612017,
title = {On The Power of Exact Quantum Polynomial Time},
author = {Gilles Brassard and Peter Hoyer},
journal= {arXiv preprint arXiv:quant-ph/9612017},
year = {2007}
}
Comments
10 pages, LaTeX2e, no figures