dorsal/arxiv
View SchemaExponential Gain in Quantum Computing of Quantum Chaos and Localization
| Authors | B. Georgeot, D. L. Shepelyansky |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0010005 |
| URL | https://arxiv.org/abs/quant-ph/0010005 |
| DOI | 10.1103/PhysRevLett.86.2890 |
| Journal | Phys. Rev. Lett. v. 86 (2001) p. 2890 |
Abstract
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be modelled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.
{
"annotation_id": "5988f9d7-024e-4471-85dc-2afb7884ac21",
"date_created": "2026-03-02T18:01:38.675000Z",
"date_modified": "2026-03-02T18:01:38.675000Z",
"file_hash": "9ccf4664fa545ae3192276eb98a792ca9ab0118422e3cbbd909769c7fdb2ce7d",
"private": false,
"record": {
"abstract": "We present a quantum algorithm which simulates the quantum kicked rotator\nmodel exponentially faster than classical algorithms. This shows that important\nphysical problems of quantum chaos, localization and Anderson transition can be\nmodelled efficiently on a quantum computer. We also show that a similar\nalgorithm simulates efficiently classical chaos in certain area-preserving\nmaps.",
"arxiv_id": "quant-ph/0010005",
"authors": [
"B. Georgeot",
"D. L. Shepelyansky"
],
"categories": [
"quant-ph",
"cond-mat",
"nlin.CD"
],
"doi": "10.1103/PhysRevLett.86.2890",
"journal_ref": "Phys. Rev. Lett. v. 86 (2001) p. 2890",
"title": "Exponential Gain in Quantum Computing of Quantum Chaos and Localization",
"url": "https://arxiv.org/abs/quant-ph/0010005"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "cd16f19a-78dd-406c-9b06-c80892441b13",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}