© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Civil War Book Review

Nonlocal quantum information in bipartite quantum error correction

Mark M. Wilde, David A. Fattal

Published Oct 1, 2010• 11 citations

Abstract

We show how to convert an arbitrary stabilizer code into a bipartite quantum code. A bipartite quantum code is one that involves two senders and one receiver. The two senders exploit both nonlocal and local quantum resources to encode quantum information with local encoding circuits. They transmit their encoded quantum data to a single receiver who then decodes the transmitted quantum information. The nonlocal resources in a bipartite code are ebits and nonlocal information qubits, and the local resources are ancillas and local information qubits. The technique of bipartite quantum error correction is useful in both the quantum communication scenario described above and in fault-tolerant quantum computation. It has application in fault-tolerant quantum computation because we can prepare nonlocal resources offline and exploit local encoding circuits. In particular, we derive an encoding circuit for a bipartite version of the Steane code that is local and additionally requires only nearest-neighbor interactions. We have simulated this encoding in the CNOT extended rectangle with a publicly available fault-tolerant simulation software. The result is that there is an improvement in the "pseudothreshold" with respect to the baseline Steane code, under the assumption that quantum memory errors occur less frequently than quantum gate errors. © 2010 Springer Science+Business Media, LLC.

Related papers

Fault-tolerant quantum error correction code conversion

Charles D. Hill, Austin G. Fowler, David S. Wang +1 more

In this paper we demonstrate how data encoded in a five-qubit quantum error correction code can be converted, fault-tolerantly, into a seven-qubit Steane code. This is achieved by progressing through a series of codes, each of which fault-tolerantly corrects at least one error. Throughout the conversion the encoded qubit remains protected. We found, through computational search, that the method used to convert between codes given in this paper is optimal.

Quantum Information and Computation•May 1, 2013•11 citations

Fault-tolerant quantum error correction code conversion

Charles D. Hill, Austin G. Fowler, Wang, David S. +1 more

In this paper we demonstrate how data encoded in a five-qubit quantum error correction code can be converted, fault-tolerantly, into a seven-qubit Steane code. This is achieved by progressing through a series of codes, each of which fault-tolerantly corrects at least one error. Throughout the conversion the encoded qubit remains protected. We found, through computational search, that the method used to convert between codes given in this paper is optimal.

arXiv:1112.2417•Dec 12, 2011•0 citations

Fault-tolerant quantum error correction code conversion

Charles D. Hill, Austin G. Fowler, David S. Wang +1 more

In this paper we demonstrate how data encoded in a five-qubit quantum error correction code can be converted, fault-tolerantly, into a seven-qubit Steane code. This is achieved by progressing through a series of codes, each of which fault-tolerantly corrects at least one error. Throughout the conversion the encoded qubit remains protected. We found, through computational search, that the method used to convert between codes given in this paper is optimal.

Quantum Information and Computation•May 1, 2013•12 citations

Realization of Real-Time Fault-Tolerant Quantum Error Correction

Ciarán Ryan-Anderson, Justin Bohnet, K. Lee +14 more

Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, midcircuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a 10-qubit quantum charge-coupled device trapped-ion quantum computer to encode a single logical qubit using the [[7,1,3]] color code, first proposed by Steane [Phys. Rev. Lett. 77, 793 (1996)PRLTAO0031-900710.1103/PhysRevLett.77.793]. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical state preparation and measurement (SPAM) error of 1.7(2)×10^{-3}, compared to the average physical SPAM error 2.4(4)×10^{-3} of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a T[over ¯]|+⟩_{L} magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudothreshold.

Physical Review X•Dec 23, 2021•306 citations

Gate-Error-Resilient Quantum Steane Codes

Rosie Cane, Daryus Chandra, Soon Xin Ng +1 more

An encoderless quantum code is capable of connecting quantum information by replacing the encoder circuit with a fault-tolerant single-qubit gate arrangement. As a further benefit, in contrast to state preparation techniques, our encoderless scheme requires no prior knowledge of the input information, therefore totally unknown states can be encoded fault-tolerantly. Our encoderless quantum code delivers a frame error rate that is three orders of magnitude lower than that of the corresponding scheme relying on a non-fault-tolerant encoder, when the gate error probability is as high as 10-3.

IEEE Access•Jan 1, 2020•2 citations

Fault-tolerant quantum input/output

Matthias Christandl, Omar Fawzi, Ashutosh Goswami

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output to the quantum algorithm are classical. In contrast to stand-alone single-core quantum computers, in many distributed scenarios, quantum information might have to be passed on from one quantum information processing system to another one, possibly via noisy quantum communication channels with noise levels above fault-tolerant thresholds. In such situations, quantum information processing devices will have quantum inputs, quantum outputs or even both, which pass qubits among each other. Working in the fault-tolerant framework of [Kitaev, 1997], we show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit that produces the ideal circuit with some controlled noise applied at the input and output. The framework allows the direct composition of the statements, enabling versatile future applications. We illustrate this with a concrete application, namely, communication over a noisy channel with faulty encoding and decoding operations [Christandl and M{ü}ller-Hermes, 2024]. For communication codes with linear minimum distance, we construct fault-tolerant encoders and decoders for general noise (including coherent errors). For the weaker, but standard, model of local stochastic noise, we obtain fault-tolerant encoders and decoders for any communication code that can correct a constant fraction random errors.

arXiv:2408.05260•Aug 9, 2024•0 citations

We show how to convert an arbitrary stabilizer code into a bipartite quantum code. A bipartite quantum code is one that involves two senders and one receiver. The two senders exploit both nonlocal and local quantum resources to encode quantum information with local encoding circuits. They transmit their encoded quantum data to a single receiver who then decodes the transmitted quantum information. The nonlocal resources in a bipartite code are ebits and nonlocal information qubits, and the local resources are ancillas and local information qubits. The technique of bipartite quantum error correction is useful in both the quantum communication scenario described above and in fault-tolerant quantum computation. It has application in fault-tolerant quantum computation because we can prepare nonlocal resources offline and exploit local encoding circuits. In particular, we derive an encoding circuit for a bipartite version of the Steane code that is local and additionally requires only nearest-neighbor interactions. We have simulated this encoding in the CNOT extended rectangle with a publicly available fault-tolerant simulation software. The result is that there is an improvement in the "pseudothreshold" with respect to the baseline Steane code, under the assumption that quantum memory errors occur less frequently than quantum gate errors. © 2010 Springer Science+Business Media, LLC.

Correcting errors in real time is essential for reliable large-scale quantum computations. Realizing this high-level function requires a system capable of several low-level primitives, including single-qubit and two-qubit operations, midcircuit measurements of subsets of qubits, real-time processing of measurement outcomes, and the ability to condition subsequent gate operations on those measurements. In this work, we use a 10-qubit quantum charge-coupled device trapped-ion quantum computer to encode a single logical qubit using the [[7,1,3]] color code, first proposed by Steane [Phys. Rev. Lett. 77, 793 (1996)PRLTAO0031-900710.1103/PhysRevLett.77.793]. The logical qubit is initialized into the eigenstates of three mutually unbiased bases using an encoding circuit, and we measure an average logical state preparation and measurement (SPAM) error of 1.7(2)×10^{-3}, compared to the average physical SPAM error 2.4(4)×10^{-3} of our qubits. We then perform multiple syndrome measurements on the encoded qubit, using a real-time decoder to determine any necessary corrections that are done either as software updates to the Pauli frame or as physically applied gates. Moreover, these procedures are done repeatedly while maintaining coherence, demonstrating a dynamically protected logical qubit memory. Additionally, we demonstrate non-Clifford qubit operations by encoding a T[over ¯]|+⟩_{L} magic state with an error rate below the threshold required for magic state distillation. Finally, we present system-level simulations that allow us to identify key hardware upgrades that may enable the system to reach the pseudothreshold.

An encoderless quantum code is capable of connecting quantum information by replacing the encoder circuit with a fault-tolerant single-qubit gate arrangement. As a further benefit, in contrast to state preparation techniques, our encoderless scheme requires no prior knowledge of the input information, therefore totally unknown states can be encoded fault-tolerantly. Our encoderless quantum code delivers a frame error rate that is three orders of magnitude lower than that of the corresponding scheme relying on a non-fault-tolerant encoder, when the gate error probability is as high as 10-3.

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output to the quantum algorithm are classical. In contrast to stand-alone single-core quantum computers, in many distributed scenarios, quantum information might have to be passed on from one quantum information processing system to another one, possibly via noisy quantum communication channels with noise levels above fault-tolerant thresholds. In such situations, quantum information processing devices will have quantum inputs, quantum outputs or even both, which pass qubits among each other. Working in the fault-tolerant framework of [Kitaev, 1997], we show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit that produces the ideal circuit with some controlled noise applied at the input and output. The framework allows the direct composition of the statements, enabling versatile future applications. We illustrate this with a concrete application, namely, communication over a noisy channel with faulty encoding and decoding operations [Christandl and M{ü}ller-Hermes, 2024]. For communication codes with linear minimum distance, we construct fault-tolerant encoders and decoders for general noise (including coherent errors). For the weaker, but standard, model of local stochastic noise, we obtain fault-tolerant encoders and decoders for any communication code that can correct a constant fraction random errors.