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.
Mana in haar-random states
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
Wigner negativity in Krylov space stays O(1) or grows as t^{1/2} (without Hilbert-space scaling) in 2d CFTs, one-cut matrix models, and double-scaled SYK, indicating emergent semiclassicality.
Memoryful open random quantum circuits sustain entanglement and magic growth like unitary circuits while memoryless ones show decaying entanglement but persistent magic, with memoryful dynamics approaching k-designs more effectively.
In a toy qubit model of quarks, baryons are fortuitous with exponential counting and super-exponential complexity while mesons are monotone with polynomial counting and power-law complexity.
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.
-
Wigner negativity in Krylov space and emergent semiclassicality
Wigner negativity in Krylov space stays O(1) or grows as t^{1/2} (without Hilbert-space scaling) in 2d CFTs, one-cut matrix models, and double-scaled SYK, indicating emergent semiclassicality.
-
Resource generation and dynamical complexities in open random quantum circuits
Memoryful open random quantum circuits sustain entanglement and magic growth like unitary circuits while memoryless ones show decaying entanglement but persistent magic, with memoryful dynamics approaching k-designs more effectively.
-
Fortuity and Complexity in a Simple Quark Model
In a toy qubit model of quarks, baryons are fortuitous with exponential counting and super-exponential complexity while mesons are monotone with polynomial counting and power-law complexity.