A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, benchmarking, and the study of structured quantum dynamics. Lie-algebraic simulation ($\mathfrak{g}$-sim) offers a compelling approach: it represents Heisenberg-picture dynamics in the adjoint space whose dimension is set by the dynamical Lie algebra (DLA) governing the circuit, enabling efficient simulation of expectation values whenever the DLA grows only polynomially with system size. Despite this promise, existing applications of $\mathfrak{g}$-sim have been confined to free-fermionic settings. It has therefore remained unclear if the method can be applied to other structured circuit families, especially when their generators have large Pauli expansions, and hence whether Lie-algebraic simulability presents a genuinely broader paradigm than free fermions. In this work, we resolve this question by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted bases that make the required adjoint-space preprocessing tractable. In particular, we develop an explicit Pauli orbit representation for permutation-equivariant dynamics, enabling efficient processing of cubic-dimensional algebras despite exponential Pauli support, and a modified generalized Gell--Mann representation for bounded Hamming-weight ($U(1)$-equivariant) dynamics, yielding polynomial simulation costs on fixed excitation sectors. Together with streamlined routines for free-fermionic algebras, these constructions significantly broaden the practical scope of $\mathfrak{g}$-sim as a unifying simulation tool for structured quantum circuits. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations beyond the reach of state-vector simulation.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exponentially many initializations to avoid barren plateaus
A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.