Percolation, renormalization, and quantum computing with non-deterministic gates

• Main Authors: Kieling, K, Rudolph, T, Eisert, J
• Format: Journal Article
• Language: English
• Published: 14.11.2006
• Subjects: Physics - Quantum Physics; Physics - Statistical Mechanics
• DOI: 10.48550/arxiv.quant-ph/0611140

Phys. Rev. Lett. 99, 130501 (2007) 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.