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 2years
2026 2roles
background 1polarities
background 1representative 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
-
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.
-
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.