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
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 3years
2026 3roles
background 1polarities
background 1representative citing papers
Closed-form formula computes non-local magic for fermionic Gaussian states from two-point correlations in polynomial time.
Phase stripping reduces target-state magic to enable O(poly(n)) or O(1) sample fidelity estimation for phase-dominated states using a single fan-out gate plus nonlinear Pauli post-processing.
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.
-
Non-Local Magic Resources for Fermionic Gaussian States
Closed-form formula computes non-local magic for fermionic Gaussian states from two-point correlations in polynomial time.
-
Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic
Phase stripping reduces target-state magic to enable O(poly(n)) or O(1) sample fidelity estimation for phase-dominated states using a single fan-out gate plus nonlinear Pauli post-processing.