Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
Random ensembles of symplectic and unitary states are indistinguishable,
4 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
Classical shadow protocols using uniform sampling over compact symmetric spaces admit a unifying theory and yield slight sample-complexity improvements over standard schemes for certain observable distributions.
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
citing papers explorer
-
Particle-preserving fermionic shadows with mode-independent sample complexity
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
-
Classical shadows over symmetric spaces
Classical shadow protocols using uniform sampling over compact symmetric spaces admit a unifying theory and yield slight sample-complexity improvements over standard schemes for certain observable distributions.
-
From Pauli Strings to Quantum Dynamics: A Unified Characterization
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.