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
An algorithm leveraging the Clifford group and graph representation to find symmetries in many-body Hamiltonians, demonstrated on random and physical instances up to 1000 qubits.
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.
-
Clifford symmetries in quantum many-body systems
An algorithm leveraging the Clifford group and graph representation to find symmetries in many-body Hamiltonians, demonstrated on random and physical instances up to 1000 qubits.