dorsal/arxiv
View SchemaQuantum Computing with Very Noisy Devices
| Authors | E. Knill |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0410199 |
| URL | https://arxiv.org/abs/quant-ph/0410199 |
| DOI | 10.1038/nature03350 |
Abstract
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices called ``gates'' that tend to destroy the fragile quantum states needed for computation. The goal of fault-tolerant quantum computing is to compute accurately even when gates have a high probability of error each time they are used. Here we give evidence that accurate quantum computing is possible with error probabilities above 3% per gate, which is significantly higher than what was previously thought possible. However, the resources required for computing at such high error probabilities are excessive. Fortunately, they decrease rapidly with decreasing error probabilities. If we had quantum resources comparable to the considerable resources available in today's digital computers, we could implement non-trivial quantum computations at error probabilities as high as 1% per gate.
{
"annotation_id": "b59577fe-5723-4842-89da-dc8d2acee107",
"date_created": "2026-03-02T18:02:13.254000Z",
"date_modified": "2026-03-02T18:02:13.254000Z",
"file_hash": "466d82679b747e97c12d5b3dd3e930da0afd43064e1f9b989bd71e6cb8aa7d53",
"private": false,
"record": {
"abstract": "In theory, quantum computers can efficiently simulate quantum physics, factor\nlarge numbers and estimate integrals, thus solving otherwise intractable\ncomputational problems. In practice, quantum computers must operate with noisy\ndevices called ``gates\u0027\u0027 that tend to destroy the fragile quantum states needed\nfor computation. The goal of fault-tolerant quantum computing is to compute\naccurately even when gates have a high probability of error each time they are\nused. Here we give evidence that accurate quantum computing is possible with\nerror probabilities above 3% per gate, which is significantly higher than what\nwas previously thought possible. However, the resources required for computing\nat such high error probabilities are excessive. Fortunately, they decrease\nrapidly with decreasing error probabilities. If we had quantum resources\ncomparable to the considerable resources available in today\u0027s digital\ncomputers, we could implement non-trivial quantum computations at error\nprobabilities as high as 1% per gate.",
"arxiv_id": "quant-ph/0410199",
"authors": [
"E. Knill"
],
"categories": [
"quant-ph"
],
"doi": "10.1038/nature03350",
"title": "Quantum Computing with Very Noisy Devices",
"url": "https://arxiv.org/abs/quant-ph/0410199"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8392b77b-cca7-408b-a7e2-1bf4953281c4",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}