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

Konrad Kieling, Terry Rudolph, and Jens 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 nondeterministic 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.

Details

Publication typeArticle
Published inPhys. Rev. Lett.
URLhttp://link.aps.org/abstract/PRL/v99/e130501
Pages130501
Volume99
> Publications > Percolation, renormalization, and quantum computing with non-deterministic gates