Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2roles
background 1polarities
background 1representative citing papers
Perturbed random Floquet-Clifford circuits exhibit operator-space fragmentation into wall-separated sectors for p < 1, yielding exact local integrals of motion, tunable operator spreading length, an entanglement bottleneck, and a pre-RMT fragmentation timescale at p = 1.
citing papers explorer
-
Computing quantum magic of state vectors
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
-
Operator space fragmentation in perturbed Floquet-Clifford circuits
Perturbed random Floquet-Clifford circuits exhibit operator-space fragmentation into wall-separated sectors for p < 1, yielding exact local integrals of motion, tunable operator spreading length, an entanglement bottleneck, and a pre-RMT fragmentation timescale at p = 1.