Error tolerance and tradeoffs in loss- and failure-tolerant quantum computing schemes
Peter P. Rohde, Timothy C. Ralph, William J. Munro
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.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.