Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Concatenated pieceable fault-tolerant scheme for universal quantum computation

Chen Lin, Guowu Yang

Published Nov 17, 2020• 5 citations
Publisher

Abstract

As existing approaches to get around the restriction of the no-go theorem generally exhibit high ancillary qubit overhead costs, we propose a scheme for universal fault-tolerant quantum computation by using the pieceable fault-tolerant protocol and code switching techniques. In additional, by utilizing the construction of the pieceable fault-tolerant circuit, we adopt a decoding strategy based on a deep-neural-network algorithm to improve the error threshold of the non-Clifford logical gate circuit. We describe our universal construction in detail with a two-level nonuniform concatenated 25-qubit code and perform numerical simulations to analyze the depolarizing noise threshold of a given universal gate set with this code. The resources required to implement this universal gate set are also estimated to further demonstrate the efficiency of our scheme. We compare these results with the existing universal concatenation methods and conclude that our method outperforms them in terms of the lower bound of the error threshold and qubit resource overhead.

DOI
10.1103/physreva.102.052415

Related papers

Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

Nicholas J. C. Papadopoulos, Ramin Ayanzadeh

Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of transversal universal quantum computation. This universality is highly desired and often achieved using techniques such as code concatenation, code switching, magic state distillation, or pieceable fault tolerance. Existing constructions can incur substantial overhead or rely on properties specific to particular codes. This work proposes implementing logical Clifford and T gates through novel, ancilla-mediated, pieceable interactions to construct a universal fault-tolerant quantum gate set. Our construction is deterministic, does not modify the underlying data codes or registers, and is generic over all data stabilizer codes. Thus, any single code becomes capable of universal quantum computation by leveraging helper codes in ancilla registers and mid-circuit measurements. Furthermore, since these logical gates are stabilizer code-generic, these implementations enable communication between heterogeneous stabilizer codes.

quant-pharXiv:2601.10964•Jan 19, 2026•2 citations

A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation

Eesa Nikahd, Morteza Saheb Zamani, Mehdi Sedighi

As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state distillation, code switching, code concatenation and pieceable fault-tolerance are well-known examples of such approaches. However, the overhead of these approaches is one of the main bottlenecks for large-scale quantum computation. In this paper, a hybrid approach is proposed which combines the code concatenation technique with the other mentioned approaches. The proposed approach outperforms code concatenation in terms of both number of qubits and error threshold and also significantly reduces the resource overhead of code switching, magic state distillation and pieceable fault-tolerance at the cost of reducing the effective distance of the concatenated code for implementing non-transversal gates.

arXiv:1610.03309•Oct 11, 2016•4 citations

Overhead analysis of universal concatenated quantum codes

Christopher Chamberland, Tomas Jochym-O’Connor, Raymond Laflamme

We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49- and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be $8.33\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}6}.$ We obtain a depolarizing noise threshold for the 49-qubit code of $9.69\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}$ which is competitive with the 105-qubit threshold result of $1.28\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$. We then provide lower bounds on the resource requirements of the 49- and 105-qubit codes and compare them with the surface code implementation of a logical $T$ gate using magic state distillation. For the sampled input error rates and noise model, we find that the surface code achieves a smaller overhead compared to our concatenated schemes.

arXiv:1609.07497•Physical Review A•Feb 8, 2017•52 citations

Universal Quantum Computation via Scalable Measurement-Free Error Correction

Stefano Veroni, Alexandru Paler, Giacomo Giudice

We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical gate. Combined with a fold-transversal logical Hadamard gate, this enables a universal set of fault-tolerant operations using only transversal gates and qubit permutations. For the purpose of benchmarking under circuit-level noise, we develop an efficient method to simulate non-Clifford circuits with a small number of Hadamard gates. Separately, we demonstrate that certain CSS codes can be concatenated without measurements or having to rely on a universal logical gate set. This is made possible by means of a resource-efficient gadget—termed the “disposable Toffoli gadget”—that realizes the error-correcting feedback. Then, under concatenation of the Bacon-Shor code, we observe a fault-tolerance threshold at a circuit-level depolarizing noise rate of approximately 0.12 % . Together, the deformation and concatenation protocols outline a blueprint for a fully fault-tolerant architecture without any feed-forward operation, particularly suited to state-of-the-art neutral-atom platforms.

arXiv:2412.15187•PRX Quantum•Nov 14, 2025•11 citations

Pieceable fault-tolerant conversion between Steane and Reed-Muller quantum codes with neural network decoders

Chen Lin, Guowu Yang, Xiaoyu Song

Designing efficient fault-tolerant circuits for converting between two quantum codes is an effective way to realize universal fault-tolerant quantum computing. In this work, we adopt the round-robin circuit construction to design a conversion circuit between CSS 7-qubit error-correcting code and Reed-Muller 15-qubit code. We take the pieceable fault-tolerant protocol to guarantee the fault tolerance of our conversion circuit. A neural network decoding scheme is proposed to suppress the propagation of quantum errors. Our decoding scheme can effectively reduce the damaging effects of imperfect syndrome extraction operations and predict possible logical errors that occurred after the error correction process. We provide a detailed description of our syndrome data model and analyze the depolarizing noise threshold of our conversion circuit through numerical simulations of the stabilizer circuit.

•May 15, 2021•0 citations

Error rates and resource overheads of encoded three-qubit gates

Ryuji Takagi, Theodore J. Yoder, Isaac L. Chuang

A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource-intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Clifford gate, but certain three-qubit gates, such as Toffoli or controlled-controlled-$Z$ (ccz), are equivalent options that are also more suited for implementing some quantum algorithms, for instance, those with coherent classical subroutines. Here, we calculate error rates and resource overheads for implementing logical ccz with pieceable fault tolerance, a nontransversal method for implementing logical gates. We provide a comparison with a nonlocal magic-state scheme on a concatenated code and a local magic-state scheme on the surface code. We find the pieceable fault-tolerance scheme particularly advantaged over magic states on concatenated codes and in certain regimes over magic states on the surface code. Our results suggest that pieceable fault tolerance is a promising candidate for fault tolerance in a near-future quantum computer.

arXiv:1707.00012•Physical Review A•Oct 4, 2017•17 citations
As existing approaches to get around the restriction of the no-go theorem generally exhibit high ancillary qubit overhead costs, we propose a scheme for universal fault-tolerant quantum computation by using the pieceable fault-tolerant protocol and code switching techniques. In additional, by utilizing the construction of the pieceable fault-tolerant circuit, we adopt a decoding strategy based on a deep-neural-network algorithm to improve the error threshold of the non-Clifford logical gate circuit. We describe our universal construction in detail with a two-level nonuniform concatenated 25-qubit code and perform numerical simulations to analyze the depolarizing noise threshold of a given universal gate set with this code. The resources required to implement this universal gate set are also estimated to further demonstrate the efficiency of our scheme. We compare these results with the existing universal concatenation methods and conclude that our method outperforms them in terms of the lower bound of the error threshold and qubit resource overhead.
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of transversal universal quantum computation. This universality is highly desired and often achieved using techniques such as code concatenation, code switching, magic state distillation, or pieceable fault tolerance. Existing constructions can incur substantial overhead or rely on properties specific to particular codes. This work proposes implementing logical Clifford and T gates through novel, ancilla-mediated, pieceable interactions to construct a universal fault-tolerant quantum gate set. Our construction is deterministic, does not modify the underlying data codes or registers, and is generic over all data stabilizer codes. Thus, any single code becomes capable of universal quantum computation by leveraging helper codes in ancilla registers and mid-circuit measurements. Furthermore, since these logical gates are stabilizer code-generic, these implementations enable communication between heterogeneous stabilizer codes.
As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state distillation, code switching, code concatenation and pieceable fault-tolerance are well-known examples of such approaches. However, the overhead of these approaches is one of the main bottlenecks for large-scale quantum computation. In this paper, a hybrid approach is proposed which combines the code concatenation technique with the other mentioned approaches. The proposed approach outperforms code concatenation in terms of both number of qubits and error threshold and also significantly reduces the resource overhead of code switching, magic state distillation and pieceable fault-tolerance at the cost of reducing the effective distance of the concatenated code for implementing non-transversal gates.
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49- and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be $8.33\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}6}.$ We obtain a depolarizing noise threshold for the 49-qubit code of $9.69\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}$ which is competitive with the 105-qubit threshold result of $1.28\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$. We then provide lower bounds on the resource requirements of the 49- and 105-qubit codes and compare them with the surface code implementation of a logical TTT gate using magic state distillation. For the sampled input error rates and noise model, we find that the surface code achieves a smaller overhead compared to our concatenated schemes.
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical gate. Combined with a fold-transversal logical Hadamard gate, this enables a universal set of fault-tolerant operations using only transversal gates and qubit permutations. For the purpose of benchmarking under circuit-level noise, we develop an efficient method to simulate non-Clifford circuits with a small number of Hadamard gates. Separately, we demonstrate that certain CSS codes can be concatenated without measurements or having to rely on a universal logical gate set. This is made possible by means of a resource-efficient gadget—termed the “disposable Toffoli gadget”—that realizes the error-correcting feedback. Then, under concatenation of the Bacon-Shor code, we observe a fault-tolerance threshold at a circuit-level depolarizing noise rate of approximately 0.12 % . Together, the deformation and concatenation protocols outline a blueprint for a fully fault-tolerant architecture without any feed-forward operation, particularly suited to state-of-the-art neutral-atom platforms.
Designing efficient fault-tolerant circuits for converting between two quantum codes is an effective way to realize universal fault-tolerant quantum computing. In this work, we adopt the round-robin circuit construction to design a conversion circuit between CSS 7-qubit error-correcting code and Reed-Muller 15-qubit code. We take the pieceable fault-tolerant protocol to guarantee the fault tolerance of our conversion circuit. A neural network decoding scheme is proposed to suppress the propagation of quantum errors. Our decoding scheme can effectively reduce the damaging effects of imperfect syndrome extraction operations and predict possible logical errors that occurred after the error correction process. We provide a detailed description of our syndrome data model and analyze the depolarizing noise threshold of our conversion circuit through numerical simulations of the stabilizer circuit.
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource-intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Clifford gate, but certain three-qubit gates, such as Toffoli or controlled-controlled-ZZZ (ccz), are equivalent options that are also more suited for implementing some quantum algorithms, for instance, those with coherent classical subroutines. Here, we calculate error rates and resource overheads for implementing logical ccz with pieceable fault tolerance, a nontransversal method for implementing logical gates. We provide a comparison with a nonlocal magic-state scheme on a concatenated code and a local magic-state scheme on the surface code. We find the pieceable fault-tolerance scheme particularly advantaged over magic states on concatenated codes and in certain regimes over magic states on the surface code. Our results suggest that pieceable fault tolerance is a promising candidate for fault tolerance in a near-future quantum computer.