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 2representative citing papers
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing noise.
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.
-
Fault-tolerant syndrome extraction in [[n,1,3]] non-CSS code family generated using measurements on graph states
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing noise.