Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background
The paper addresses quantifying 'magic' or nonstabilizerness in quantum codes, which is a resource for universal quantum computation but hard to measure due to sums over many Pauli operators. The authors found that removing an inert quadratic background via Clifford operations isolates the essential order-three (cubic) magic, reducing it to finite combinatorial problems for several code families.