Fast algorithms for classical specifications of stabiliser states and Clifford gates

N de Silva, W Salmon, M Yin - Quantum, 2025 - quantum-journal.org
The stabiliser formalism plays a central role in quantum computing, error correction, and
fault tolerance. Conversions between and verifications of different specifications of stabiliser …

Stabilizer operators and Barnes-Wall lattices

V Kliuchnikov, S Schönnenbeck - arxiv preprint arxiv:2404.17677, 2024 - arxiv.org
We give a simple description of rectangular matrices that can be implemented by a post-
selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields …

Decision-tree decoders for general quantum LDPC codes

KR Ott, B Hetényi, ME Beverland - arxiv preprint arxiv:2502.16408, 2025 - arxiv.org
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary
check matrix, making them broadly applicable for decoding any quantum low-density parity …

Minimal entanglement for injecting diagonal gates

V Kliuchnikov, E Schoute - arxiv preprint arxiv:2403.18900, 2024 - arxiv.org
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by
first distilling magic states in specialised magic-state factories. In the rest of the architecture …