Exact Factorization of Unitary Transformations with Spin-Adapted Generators

• URL: http://arxiv.org/abs/2511.14914v1
• Date: Tue, 18 Nov 2025 21:06:54 GMT
• Title: Exact Factorization of Unitary Transformations with Spin-Adapted Generators
• Authors: Paarth Jain, Artur F. Izmaylov, Erik R. Kjellgren,
• Abstract summary: We introduce an exact and computationally efficient factorization of spin-adapted unitaries derived from fermionic double excitation and deexcitation rotations.<n>Our method exploits the fact that the elementary operators in these generators form small Lie algebras.<n>It preserves spin symmetry by design, reduces implementation cost, and ensures the accurate representation of electronic states in quantum simulations of molecular systems.
• Score: 0.03823356975862005
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Preserving spin symmetry in variational quantum algorithms is essential for producing physically meaningful electronic wavefunctions. Implementing spin-adapted transformations on quantum hardware, however, is challenging because the corresponding fermionic generators translate into noncommuting Pauli operators. In this work, we introduce an exact and computationally efficient factorization of spin-adapted unitaries derived from fermionic double excitation and deexcitation rotations. These unitaries are expressed as ordered products of exponentials of Pauli operators. Our method exploits the fact that the elementary operators in these generators form small Lie algebras. By working in the adjoint representation of these algebras, we reformulate the factorization problem as a low-dimensional nonlinear optimization over matrix exponentials. This approach enables precise numerical reparametrization of the unitaries without relying on symbolic manipulations. The proposed factorization provides a practical strategy for constructing symmetry-conserving quantum circuits within variational algorithms. It preserves spin symmetry by design, reduces implementation cost, and ensures the accurate representation of electronic states in quantum simulations of molecular systems.

Related papers

• On the Feasibility of Exact Unitary Transformations for Many-body Hamiltonians [2.7522708287669495]
  We show that exact unitary transformations arise whenever the adjoint action of a unitary's generator defines a linear map within a finite-dimensional operator space.<n>This perspective brings together previously disparate examples of exact transformations under a single unifying principle.<n>We illustrate this framework for unitary coupled-cluster and involutory generators, identifying cases in which a single commutator suffices.
  arXiv  Detail & Related papers  (2025-10-13T03:09:43Z)
• Matrix Elements of Fermionic Gaussian Operators in Arbitrary Pauli Bases: A Pfaffian Formula [0.0]
  We introduce a fully explicit and general Pfaffian formula for the matrix elements of fermionic Gaussian operators between arbitrary Pauli product states.<n>The resulting framework enables scalable computations across diverse fields.
  arXiv  Detail & Related papers  (2025-06-03T12:37:06Z)
• Closed-Form Expressions for Unitaries of Spin-Adapted Fermionic Operators [0.0]
  We analyze the mathematical structure of spin-adapted operators and derive closed-form expressions for unitaries generated by singlet spin-adapted generalized single and double excitations.<n>These results represent significant progress toward the economical enforcement of spin symmetry in quantum simulations.
  arXiv  Detail & Related papers  (2025-05-05T19:27:06Z)
• Variational Transformer Ansatz for the Density Operator of Steady States in Dissipative Quantum Many-Body Systems [44.598178952679575]
  We propose the textittransformer density operator ansatz for determining the steady states of dissipative quantum many-body systems.<n>By vectorizing the density operator as a many-body state in a doubled Hilbert space, the transformer encodes the amplitude and phase of the state's coefficients.<n>We demonstrate the effectiveness of our approach by numerically calculating the steady states of dissipative Ising and Heisenberg spin chain models.
  arXiv  Detail & Related papers  (2025-02-28T05:12:43Z)
• Quantum Rational Transformation Using Linear Combinations of Hamiltonian Simulations [0.0]
  We introduce effective implementations of rational transformations of a target operator on quantum hardware. We show that rational transformations can be performed efficiently with Hamiltonian simulations using a linear-combination-of-unitaries (LCU)
  arXiv  Detail & Related papers  (2024-08-14T18:00:01Z)
• Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems [6.281229317487581]
  We show how structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems.<n>Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• 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)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05: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)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Quantum circuits for the preparation of spin eigenfunctions on quantum computers [63.52264764099532]
  Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions. This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
  arXiv  Detail & Related papers  (2022-02-19T00:21:46Z)
• Reducing circuit depth in adaptive variational quantum algorithms via effective Hamiltonian theories [8.24048506727803]
  We introduce a new transformation in the form of a product of a linear combination of excitation operators to construct the effective Hamiltonian with finite terms. The effective Hamiltonian defined with this new transformation is incorporated into the adaptive variational quantum algorithms to maintain constant-size quantum circuits.
  arXiv  Detail & Related papers  (2022-01-23T09:38:46Z)
• 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)

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.