dorsal/arxiv
View SchemaEfficient growth of complex graph states via imperfect path erasure
| Authors | Earl T. Campbell, Joseph Fitzsimons, Simon C. Benjamin, Pieter Kok |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0702209 |
| URL | https://arxiv.org/abs/quant-ph/0702209 |
| DOI | 10.1088/1367-2630/9/6/196 |
| Journal | New J. Phys. volume 9 page 196 (2007) |
Abstract
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok [Phys. Rev. A 71, 060310 (2005)]. Compared to straightforward postselection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states.
{
"annotation_id": "cab44139-2977-4783-b99c-f50b951ce53f",
"date_created": "2026-03-02T18:02:34.100000Z",
"date_modified": "2026-03-02T18:02:34.100000Z",
"file_hash": "ab8f425406a35b6e42f11a5335ee8e3e9f133e629d32f080c5ff35401e231b06",
"private": false,
"record": {
"abstract": "Given a suitably large and well connected (complex) graph state, any quantum\nalgorithm can be implemented purely through local measurements on the\nindividual qubits. Measurements can also be used to create the graph state:\nPath erasure techniques allow one to entangle multiple qubits by determining\nonly global properties of the qubits. Here, this powerful approach is extended\nby demonstrating that even imperfect path erasure can produce the required\ngraph states with high efficiency. By characterizing the degree of error in\neach path erasure attempt, one can subsume the resulting imperfect entanglement\ninto an extended graph state formalism. The subsequent growth of the improper\ngraph state can be guided, through a series of strategic decisions, in such a\nway as to bound the growth of the error and eventually yield a high-fidelity\ngraph state. As an implementation of these techniques, we develop an analytic\nmodel for atom (or atom-like) qubits in mismatched cavities, under the\ndouble-heralding entanglement procedure of Barrett and Kok [Phys. Rev. A 71,\n060310 (2005)]. Compared to straightforward postselection techniques our\nprotocol offers a dramatic improvement in growing complex high-fidelity graph\nstates.",
"arxiv_id": "quant-ph/0702209",
"authors": [
"Earl T. Campbell",
"Joseph Fitzsimons",
"Simon C. Benjamin",
"Pieter Kok"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/1367-2630/9/6/196",
"journal_ref": "New J. Phys. volume 9 page 196 (2007)",
"title": "Efficient growth of complex graph states via imperfect path erasure",
"url": "https://arxiv.org/abs/quant-ph/0702209"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "590c4fc8-a8b2-4701-89df-c9b13cbb355b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}