Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
Improved Classical Simulation of Quantum Circuits Dominated by
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
citing papers explorer
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
-
Linear-Time T-Gate Optimization via Random Abstraction
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.