An Optimal Framework for Constructing Lie-Algebra Generator Pools: Application to Variational Quantum Eigensolvers for Chemistry

• URL: http://arxiv.org/abs/2511.22593v2
• Date: Mon, 01 Dec 2025 12:03:29 GMT
• Title: An Optimal Framework for Constructing Lie-Algebra Generator Pools: Application to Variational Quantum Eigensolvers for Chemistry
• Authors: Yaromir Viswanathan, Olivier Adjoua, César Feniou, Siwar Badreddine, Jean-Philip Piquemal,
• Abstract summary: Lie Quantum Algebras are powerful mathematical structures used in physics to describe sets of operators and associated combinations.<n>The classical search for such generators has so far relied on greedy construction steps applied to an exponentially growing number of candidate operators.<n>We propose a general, computationally-scaling and optimal strategy, based on Lie-Algebraic basic properties, to overcome this bottleneck.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lie Algebras are powerful mathematical structures used in physics to describe sets of operators and associated combinations. A central task is to identify a minimal set of generators from which the algebra can be constructed. The classical search for such generators has so far relied on greedy construction steps applied to an exponentially growing number of candidate operators, making it rapidly computationally intractable. We propose a general, polynomial-scaling and optimal strategy, based on Lie-Algebraic basic properties, to overcome this bottleneck. It allows for the efficient construction of these generators, also known as Minimal Complete Pools (MCPs), for a target Lie Algebra. As an immediate application, efficiently constructing user-defined MCPs that respect fermionic algebra is crucial in the context of adaptive Variational Quantum Eigensolver for quantum chemistry. Thus, we introduce MB-ADAPT-VQE, which incorporates optimally constructed MCPs into batched ADAPT-VQE to reduce quantum resources and improve convergence under strong correlation. These MCPs also unlock fixed-ansatz methods based on a Lie-algebraic structure such as the gradient-free NI-DUCC-VQE, enabling simulations surpassing prior MCP limits. The presented mathematical framework is general and applicable well beyond chemistry in fields including quantum error correction, quantum control, quantum machine learning, and more universally wherever compact Pauli basis are required.

Related papers

• Heisenberg-Limited Quantum Eigenvalue Estimation for Non-normal Matrices [5.733109475878588]
  Estimating the eigenvalues of non-normal matrices is a foundational problem with far-reaching implications.<n>Here we introduce a new class of quantum algorithms that directly address this challenge.<n>Our work lays the foundation for a rigorous and scalable quantum computing approach to one of the most demanding problems in linear algebra.
  arXiv  Detail & Related papers  (2025-10-22T14:55:44Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• 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)
• Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds [0.0]
  We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifold (PLoM)<n>It involves solving the spectral problem of the high-dimensional Fokker-Planck operator, which remains beyond the reach of classical computing.<n>Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions.
  arXiv  Detail & Related papers  (2025-02-20T14:05:16Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Unleashed from Constrained Optimization: Quantum Computing for Quantum Chemistry Employing Generator Coordinate Inspired Method [9.95432381301196]
  We introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the Unitary Coupled Cluster excitation generators.<n>This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization.
  arXiv  Detail & Related papers  (2023-12-12T19:36:51Z)
• 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)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.