On The Power of Exact Quantum Polynomial Time

Simple item page
dc.creatorBrassard, Gilles
dc.creatorHoyer, Peter
dc.date1996-12-03
dc.date.accessioned2026-07-07T06:14:05Z
dc.date.available2026-07-07T06:14:05Z
dc.descriptionWe 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.
dc.description10 pages, LaTeX2e, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9612017
dc.identifierhttp://arxiv.org/abs/quant-ph/9612017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93331
dc.subjectQuantum Physics
dc.titleOn The Power of Exact Quantum Polynomial Time
dc.typetext

Files

Collections

arXiv