Error tolerance and tradeoffs in loss- and failure-tolerant quantum computing schemes

Abstract

Qubit loss and gate failure are significant problems for the development of scalable quantum computing. Recently various schemes have been proposed for tolerating qubit loss and gate failure. These include schemes based on cluster and parity states. We show that by designing such schemes specifically to tolerate these error types we cause an exponential blow-out in depolarizing noise. We discuss several examples and propose techniques for minimizing this problem. In general this introduces a tradeoff with other undesirable effects. In some cases this is physical resource requirements, while in others it is noise rates.

5 pages, 3 figues

References in corpus (8)

• Good Quantum Error-Correcting Codes Exist
• Measurement-based quantum computation with cluster states
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Optical quantum computation using cluster states
• Cluster-state quantum computation
• Efficient quantum computation with probabilistic quantum gates
• Loss Tolerant Optical Qubits
• Noise thresholds for optical quantum computers

Cited by in corpus (8)

• Multi-photon entanglement and interferometry
• Fundamentals of universality in one-way quantum computation
• Optical Quantum Computation
• The efficiencies of generating cluster states with weak non-linearities
• Error- and Loss-Tolerances of Surface Codes with General Lattice Structures
• Loss Tolerant Linear Optical Quantum Memory By Measurement Based Quantum Computing
• An introduction to one-way quantum computing in distributed architectures
• Loss-tolerant operations in parity-code linear optics quantum computing