dorsal/arxiv
View SchemaRemarks on the nature of quantum computation
| Authors | Robert Alicki |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0306103 |
| URL | https://arxiv.org/abs/quant-ph/0306103 |
Abstract
Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the exponential speed-up of quantum computations possess their classical counterparts for the hybrid digital-analog computer. It is argued that the measurement errors which cannot be fully corrected make the computation not efficient for both models.
{
"annotation_id": "c427b3b1-11d7-4323-98a9-62d187e1ec85",
"date_created": "2026-03-02T18:01:59.473000Z",
"date_modified": "2026-03-02T18:01:59.473000Z",
"file_hash": "e64947e103db746956f2bc55fb4a7414dd18996e77e458c2901a507e1d446de5",
"private": false,
"record": {
"abstract": "Two models of computer, a quantum and a classical \"chemical machine\" designed\nto compute the relevant part of Shor\u0027s factoring algorithm are discussed. The\ncomparison shows that the basic quantum features believed to be responsible for\nthe exponential speed-up of quantum computations possess their classical\ncounterparts for the hybrid digital-analog computer. It is argued that the\nmeasurement errors which cannot be fully corrected make the computation not\nefficient for both models.",
"arxiv_id": "quant-ph/0306103",
"authors": [
"Robert Alicki"
],
"categories": [
"quant-ph"
],
"title": "Remarks on the nature of quantum computation",
"url": "https://arxiv.org/abs/quant-ph/0306103"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9eae8958-4ffe-4838-af2e-b15b306c679a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}