dorsal/arxiv
View SchemaBrokered Graph State Quantum Computing
| Authors | Simon C. Benjamin, Dan E. Browne, Joe Fitzsimons, John J. L. Morton |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0509209 |
| URL | https://arxiv.org/abs/quant-ph/0509209 |
| DOI | 10.1088/1367-2630/8/8/141 |
| Journal | New Journal of Physics 8, 141 (2006) |
Abstract
We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.
{
"annotation_id": "01e35955-fc4d-4b14-afd6-a576d0578a23",
"date_created": "2026-03-02T18:02:20.481000Z",
"date_modified": "2026-03-02T18:02:20.481000Z",
"file_hash": "4fc02175b31e994b5bc62541df30e2e3dda1a845e1072598afb9ccd047afb818",
"private": false,
"record": {
"abstract": "We describe a procedure for graph state quantum computing that is tailored to\nfully exploit the physics of optically active multi-level systems. Leveraging\nideas from the literature on distributed computation together with the recent\nwork on probabilistic cluster state synthesis, our model assigns to each\nphysical system two logical qubits: the broker and the client. Groups of\nbrokers negotiate new graph state fragments via a probabilistic optical\nprotocol. Completed fragments are mapped from broker to clients via a simple\nstate transition and measurement. The clients, whose role is to store the\nnascent graph state long term, remain entirely insulated from failures during\nthe brokerage. We describe an implementation in terms of NV-centres in diamond,\nwhere brokers and clients are very naturally embodied as electron and nuclear\nspins.",
"arxiv_id": "quant-ph/0509209",
"authors": [
"Simon C. Benjamin",
"Dan E. Browne",
"Joe Fitzsimons",
"John J. L. Morton"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/1367-2630/8/8/141",
"journal_ref": "New Journal of Physics 8, 141 (2006)",
"title": "Brokered Graph State Quantum Computing",
"url": "https://arxiv.org/abs/quant-ph/0509209"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "76dcef67-ac98-40e8-b7c7-d3b82d568f6f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}