4 papers · 1 filter
Finding diagonal logical gates in CSS codes and circuits
Andreas Bauer
Finding efficient schemes for non-Clifford logic or magic state preparation is one of the central challenges on the way to fault-tolerant quantum computation. Many of the proposed…
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…
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…
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…