High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.
citing papers explorer
-
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
-
Parity-unfolded distillation architecture for noise-biased platforms
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.