EPJ Quantum Technology

Fault-tolerant double-circular connectivity pattern for quantum stabilizer codes

Chao‐Hai Du, Zhi Ma, Yiting Liu, Hong Wang, Yangyang Fei

Published Oct 17, 2024• 2 citations

Abstract

Recently, the circular connectivity pattern has been presented for a class of stabilizer quantum error correction codes. The circular connectivity pattern for such a class of stabilizer codes can be implemented in a resource-efficient manner using a single ancilla and native two-qubit Controlled-Not-Swap gates (CNS) gates, which may be interesting for demonstrating error-correction codes with superconducting quantum processors. However, one concern is that this scheme is not fault-tolerant. And it might not apply to the Calderbank-Shor-Steane (CSS) codes. In this paper, we present a fault-tolerant version of the circular connectivity pattern, named the double-circular connectivity pattern. This pattern is an implementation for syndrome-measurement circuits with a flagged error correction scheme for stabilizer codes. We illustrate that this pattern is available for Steane code (a CSS code), Laflamme’s five-qubit code, and Shor’s nine-qubit code. For Laflamme’s five-qubit code and Shor’s nine-qubit code, the pattern has the property that it uses only native two-qubit CNS gates, which are more efficient in the superconducting quantum platform.

DOI: 10.1140/epjqt/s40507-024-00278-2

Related papers

Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity

A. V. Antipov, Evgeniy O. Kiktenko, Aleksey K. Fedorov

We describe a class of neighboring-block stabilizer quantum error correction codes and demonstrate that such a class of codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-qubit repetition code, Laflamme's five-qubit code, and Shor's nine-qubit code. For three-qubit repetition code and Laflamme's five-qubit code, the suggested scheme has the property that it uses only native two-qubit controlled-not-swap gates, which potentially reduces the amount of noncorrectable errors due to the shorter gate time. Elements of the scheme can be used to implement surface code with near-neighbor connectivity using a single ancilla, as demonstrated in an example. We developed efficient decoding procedures for repetition codes and the Laflamme's five-qubit code using a minimum-weight perfect-matching approach to account for the specific order of measurements in our scheme. The analysis of noise levels for which the scheme could show improvements in the fidelity of a stored logical qubit in the three-qubit repetition code and Laflamme's five-qubit code cases is provided. We complement our results by realizing the developed scheme for a three-qubit code using an IBM quantum processor and the Laflamme's five-qubit code using the state-vector simulator.

arXiv:2207.13356Physical Review AMar 3, 20237 citations

Flag fault-tolerant error correction, measurement, and quantum computation for cyclic Calderbank-Shor-Steane codes

Theerapat Tansuwannont, Christopher Chamberland, Debbie Leung

Flag qubits have recently been proposed in syndrome extraction circuits to detect high-weight errors arising from fewer faults. The use of flag qubits allows the construction of fault-tolerant protocols with the fewest number of ancillas known to date. In this work, we prove some critical properties of Calderbank-Shor-Steane (CSS) codes constructed from classical cyclic codes that enable the construction of a flag fault-tolerant error correction scheme. We then develop fault-tolerant protocols as well as a family of circuits for flag fault-tolerant error correction and operator measurement, requiring only four ancilla qubits and applicable to cyclic CSS codes of distance 3. The measurement protocol can be further used for logical Clifford gate implementation via quantum gate teleportation. We also provide examples of cyclic CSS codes with large encoding rates.

arXiv:1803.09758Physical Review AJan 24, 202041 citations

Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection

Erik Weilandt, Tom Peham, Robert Wille

Fault-tolerant state preparation is essential for reliable quantum error correction, particularly in Steane-type error correction, which relies on robust ancilla states for syndrome readout. One method of fault-tolerant state preparation is to initialize multiple ancilla states and check them against each other to detect problematic errors. In the worst case, the number of states required for successful initialization grows polynomially with the code distance, but it has been shown that this can be reduced to constant ancilla overhead-in the best case, only four states are required. However, existing techniques for finding low-overhead initialization schemes are limited to codes with large symmetry groups, such as the Golay code. In this work, we propose a general, automated synthesis methodology for Steane-type fault-tolerant state preparation circuits that applies to arbitrary Calderbank-Shor-Steane (CSS) codes and does not rely on code symmetries. We apply the proposed methods to various CSS codes up to a distance of seven and simulate the successful fault-tolerant initialization of logical basis states under circuit-level depolarizing noise. The circuits synthesized using the proposed methodology provide an important step towards experimental realizations of high-fidelity ancilla states for near-term demonstration of fault-tolerant quantum computation.

quant-pharXiv:2601.13313Jan 21, 20260 citations

Fault-tolerant preparation of stabilizer states for quantum Calderbank-Shor-Steane codes by classical error-correcting codes

Ching–Yi Lai, Yi-Cong Zheng, Todd A. Brun

Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome encoding by classical codes or quantum CSS codes. Along the same lines, we show that classical coding techniques can reduce the ancilla consumption in Steane syndrome extraction by using additional transversal controlled-not gates and classical computing power. In the scenario of a fixed ancilla consumption rate, we can increase the frequency of quantum error correction and effectively lower the error rate.

arXiv:1605.05647Physical Review AMar 31, 201715 citations

Fault-Tolerant Cut-Cat State Syndrome Extraction for Quantum Codes

Diego Forlivesi, Lorenzo Valentini, Marco Chiani

Reliable quantum computation requires fault-tolerant protocols to prevent errors from propagating during syndrome extraction in quantum error correction. We present a novel fault-tolerant syndrome extraction technique for CSS codes, which we refer to as the cut-cat state scheme. While each ancilla qubit interacts non-fault-tolerantly with a pair of data qubits, we introduce additional cat stabilizer measurements to identify and correct the resulting hook errors. Our approach maintains the key benefit of cat-based extraction, i.e., parallelized data qubit interactions, while reducing the number of simultaneous qubits required by more than half. Compared to flag-based state-of-the-art protocols, the cut-cat scheme offers a notable advantage in terms of two-qubit gate count as the code distance increases.

quant-pharXiv:2604.17339IEEE Transactions on CommunicationsApr 21, 20260 citations

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Dongxiao Quan, Chensong Liu, Xiaojie Lv +1 more

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.

EntropyAug 11, 20228 citations