Enabling Lie-Algebraic Classical Simulation beyond Free Fermions

• URL: http://arxiv.org/abs/2604.16701v1
• Date: Fri, 17 Apr 2026 21:05:34 GMT
• Title: Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
• Abstract summary: Existing applications of $mathfrakg$-sim have been confined to free-fermionic (matchgate) regimes.<n>In particular, we develop an Pauli basis for permutation-equivariant dynamics, supporting cubic-dimensional algebras despite exponential Pauli support.<n>These constructions significantly broaden the practical scope of $mathfrakg$-sim as a unifying simulation tool for structured quantum dynamics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, and the study of structured quantum dynamics. Lie-algebraic simulation ($\mathfrak{g}$-sim) is a compelling approach: it replaces exponentially large Hilbert-space evolution by dynamics in a reduced adjoint space whose dimension is set by the dynamical Lie algebra (DLA) of the circuit, enabling efficient simulation whenever the DLA grows only polynomially with system size. In practice, however, existing applications of $\mathfrak{g}$-sim have been confined to free-fermionic (matchgate) regimes, and it has been unclear how to extend the paradigm to other structured circuits whose generators may have large Pauli expansions. Here we enable Lie-algebraic classical simulation beyond free fermions by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted basis representations that make the adjoint space mapping tractable. In particular, we develop an explicit Pauli orbit basis for permutation-equivariant dynamics, supporting cubic-dimensional algebras despite exponential Pauli support, and a subspace-adapted (modified) generalized Gell-Mann basis for bounded Hamming-weight ($U(1)$-equivariant) dynamics, yielding polynomial costs on fixed excitation sectors. Together with streamlined routines for free-fermionic Pauli algebras and translation-invariant variants thereof, these constructions significantly broaden the practical scope of $\mathfrak{g}$-sim as a unifying simulation tool for structured quantum dynamics. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations.

Related papers

• Lie-Algebraic Classical Simulation of Bosonic Systems Beyond Gaussian Dynamics [0.0]
  We make bosonic systems accessible to the Lie-algebraic programme of exact-time classical simulation.<n>We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional generator algebra alone does not guarantee finite observable dynamics.<n>These results provide a unified formalism for discovering and systematically approxing tractable bosonic quantum dynamics.
  arXiv  Detail & Related papers  (2026-08-17T20:01:15Z)
• OnlyDense: Reduced-Order Modeling for Lagrangian simulation [8.41375218692909]
  We propose a learning framework for scalable representation and dynamics modeling of massive particle systems.<n>We approximate the state space with a linear subspace spanned by learned neural basis functions.<n>The proposed method accurately reconstructs and predicts dynamics, achieving an R$2$ score above $0.99$ with as few as $32$ basis functions.
  arXiv  Detail & Related papers  (2026-06-08T06:02:08Z)
• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors [40.72140849821964]
  We consider the massive Thirring and Gross-Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$.<n>We prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$.<n>Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models.
  arXiv  Detail & Related papers  (2026-02-25T19:00:01Z)
• Theoretical Foundations of Scaling Law in Familial Models [46.506708373314375]
  We introduce Granularity (G) as a fundamental scaling variable alongside model size (N) and training tokens (D)<n>Our results reveal that the granularity penalty follows a multiplicative power law with an extremely small exponent.<n> Practically, it validates the "train once, deploy many" paradigm, demonstrating that deployment flexibility is achievable.
  arXiv  Detail & Related papers  (2025-12-29T12:01:58Z)
• Explicit Quantum Circuits for Simulating Linear Differential Equations via Dilation [0.0]
  We present a concrete pipeline that connects the dilation formalism with explicit quantum circuit constructions.<n>On the analytical side, we introduce a discretization of the continuous dilation operator that is tailored for quantum implementation.<n>We prove that the resulting scheme achieves a global error bound of order $O(M-3/2)$, up to exponentially small boundary effects.
  arXiv  Detail & Related papers  (2025-09-20T18:54:49Z)
• Quantum Machine Learning in Multi-Qubit Phase-Space Part I: Foundations [0.3425341633647625]
  We construct a closed, composable dynamical formalism for one- and many-qubit systems in phase-space.<n>It recasts the curse of dimensionality in terms of harmonic support on a domain that scales linearly with the number of qubits.
  arXiv  Detail & Related papers  (2025-07-16T10:37:16Z)
• GausSim: Foreseeing Reality by Gaussian Simulator for Elastic Objects [55.02281855589641]
  GausSim is a novel neural network-based simulator designed to capture the dynamic behaviors of real-world elastic objects represented through Gaussian kernels.<n>We leverage continuum mechanics and treat each kernel as a Center of Mass System (CMS) that represents continuous piece of matter.<n>In addition, GausSim incorporates explicit physics constraints, such as mass and momentum conservation, ensuring interpretable results and robust, physically plausible simulations.
  arXiv  Detail & Related papers  (2024-12-23T18:58:17Z)
• Truncated Gaussian basis approach for simulating many-body dynamics [0.0]
  The approach constructs an effective Hamiltonian within a reduced subspace, spanned by fermionic Gaussian states, and diagonalizes it to obtain approximate eigenstates and eigenenergies.<n> Symmetries can be exploited to perform parallel computation, enabling to simulate systems with much larger sizes.<n>For quench dynamics we observe that time-evolving wave functions in the truncated subspace facilitates the simulation of long-time dynamics.
  arXiv  Detail & Related papers  (2024-10-05T15:47:01Z)
• Lie-algebraic classical simulations for quantum computing [0.3774866290142281]
  We present a framework for classical simulations, dubbed "$mathfrakg$-sim"<n>We show that $mathfrakg$-sim enables new regimes for classical simulations.<n>We report large-scale noiseless and noisy simulations on benchmark problems.
  arXiv  Detail & Related papers  (2023-08-02T21:08:18Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.