|
| related topics |
| {state, algorithm, problem} |
| {state, phys, rev} |
| {qubit, qubits, gate} |
| {energy, state, states} |
| {photon, photons, single} |
| {bell, inequality, local} |
| {error, code, errors} |
| {cavity, atom, atoms} |
|
Percolation, renormalization, and quantum computing with
non-deterministic gates
K. Kieling, T. Rudolph, J. Eisert
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0611140
- categories:
- quant-ph cond-mat.stat-mech
- comments:
- 5 pages, 4 figures, discussion of strategies to deal with further
imperfections extended, references updated
- doi:
- 10.1103/PhysRevLett.99.130501
- arxiv_id:
- quant-ph/0611140
- journal_ref:
- Phys. Rev. Lett. 99, 130501 (2007)
- created:
- 2006-11-14
- updated:
- 2007-07-20
Full article ▸
|
|
| related documents |
| 0308060v1 |
| 0411194v2 |
| 0702007v2 |
| 0105071v2 |
| 0204013v1 |
| 0609125v1 |
| 0312083v1 |
| 0605244v3 |
| 0010021v1 |
| 0506270v2 |
| 9701019v2 |
| 0701096v2 |
| 0610258v1 |
| 0701079v1 |
| 0612033v1 |
| 0703193v2 |
| 0701198v1 |
| 0610251v1 |
| 0701054v1 |
| 0702143v1 |
| 0612123v2 |
| 0702270v1 |
| 0702140v1 |
| 0612052v2 |
| 0703019v1 |
|