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

arXiv:2103.13404 · PRX Quantum

Fault-Tolerant Logical Gates in Holographic Stabilizer Codes Are Severely Restricted

Sam Cree, Kfir Dolev, Vladimir Calvera, Dominic J. Williamson

Published Aug 31, 2021• 13 citations
arXivHTMLPDF

Abstract

The future of holographic stabilizer codes for achieving universal fault-tolerant quantum computation does not appear promising: severe limitations on its usefulness are conceptually presented and theoretically verified.
DOI
10.1103/prxquantum.2.030337

Related papers

Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates

Tomas Jochym-O’Connor, Aleksander Kubica, Theodore J. Yoder

A new analysis quantifies computational limitations on stabilizer codes (codes that correct errors in quantum information) for practical operations and provides insight into how to design stabilizer codes for useful and interesting applications.

arXiv:1710.07256•Physical Review X•May 21, 2018•60 citations

Universal fault-tolerant quantum computing with stabilizer codes

Paul Webster, Michael Vasmer, Thomas R. Scruby +1 more

The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. These theorems are very restrictive, and conventional wisdom holds that a universal fault-tolerant logic gate set cannot be implemented natively, requiring us to use costly distillation procedures for quantum computation. Here, we present a general framework for universal fault-tolerant logic with stabilizer codes, together with a no-go theorem that reveals the very broad conditions constraining such gate sets. Our theorem applies to a wide range of stabilizer code families, including concatenated codes and conventional topological stabilizer codes such as the surface code. The broad applicability of our no-go theorem provides a new perspective on how the constraints on universal fault-tolerant gate sets can be overcome. In particular, we show how nonunitary implementations of logic gates provide a general approach to circumvent the no-go theorem, and we present a rich landscape of constructions for logic gate sets that are both universal and fault-tolerant. That is, rather than restricting what is possible, our no-go theorem provides a signpost to guide us to new, efficient architectures for fault-tolerant quantum computing.

arXiv:2012.05260•Physical Review Research•Feb 4, 2022•31 citations

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

Theory of fault-tolerant quantum computation

Daniel Gottesman

In order to use quantum error-correcting codes to improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a theory of fault-tolerant operations on stabilizer codes based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-quantum-bit code.

arXiv:quant-ph/9702029•Physical Review A•Jan 1, 1998•1,048 citations

Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes

Paul Webster

Performing quantum computing that is robust against noise will require that all operations are fault-tolerant, meaning that they succeed with high probability even if a limited number of errors occur. We address the problem of fault-tolerantly implementing logical operators on quantum error-correcting codes – operators that apply logic gates to information protected by such codes. Specifically, we investigate what classes of logical operators are possible by particular approaches in important types of codes, especially topological stabiliser codes. We also analyse what fundamental limitations constrain the goal of realising fault-tolerant quantum computing by such implementations and how these limitations can be overcome. \n \nWe begin by presenting necessary background theory on quantum computing, quantum error-correcting codes and fault tolerance. We then specifically consider the approach to fault tolerance of locality-preserving logical operators in topological stabiliser codes. We present a method for determining the set of such operators admitted by a wide range of such codes and apply this method to important examples such as surface codes and colour codes. Next, we consider the alternative approach of implementing logical operators in topological stabiliser codes with defects, especially by the technique of braiding. We show that such approaches are fundamentally limited, but that effective schemes can nonetheless be constructed, both within these limitations and by circumventing them. We then consider fault tolerance in a more general context. We prove a highly general no-go theorem in this context, applicable to a wide range of stabiliser codes. We also show that this proof illuminates how it can be circumvented and provides perspective on a range of fault-tolerant schemes. Finally, we conclude by reviewing how these results collectively address our research questions and suggesting future work.

•Jan 1, 2021•0 citations

Fault-Tolerant Quantum Computation with Higher-Dimensional Systems

Daniel Gottesman

Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to d-dimensional systems, and I will discuss the theory of fault-tolerant computation using such codes. I prove that universal fault-tolerant computation is possible with any higher-dimensional stabilizer code for prime d.

arXiv:quant-ph/9802007•Feb 2, 1998•100 citations
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. These theorems are very restrictive, and conventional wisdom holds that a universal fault-tolerant logic gate set cannot be implemented natively, requiring us to use costly distillation procedures for quantum computation. Here, we present a general framework for universal fault-tolerant logic with stabilizer codes, together with a no-go theorem that reveals the very broad conditions constraining such gate sets. Our theorem applies to a wide range of stabilizer code families, including concatenated codes and conventional topological stabilizer codes such as the surface code. The broad applicability of our no-go theorem provides a new perspective on how the constraints on universal fault-tolerant gate sets can be overcome. In particular, we show how nonunitary implementations of logic gates provide a general approach to circumvent the no-go theorem, and we present a rich landscape of constructions for logic gate sets that are both universal and fault-tolerant. That is, rather than restricting what is possible, our no-go theorem provides a signpost to guide us to new, efficient architectures for fault-tolerant quantum computing.
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.
In order to use quantum error-correcting codes to improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a theory of fault-tolerant operations on stabilizer codes based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-quantum-bit code.
Performing quantum computing that is robust against noise will require that all operations are fault-tolerant, meaning that they succeed with high probability even if a limited number of errors occur. We address the problem of fault-tolerantly implementing logical operators on quantum error-correcting codes – operators that apply logic gates to information protected by such codes. Specifically, we investigate what classes of logical operators are possible by particular approaches in important types of codes, especially topological stabiliser codes. We also analyse what fundamental limitations constrain the goal of realising fault-tolerant quantum computing by such implementations and how these limitations can be overcome. \n \nWe begin by presenting necessary background theory on quantum computing, quantum error-correcting codes and fault tolerance. We then specifically consider the approach to fault tolerance of locality-preserving logical operators in topological stabiliser codes. We present a method for determining the set of such operators admitted by a wide range of such codes and apply this method to important examples such as surface codes and colour codes. Next, we consider the alternative approach of implementing logical operators in topological stabiliser codes with defects, especially by the technique of braiding. We show that such approaches are fundamentally limited, but that effective schemes can nonetheless be constructed, both within these limitations and by circumventing them. We then consider fault tolerance in a more general context. We prove a highly general no-go theorem in this context, applicable to a wide range of stabiliser codes. We also show that this proof illuminates how it can be circumvented and provides perspective on a range of fault-tolerant schemes. Finally, we conclude by reviewing how these results collectively address our research questions and suggesting future work.