dorsal/arxiv
View SchemaStrategies for the preparation of large cluster states using non-deterministic gates
| Authors | Peter P. Rohde, Sean D. Barrett |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0701068 |
| URL | https://arxiv.org/abs/quant-ph/0701068 |
| DOI | 10.1088/1367-2630/9/6/198 |
| Journal | New J. Phys 9, 198 (2007) |
Abstract
The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different `strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of `large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which `large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together identical qubits are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling.
{
"annotation_id": "33a6ea20-65a2-4a29-8ad9-89fb19022c2e",
"date_created": "2026-03-02T18:02:33.572000Z",
"date_modified": "2026-03-02T18:02:33.572000Z",
"file_hash": "c8958220e919de05f823645c708a9a335bcdc8cad6d8c941bf46735586f37528",
"private": false,
"record": {
"abstract": "The cluster state model for quantum computation has paved the way for schemes\nthat allow scalable quantum computing, even when using non-deterministic\nquantum gates. Here the initial step is to prepare a large entangled state\nusing non-deterministic gates. A key question in this context is the relative\nefficiencies of different `strategies\u0027, i.e. in what order should the\nnon-deterministic gates be applied, in order to maximize the size of the\nresulting cluster states? In this paper we consider this issue in the context\nof `large\u0027 cluster states. Specifically, we assume an unlimited resource of\nqubits and ask what the steady state rate at which `large\u0027 clusters are\nprepared from this resource is, given an entangling gate with particular\ncharacteristics. We measure this rate in terms of the number of entangling gate\noperations that are applied. Our approach works for a variety of different\nentangling gate types, with arbitrary failure probability. Our results indicate\nthat strategies whereby one preferentially bonds together identical qubits are\nconsiderably more efficient than those in which one does not. Additionally,\ncompared to earlier analytic results, our numerical study offers substantially\nimproved resource scaling.",
"arxiv_id": "quant-ph/0701068",
"authors": [
"Peter P. Rohde",
"Sean D. Barrett"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/1367-2630/9/6/198",
"journal_ref": "New J. Phys 9, 198 (2007)",
"title": "Strategies for the preparation of large cluster states using non-deterministic gates",
"url": "https://arxiv.org/abs/quant-ph/0701068"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fdcfe3d6-eba7-40bb-9bd2-bcf4de0bff2e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}