2 papers
quant-ph2026
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…
quant-ph2026
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…