Percolation, renormalization, and quantum computing with nondeterministic gates

DOI10.1103/PHYSREVLETT.99.130501MaRDI QIDQ3107748zbMATH OpenWikidataFDO

Authors K. Kieling, Terry Rudolph, Jens Eisert

Publication date 26 December 2011

Published in Physical Review Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0611140

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum computation (81P68) Quantum optics (81V80) Percolation (82B43)

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.

Recommendations

• Scaling and renormalization in fault-tolerant quantum computers
• Nondeterministic logic gates in optical quantum computing
• Cluster-state quantum computation
• Near-deterministic efficient all-optical quantum computation
• Some quantum states prepared with polynomial quantum circuit

Cites work

• Multiparty entanglement in graph states
• On the number of incipient spanning clusters

Cited in

(12)

• Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
• Nearly deterministic Bell measurement using quantum communication bus
• Phase damping destroys quantum Fisher information of \(W\) states
• Single-photon sources–an introduction
• An introduction to one-way quantum computing in distributed architectures
• Testing equivalence of pure quantum states and graph states under SLOCC
• Percolation in quantum computation and communication
• One-way quantum computation with four-dimensional photonic qudits
• Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation
• Quantum computational capability of a 2D valence bond solid phase
• Cluster state computation with quantum-dot charge qubits
• Relative multiplexing for minimising switching in linear-optical quantum computing

This page was built for publication: Percolation, renormalization, and quantum computing with nondeterministic gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107748)