dorsal/arxiv
View SchemaOn measurement-based quantum computation with the toric code states
| Authors | Sergey Bravyi, Robert Raussendorf |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0610162 |
| URL | https://arxiv.org/abs/quant-ph/0610162 |
| DOI | 10.1103/PhysRevA.76.022304 |
| Journal | Phys. Rev. A 76, 022304 (2007) |
Abstract
We study measurement-based quantum computation (MQC) using as quantum resource the planar code state on a two-dimensional square lattice (planar analogue of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice.
{
"annotation_id": "1f674d9c-d72e-4e79-a5ad-349f602084ab",
"date_created": "2026-03-02T18:02:31.186000Z",
"date_modified": "2026-03-02T18:02:31.186000Z",
"file_hash": "ca4cc1dff613ec02036fc80e7188696253e001f622ea0103c6fd0f19649f42d4",
"private": false,
"record": {
"abstract": "We study measurement-based quantum computation (MQC) using as quantum\nresource the planar code state on a two-dimensional square lattice (planar\nanalogue of the toric code). It is shown that MQC with the planar code state\ncan be efficiently simulated on a classical computer if at each step of MQC the\nsets of measured and unmeasured qubits correspond to connected subsets of the\nlattice.",
"arxiv_id": "quant-ph/0610162",
"authors": [
"Sergey Bravyi",
"Robert Raussendorf"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.76.022304",
"journal_ref": "Phys. Rev. A 76, 022304 (2007)",
"title": "On measurement-based quantum computation with the toric code states",
"url": "https://arxiv.org/abs/quant-ph/0610162"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "df5582ef-9c40-4e91-95aa-546fc3727192",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}