dorsal/arxiv
View SchemaOn The Power of Exact Quantum Polynomial Time
| Authors | Gilles Brassard, Peter Hoyer |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9612017 |
| URL | https://arxiv.org/abs/quant-ph/9612017 |
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.
{
"annotation_id": "ed0dee68-0459-47e3-a4d7-17ecc0622b9b",
"date_created": "2026-03-02T18:02:37.982000Z",
"date_modified": "2026-03-02T18:02:37.982000Z",
"file_hash": "182ed21ddb2270848c363a083b1801aba0fe34d2472d8c6adfb11e63f2d13fc4",
"private": false,
"record": {
"abstract": "We investigate the power of quantum computers when they are required to\nreturn an answer that is guaranteed correct after a time that is upper-bounded\nby a polynomial in the worst case. In an oracle setting, it is shown that such\nmachines can solve problems that would take exponential time on any classical\nbounded-error probabilistic computer.",
"arxiv_id": "quant-ph/9612017",
"authors": [
"Gilles Brassard",
"Peter Hoyer"
],
"categories": [
"quant-ph"
],
"title": "On The Power of Exact Quantum Polynomial Time",
"url": "https://arxiv.org/abs/quant-ph/9612017"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f72d1c12-7617-473b-867a-36c77a9fee24",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}