dorsal/arxiv
View SchemaPercolation, renormalization, and quantum computing with non-deterministic gates
| Authors | K. Kieling, T. Rudolph, J. Eisert |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0611140 |
| URL | https://arxiv.org/abs/quant-ph/0611140 |
| DOI | 10.1103/PhysRevLett.99.130501 |
| Journal | Phys. Rev. Lett. 99, 130501 (2007) |
Abstract
We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.
{
"annotation_id": "72dfc4e3-9005-47cf-8051-d73fd94365c7",
"date_created": "2026-03-02T18:02:30.935000Z",
"date_modified": "2026-03-02T18:02:30.935000Z",
"file_hash": "b06faf1e6ee24c7bad354f3eeb095f08261247060cbc53edb422742bcc1851b8",
"private": false,
"record": {
"abstract": "We apply a notion of static renormalization to the preparation of entangled\nstates for quantum computing, exploiting ideas from percolation theory. Such a\nstrategy yields a novel way to cope with the randomness of non-deterministic\nquantum gates. This is most relevant in the context of optical architectures,\nwhere probabilistic gates are common, and cold atoms in optical lattices, where\nhole defects occur. We demonstrate how to efficiently construct cluster states\nwithout the need for rerouting, thereby avoiding a massive amount of\nconditional dynamics; we furthermore show that except for a single layer of\ngates during the preparation, all subsequent operations can be shifted to the\nfinal adapted single qubit measurements. Remarkably, cluster state preparation\nis achieved using essentially the same scaling in resources as if deterministic\ngates were available.",
"arxiv_id": "quant-ph/0611140",
"authors": [
"K. Kieling",
"T. Rudolph",
"J. Eisert"
],
"categories": [
"quant-ph",
"cond-mat.stat-mech"
],
"doi": "10.1103/PhysRevLett.99.130501",
"journal_ref": "Phys. Rev. Lett. 99, 130501 (2007)",
"title": "Percolation, renormalization, and quantum computing with non-deterministic gates",
"url": "https://arxiv.org/abs/quant-ph/0611140"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5e9973ab-50cc-4072-a8aa-aa43227010b2",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}