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

Bulletin of the American Physical Society

Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes

Seyed Ali Hosseini Lavasani, Maissam Barkeshli

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

Characterising Semi-Clifford Gates Using Algebraic Sets

Imin Chen, Nadish de Silva

arXiv:2309.15184•Communications in Mathematical Physics•Aug 20, 2024•5 citations

Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes

Ali Lavasani, Maissam Barkeshli

One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the ${\mathbb{Z}}_{2}$ surface code. Logical qubits can be encoded in a variety of ways in the surface code, based on either boundary defects, holes, or bulk twist defects. However, proposed fault-tolerant implementations of the Clifford group in these schemes are limited and often require unnecessary overhead. For example, the Clifford phase gate in certain planar and hole encodings has been proposed to be implemented using costly state injection and distillation protocols. In this paper, we show that within any encoding scheme for the logical qubits, we can fault tolerantly implement the full Clifford group by using joint measurements involving a single appropriately encoded logical ancilla. This allows us to provide low overhead implementations of the full Clifford group in surface and color codes. It also provides the first proposed implementations of the full Clifford group in hyperbolic codes. We further use our methods to propose state-of-the art encoding schemes for small numbers of logical qubits; for example, for code distances $d=3,5,7$, we propose a scheme using $60,160,308$ (respectively) physical data qubits, which allow for the full logical Clifford group to be implemented on two logical qubits. To our knowledge, this is the optimal proposal to date, and thus may be useful for demonstration of fault-tolerant logical gates in small near-term quantum computers.

arXiv:1804.04144•Physical Review A•Nov 15, 2018•23 citations

Non-Clifford quantum gate teleportation with generalized lattice surgery

Yifei Wang, Yingfei Gu

We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford gates at the logical level, thereby completing the universal gate set. Our approach exploits generalized lattice surgery to integrate two quantum error-correcting (QEC) codes. Specifically, non-Clifford gates are executed transversally on one QEC code and then teleported to the main circuit via a logical-level joint measurement that connects two distinct QEC codes. In contrast to conventional magic state distillation (MSD) combined with gate teleportation, our method obviates the need for concatenating separate codes for distillation and logical qubits, thus reducing the total overhead from multiplicative to additive scaling. We illustrate our approach by explicitly demonstrating its implementation for a 3D color code interfaced with a surface code of the same code distance, and comment on its potential advantage over the conventional MSD-teleportation scheme.

arXiv:2503.19758•Physical Review A•Apr 30, 2026•3 citations

Overhead considerations of surface codes

Austin G. Fowler

Bulletin of the American Physical Society•Mar 21, 2013•1 citation

Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries

Guanyu Zhu, Shehryar Sikander, Elia Portnoy +2 more

We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log  ( n ) ) and O ( log  ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2  ( n ) ) rate and O ( log 1 2  ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.

arXiv:2310.16982•PRX Quantum•Nov 6, 2025•72 citations

Quantum Error Correction: Studying correlated errors on surface codes

Physics and Astronomy, REU/FRI Program, Thakur, Pritesh

•Aug 26, 2025•0 citations
One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the Z2{\mathbb{Z}}_{2}Z2​ surface code. Logical qubits can be encoded in a variety of ways in the surface code, based on either boundary defects, holes, or bulk twist defects. However, proposed fault-tolerant implementations of the Clifford group in these schemes are limited and often require unnecessary overhead. For example, the Clifford phase gate in certain planar and hole encodings has been proposed to be implemented using costly state injection and distillation protocols. In this paper, we show that within any encoding scheme for the logical qubits, we can fault tolerantly implement the full Clifford group by using joint measurements involving a single appropriately encoded logical ancilla. This allows us to provide low overhead implementations of the full Clifford group in surface and color codes. It also provides the first proposed implementations of the full Clifford group in hyperbolic codes. We further use our methods to propose state-of-the art encoding schemes for small numbers of logical qubits; for example, for code distances d=3,5,7d=3,5,7d=3,5,7, we propose a scheme using 60,160,30860,160,30860,160,308 (respectively) physical data qubits, which allow for the full logical Clifford group to be implemented on two logical qubits. To our knowledge, this is the optimal proposal to date, and thus may be useful for demonstration of fault-tolerant logical gates in small near-term quantum computers.
We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford gates at the logical level, thereby completing the universal gate set. Our approach exploits generalized lattice surgery to integrate two quantum error-correcting (QEC) codes. Specifically, non-Clifford gates are executed transversally on one QEC code and then teleported to the main circuit via a logical-level joint measurement that connects two distinct QEC codes. In contrast to conventional magic state distillation (MSD) combined with gate teleportation, our method obviates the need for concatenating separate codes for distillation and logical qubits, thus reducing the total overhead from multiplicative to additive scaling. We illustrate our approach by explicitly demonstrating its implementation for a 3D color code interfaced with a surface code of the same code distance, and comment on its potential advantage over the conventional MSD-teleportation scheme.
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log  ( n ) ) and O ( log  ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2  ( n ) ) rate and O ( log 1 2  ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.