3 citations · 7 across the 7 of their papers we have counts for
8 papers
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
Aydin Deger, Stergios Koutsioumpas, Mark Webster +3
We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
Boren Gu, Tamas Noszko, Vincent Steffan +4
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-ra…
Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction
Leo Wursthorn, Jonathan Mandelbaum, Sisi Miao +4
Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propa…
Colour Codes Reach Surface Code Performance using Vibe Decoding
Stergios Koutsioumpas, Tamas Noszko, Hasan Sayginel +2
Two-dimensional quantum colour codes hold significant promise for quantum error correction, offering advantages such as planar connectivity and low overhead logical gates. Despite…
Automorphism Ensemble Decoding of Quantum LDPC Codes
Stergios Koutsioumpas, Hasan Sayginel, Mark Webster +1
We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. Our decoder employs a set of automorphisms of the quantum code a…
Heuristic and Optimal Synthesis of CNOT and Clifford Circuits
Mark Webster, Stergios Koutsioumpas, Dan E Browne
Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates…