From the 1 of 6 linked papers with an AI index.
6 papers
Finding diagonal logical gates in CSS codes and circuits
Andreas Bauer
The paper introduces efficient algorithms to identify all diagonal logical gates that preserve the code space of CSS codes or circuits, enabling the systematic discovery of fault‑t…
High-threshold decoding of non-Pauli codes for 2D universality
Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert +1
Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achiev…
Universal fault tolerant quantum computation in 2D without getting tied in knots
Margarita Davydova, Andreas Bauer, Julio C. Magdalena de la Fuente +3
We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose co…
Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
Andreas Bauer, Julio C. Magdalena de la Fuente
We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical gate or a logical non-Paul…
Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
Andreas Bauer
We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits, realizing any abelian non-chiral topological phase as an actively error-corre…
The x+y Floquet code: A simple example for topological quantum computation in the path integral approach
Andreas Bauer
The path-integral approach to topological quantum error correction provides a unified way to construct and analyze fault-tolerant circuits in spacetime. In this work, we demonstrat…