dorsal/arxiv
View SchemaEfficient classical simulation of slightly entangled quantum computations
| Authors | Guifre Vidal |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0301063 |
| URL | https://arxiv.org/abs/quant-ph/0301063 |
| DOI | 10.1103/PhysRevLett.91.147902 |
| Journal | Phys. Rev. Lett. 91, 147902 (2003) |
Abstract
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.
{
"annotation_id": "6f3be890-1f4c-4673-af4f-30c01eea0ca7",
"date_created": "2026-03-02T18:01:56.496000Z",
"date_modified": "2026-03-02T18:01:56.496000Z",
"file_hash": "d210828f1bcdc2ec37b8f9a15f7fcc7f75d08b9c26950fceb42403922ef35616",
"private": false,
"record": {
"abstract": "We present a scheme to efficiently simulate, with a classical computer, the\ndynamics of multipartite quantum systems on which the amount of entanglement\n(or of correlations in the case of mixed-state dynamics) is conveniently\nrestricted. The evolution of a pure state of n qubits can be simulated by using\ncomputational resources that grow linearly in n and exponentially in the\nentanglement. We show that a pure-state quantum computation can only yield an\nexponential speed-up with respect to classical computations if the entanglement\nincreases with the size n of the computation, and gives a lower bound on the\nrequired growth.",
"arxiv_id": "quant-ph/0301063",
"authors": [
"Guifre Vidal"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.91.147902",
"journal_ref": "Phys. Rev. Lett. 91, 147902 (2003)",
"title": "Efficient classical simulation of slightly entangled quantum computations",
"url": "https://arxiv.org/abs/quant-ph/0301063"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3c6d7e29-86ad-45a7-b24e-e06ffa9e7abb",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}