scholarly journals Correction: Corrigendum: Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation

2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Hayato Goto ◽  
Hironori Uchikawa
Author(s):  
Dongsheng Wang ◽  
Yunjiang Wang ◽  
Ningping Cao ◽  
Bei Zeng ◽  
Raymond Lafflamme

Abstract In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes (``quasi codes''). By definition, a quasi code is a parametric approximate code that can become exact by tuning its parameters. The model of QEQ computation lies in between the two well-known ones: the usual noisy quantum computation without error correction and the usual fault-tolerant quantum computation, but closer to the later. Many notions of exact quantum codes need to be adjusted for the quasi setting. Here we develop quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc. We find a wide class of quasi codes which are called valence-bond-solid codes, and we use them as concrete examples to demonstrate QEQ computation.


Author(s):  
Robert Raussendorf

In this introductory article on the subject of quantum error correction and fault-tolerant quantum computation, we review three important ingredients that enter known constructions for fault-tolerant quantum computation, namely quantum codes, error discretization and transversal quantum gates. Taken together, they provide a ground on which the theory of quantum error correction can be developed and fault-tolerant quantum information protocols can be built.


2006 ◽  
Vol 06 (03) ◽  
pp. C23-C28 ◽  
Author(s):  
R. ALICKI

It is argued that the existing schemes of fault-tolerant quantum computation, designed for discrete time models and based on quantum error correction, fail for continuous time Hamiltonian models, even with Markovian noise.


Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 43 ◽  
Author(s):  
Christopher Chamberland ◽  
Pavithran Iyer ◽  
David Poulin

We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.


Sign in / Sign up

Export Citation Format

Share Document