dorsal/arxiv
View SchemaEfficient Graph State Construction Under the Barrett and Kok Scheme
| Authors | Simon C. Benjamin |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0504111 |
| URL | https://arxiv.org/abs/quant-ph/0504111 |
| DOI | 10.1103/PhysRevA.72.056302 |
| Journal | Phys. Rev. A 72, 056302 (2005). |
Abstract
Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity.
{
"annotation_id": "f35d4077-dc66-420a-8457-d47617db94ab",
"date_created": "2026-03-02T18:02:15.969000Z",
"date_modified": "2026-03-02T18:02:15.969000Z",
"file_hash": "6b30b2d7a6c4abe66f0009dd38e7081c40861aad2ea99c7b20ff8251e41c14c5",
"private": false,
"record": {
"abstract": "Recently Barrett and Kok (BK) proposed an elegant method for entangling\nseparated matter qubits. They outlined a strategy for using their entangling\noperation (EO) to build graph states, the resource for one-way quantum\ncomputing. However by viewing their EO as a graph fusion event, one perceives\nthat each successful event introduces an ideal redundant graph edge, which\ngrowth strategies should exploit. For example, if each EO succeeds with\nprobability p=0.4 then a highly connected graph can be formed with an overhead\nof only about ten EO attempts per graph edge. The BK scheme then becomes\ncompetitive with the more elaborate entanglement procedures designed to permit\np to approach unity.",
"arxiv_id": "quant-ph/0504111",
"authors": [
"Simon C. Benjamin"
],
"categories": [
"quant-ph",
"cond-mat.other"
],
"doi": "10.1103/PhysRevA.72.056302",
"journal_ref": "Phys. Rev. A 72, 056302 (2005).",
"title": "Efficient Graph State Construction Under the Barrett and Kok Scheme",
"url": "https://arxiv.org/abs/quant-ph/0504111"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fd3f3ee0-10a0-4613-a660-a5443555da5a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}