dorsal/arxiv
View SchemaAdaptive strategies for graph state growth in the presence of monitored errors
| Authors | Earl T. Campbell, Joseph Fitzsimons, Simon C. Benjamin, Pieter Kok |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0606199 |
| URL | https://arxiv.org/abs/quant-ph/0606199 |
| DOI | 10.1103/PhysRevA.75.042303 |
| Journal | Phys. Rev. A 75, 042303 (2007) |
Abstract
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure probability. Moreover, they may generate imperfect entanglement. Here we describe strategies to adapt growth operations in order to cancel incurred errors. Nascent states that initially deviate from the ideal graph states evolve toward the desired high fidelity resource without impractical overheads. Our analysis extends the diagrammatic language of graph states to include characteristics such as tilted vertices, weighted edges, and partial fusion, which arise from experimental imperfections. The strategies we present are relevant to parity projection schemes such as optical `path erasure' with distributed matter qubits.
{
"annotation_id": "c9bc0d41-c972-41d3-808c-15f046037bc1",
"date_created": "2026-03-02T18:02:27.616000Z",
"date_modified": "2026-03-02T18:02:27.616000Z",
"file_hash": "e212ae1842b15ffe0f1747738bb0057c3846d673787394b7402a2ab21a6ed689",
"private": false,
"record": {
"abstract": "Graph states (or cluster states) are the entanglement resource that enables\none-way quantum computing. They can be grown by projective measurements on the\ncomponent qubits. Such measurements typically carry a significant failure\nprobability. Moreover, they may generate imperfect entanglement. Here we\ndescribe strategies to adapt growth operations in order to cancel incurred\nerrors. Nascent states that initially deviate from the ideal graph states\nevolve toward the desired high fidelity resource without impractical overheads.\nOur analysis extends the diagrammatic language of graph states to include\ncharacteristics such as tilted vertices, weighted edges, and partial fusion,\nwhich arise from experimental imperfections. The strategies we present are\nrelevant to parity projection schemes such as optical `path erasure\u0027 with\ndistributed matter qubits.",
"arxiv_id": "quant-ph/0606199",
"authors": [
"Earl T. Campbell",
"Joseph Fitzsimons",
"Simon C. Benjamin",
"Pieter Kok"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.75.042303",
"journal_ref": "Phys. Rev. A 75, 042303 (2007)",
"title": "Adaptive strategies for graph state growth in the presence of monitored errors",
"url": "https://arxiv.org/abs/quant-ph/0606199"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "83fef125-0d81-4de5-b7f1-21dabf95be2a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}