dorsal/arxiv
View SchemaClassical simulation of limited-width cluster-state quantum computation
| Authors | Nadav Yoran, Anthony J. Short |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0601178 |
| URL | https://arxiv.org/abs/quant-ph/0601178 |
| DOI | 10.1103/PhysRevLett.96.170503 |
Abstract
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d -- the width of the cluster. We use this result to show that any log-depth quantum computation in the gate array model, with gates linking only nearby qubits, can be simulated efficiently on a classical computer.
{
"annotation_id": "2c10414c-e4b6-4a6e-aa6f-51fd95cdc279",
"date_created": "2026-03-02T18:02:24.143000Z",
"date_modified": "2026-03-02T18:02:24.143000Z",
"file_hash": "611c504cc31375929071229d9a11d0eb715e05a9fa8f36d28d3ce5771de0bfd3",
"private": false,
"record": {
"abstract": "We present a classical protocol, using the matrix product state\nrepresentation, to simulate cluster-state quantum computation at a cost\npolynomial in the number of qubits in the cluster and exponential in d -- the\nwidth of the cluster. We use this result to show that any log-depth quantum\ncomputation in the gate array model, with gates linking only nearby qubits, can\nbe simulated efficiently on a classical computer.",
"arxiv_id": "quant-ph/0601178",
"authors": [
"Nadav Yoran",
"Anthony J. Short"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.96.170503",
"title": "Classical simulation of limited-width cluster-state quantum computation",
"url": "https://arxiv.org/abs/quant-ph/0601178"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "553d457e-eaa5-4a01-94e4-446355ac7f0d",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}