Stabilizer Rényi entropy of 3-uniform hypergraph states equals a matrix-rank expression, cutting computation from exponential in 3N to polynomial in N times exponential in N.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A complexity quantifier for stabilizer quantum states is defined via Jordan and Lie products and linked to nonstabilizerness via the L^4-norm of characteristic functions.
Amplitude damping generates nonstabilizerness in qubit systems unlike depolarizing noise, with local injection washed out collectively after encoding, decoding, and postselection.
citing papers explorer
-
Stabilizer R\'enyi entropy of 3-uniform hypergraph states
Stabilizer Rényi entropy of 3-uniform hypergraph states equals a matrix-rank expression, cutting computation from exponential in 3N to polynomial in N times exponential in N.
-
Complexity of quantum states in the stabilizer formalism
A complexity quantifier for stabilizer quantum states is defined via Jordan and Lie products and linked to nonstabilizerness via the L^4-norm of characteristic functions.
-
Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
Amplitude damping generates nonstabilizerness in qubit systems unlike depolarizing noise, with local injection washed out collectively after encoding, decoding, and postselection.