Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Automated variational ansatz design

Matthys Johannes Lourens

Published Mar 1, 2026• 0 citations
OpenAlex

Abstract

ENGLISH ABSTRACT: We develop a systematic approach to ansatz design for quantum many-body problems. The approach is based on an abstract hypergraph language that compactly encodes modular, size-scalable and hierarchically composable wavefunction structures. With this language, evolutionary search can be carried out on few-body instances, yet the resulting wavefunctions extrapolate to arbitrary system size without modification. This enables efficient fitness evaluation and the capture of robust wavefunction structures. Applied to ground-state problems, the method autonomously rediscovers a mean-field description and extends it to incorporate correlations, producing simple, interpretable wavefunctions that remain analytically tractable. For both the Lipkin-Meshkov-Glick model and the transverse-field I sing model, the search converges on the same compact, twoparameter ansatz. Owing to its structure, we obtain closed-form expressions for energies and correlation functions. These results far surpass mean-field theory on finite systems and become exact or near-exact in the thermodynamic limit. The same framework also generates a quantum phase-recognition ansatz that outperforms a commonly used architecture while reducing the number of required variational parameters by two orders of magnitude. Finally, by training only on small-circuit examples, the method automatically produces general 𝑁-qubit realisations of standard quantum algorithms, namely the Deutsch-Jozsa algorithm, the quantum Fourier transform, and Grover’s search. Taken together, our approach provides a concrete pathway towards a general, systematic theory of variational ansatz design.

Related papers

Generating Generalized Ground-State Ansätze from Few-Body Examples

Matt Lourens, Ilya Sinayskiy, Johannes N. Kriel +1 more

We introduce a method that generates ground-state Ansätze for quantum many-body systems that are both analytically tractable and accurate over wide parameter regimes. Our approach leverages a custom symbolic language to construct tensor network states via an evolutionary algorithm. This language provides operations that allow the generated tensor network states to automatically scale with system size. Consequently, we can evaluate Ansatz fitness for small systems, which is computationally efficient, while favoring structures that continue to perform well with increasing system size. This ensures that the Ansatz captures robust features of the ground-state structure. Remarkably, we find analytically tractable Ansätze with a degree of universality, which encode correlations, capture finite-size effects, accurately predict ground-state energies, and offer a good description of critical phenomena. We demonstrate this method on the Lipkin-Meshkov-Glick model and the quantum transverse-field Ising model, where the same Ansatz was independently generated for both. The simple structure of the Ansatz allows us to obtain exact expressions for the expectation values of local observables as well as for correlation functions. In addition, it permits symmetries that are broken in the Ansatz to be restored, which provides a systematic means of improving the accuracy of the Ansatz.

arXiv:2503.00497•Physical Review Letters•Nov 20, 2025•1 citation

A diagrammatic approach to variational quantum ansatz construction

Yaroslav Herasymenko, Thomas E. O’Brien

Variational quantum eigensolvers (VQEs) are a promising class of quantum algorithms for preparing approximate ground states in near-term quantum devices. Minimizing the error in such an approximation requires designing ansatzes using physical considerations that target the studied system. One such consideration is size-extensivity, meaning that the ground state quantum correlations are to be compactly represented in the ansatz. On digital quantum computers, however, the size-extensive ansatzes usually require expansion via Trotter-Suzuki methods. These introduce additional costs and errors to the approximation. In this work, we present a diagrammatic scheme for the digital VQE ansatzes, which is size-extensive but does not rely on Trotterization. We start by designing a family of digital ansatzes that explore the entire Hilbert space with the minimum number of free parameters. We then demonstrate how one may compress an arbitrary digital ansatz, by enforcing symmetry constraints of the target system, or by using them as parent ansatzes for a hierarchy of increasingly long but increasingly accurate sub-ansatzes. We apply a perturbative analysis and develop a diagrammatic formalism that ensures the size-extensivity of generated hierarchies. We test our methods on a short spin chain, finding good convergence to the ground state in the paramagnetic and the ferromagnetic phase of the transverse-field Ising model.

arXiv:1907.08157•Quantum•Dec 2, 2021•27 citations

A Size-Consistent Wave-function Ansatz Built from Statistical Analysis of Orbital Occupations

Valerii Chuiko, Paul W. Ayers

Direct approaches to the quantum many-body problem suffer from the so-called "curse of dimensionality": the number of parameters needed to fully specify the exact wavefunction grows exponentially with increasing system size. This motivates the develop of accurate, but approximate, ways to parametrize the wavefunction, including methods like couple cluster theory and correlator product states (CPS). Recently, there has been interest in approaches based on machine learning both direct applications of neural network architecture and the combinations of conventional wavefunction parametrizations with various Boltzmann machines. While all these methods can be exact in principle, they are usually applied with only a polynomial number of parameters, limiting their applicability. This research's objective is to present a fresh approach to wavefunction parametrization that is size-consistent, rapidly convergent, and robust numerically. Specifically, we propose a hierarchical ansatz that converges rapidly (with respect to the number of least-squares optimization). The general utility of this approach is verified by applying it to uncorrelated, weakly-correlated, and strongly-correlated systems, including small molecules and the one-dimensional Hubbard model.

arXiv:2304.10484•Apr 20, 2023•1 citation

Quantum algorithms for quantum chemistry

Daniel Marti-Dafcik

Computer simulation is central to understanding the behaviour of matter. Yet, more than a century after the development of quantum theory, first-principles simulation of chemistry remains a daunting challenge, owing to the exponential growth in memory required to represent interacting quantum particles such as electrons in molecules. Quantum computing offers, in principle, a fundamentally more efficient paradigm for simulating quantum systems, with quantum chemistry often cited as a flagship application. However, many quantum algorithms face intrinsic limitations, and any genuine quantum advantage must surpass the strong baseline set by decades of progress in classical algorithms and hardware. While classical methods often suffice for simulating weakly correlated systems, systems with many strongly correlated electrons remain a challenge for both classical and quantum approaches. In this thesis, we develop quantum algorithms for solving the time-independent Schrödinger equation, with a focus on molecular systems with strongly correlated electrons. We introduce a framework for identifying a compact set of states that parametrise the many-body wavefunction by capturing the correlation due to spin coupling between localised electrons. This representation requires very few variational parameters but incurs a very high memory cost on classical computers. To overcome this, we design quantum circuits that efficiently prepare such states by exploiting their symmetry, encoding the dominant entanglement structure of electronic wavefunctions into the initial qubit states. Through theoretical analysis and classical simulations of quantum computers, we show that this substantially reduces the quantum resources required to accurately compute ground- and excitedstate properties. Finally, we develop an approach for approximating the optimal ansatz within the variational quantum eigensolver, an algorithm designed for near-term quantum devices. Our method constructs wavefunctions from products of symmetrypreserving unitary operators and couples discrete and continuous optimisation to yield highly compact representations of strongly correlated electrons using shallow quantum circuits. Together, these results establish complementary directions for embedding problemspecific structure into quantum simulation algorithms, advancing the practical simulation of strongly correlated electrons.

•Jan 1, 2025•0 citations

Scalable quantum state preparation via large-language-model-driven discovery

Qing-Hong Cao, Zong-Yue Hou, Yingying Li +5 more

Efficient quantum state preparation remains a central challenge in first-principles quantum simulations of dynamics in quantum field theories, where the Hilbert space is intrinsically infinite-dimensional. Here, we introduce a large language model (LLM)-assisted framework for quantum-circuit design that systematically scales state-preparation circuits to large lattice volumes. Applied to a 1+1d XY spin chain, the LLM autonomously discovers a compact 4-parameter circuit that captures boundary-induced symmetry breaking with sub-percent energy deviation, enabling successful validation on the \texttt{Zuchongzhi} quantum processor. Guided by this insight, we extend the framework to 2+1d quantum field theories, where scalable variational ansätze have remained elusive. For a scalar field theory, the search yields a symmetry-preserving, 3-parameter shallow-depth ansatz whose optimized parameters converge to size-independent constants for lattices $n \ge 4$, providing, to our knowledge, the first scalable ansatz for this class of 2+1d models. Our results establish a practical route toward AI-assisted, human-guided discovery in quantum simulation.

arXiv:2505.06347•Physical review. D/Physical review. D.•Nov 5, 2026•11 citations

SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians

Alexander Holden, Moinul Hossain Rahat, Nii Osae Osae Dade

The ground state search problem is central to quantum computing, with applications spanning quantum chemistry, condensed matter physics, and optimization. The Variational Quantum Eigensolver (VQE) has shown promise for small systems but faces significant limitations. These include barren plateaus, restricted ansatz expressivity, and reliance on domain-specific structure. We present SpinGQE, an extension of the Generative Quantum Eigensolver (GQE) framework to spin Hamiltonians. Our approach reframes circuit design as a generative modeling task. We employ a transformer-based decoder to learn distributions over quantum circuits that produce low-energy states. Training is guided by a weighted mean-squared error loss between model logits and circuit energies evaluated at each gate subsequence. We validate our method on the four-qubit Heisenberg model, demonstrating successfulconvergencetonear-groundstates. Throughsystematichyperparameterexploration, we identify optimal configurations: smaller model architectures (12 layers, 8 attention heads), longer sequence lengths (12 gates), and carefully chosen operator pools yield the most reliable convergence. Our results show that generative approaches can effectively navigate complex energy landscapes without relying on problem-specific symmetries or structure. This provides a scalable alternative to traditional variational methods for general quantum systems. An open-source implementation is available at https://github.com/Mindbeam-AI/SpinGQE.

quant-pharXiv:2603.24298•Mar 26, 2026•1 citation
ENGLISH ABSTRACT: We develop a systematic approach to ansatz design for quantum many-body problems. The approach is based on an abstract hypergraph language that compactly encodes modular, size-scalable and hierarchically composable wavefunction structures. With this language, evolutionary search can be carried out on few-body instances, yet the resulting wavefunctions extrapolate to arbitrary system size without modification. This enables efficient fitness evaluation and the capture of robust wavefunction structures. Applied to ground-state problems, the method autonomously rediscovers a mean-field description and extends it to incorporate correlations, producing simple, interpretable wavefunctions that remain analytically tractable. For both the Lipkin-Meshkov-Glick model and the transverse-field I sing model, the search converges on the same compact, twoparameter ansatz. Owing to its structure, we obtain closed-form expressions for energies and correlation functions. These results far surpass mean-field theory on finite systems and become exact or near-exact in the thermodynamic limit. The same framework also generates a quantum phase-recognition ansatz that outperforms a commonly used architecture while reducing the number of required variational parameters by two orders of magnitude. Finally, by training only on small-circuit examples, the method automatically produces general 𝑁-qubit realisations of standard quantum algorithms, namely the Deutsch-Jozsa algorithm, the quantum Fourier transform, and Grover’s search. Taken together, our approach provides a concrete pathway towards a general, systematic theory of variational ansatz design.
We introduce a method that generates ground-state Ansätze for quantum many-body systems that are both analytically tractable and accurate over wide parameter regimes. Our approach leverages a custom symbolic language to construct tensor network states via an evolutionary algorithm. This language provides operations that allow the generated tensor network states to automatically scale with system size. Consequently, we can evaluate Ansatz fitness for small systems, which is computationally efficient, while favoring structures that continue to perform well with increasing system size. This ensures that the Ansatz captures robust features of the ground-state structure. Remarkably, we find analytically tractable Ansätze with a degree of universality, which encode correlations, capture finite-size effects, accurately predict ground-state energies, and offer a good description of critical phenomena. We demonstrate this method on the Lipkin-Meshkov-Glick model and the quantum transverse-field Ising model, where the same Ansatz was independently generated for both. The simple structure of the Ansatz allows us to obtain exact expressions for the expectation values of local observables as well as for correlation functions. In addition, it permits symmetries that are broken in the Ansatz to be restored, which provides a systematic means of improving the accuracy of the Ansatz.
Variational quantum eigensolvers (VQEs) are a promising class of quantum algorithms for preparing approximate ground states in near-term quantum devices. Minimizing the error in such an approximation requires designing ansatzes using physical considerations that target the studied system. One such consideration is size-extensivity, meaning that the ground state quantum correlations are to be compactly represented in the ansatz. On digital quantum computers, however, the size-extensive ansatzes usually require expansion via Trotter-Suzuki methods. These introduce additional costs and errors to the approximation. In this work, we present a diagrammatic scheme for the digital VQE ansatzes, which is size-extensive but does not rely on Trotterization. We start by designing a family of digital ansatzes that explore the entire Hilbert space with the minimum number of free parameters. We then demonstrate how one may compress an arbitrary digital ansatz, by enforcing symmetry constraints of the target system, or by using them as parent ansatzes for a hierarchy of increasingly long but increasingly accurate sub-ansatzes. We apply a perturbative analysis and develop a diagrammatic formalism that ensures the size-extensivity of generated hierarchies. We test our methods on a short spin chain, finding good convergence to the ground state in the paramagnetic and the ferromagnetic phase of the transverse-field Ising model.
Direct approaches to the quantum many-body problem suffer from the so-called "curse of dimensionality": the number of parameters needed to fully specify the exact wavefunction grows exponentially with increasing system size. This motivates the develop of accurate, but approximate, ways to parametrize the wavefunction, including methods like couple cluster theory and correlator product states (CPS). Recently, there has been interest in approaches based on machine learning both direct applications of neural network architecture and the combinations of conventional wavefunction parametrizations with various Boltzmann machines. While all these methods can be exact in principle, they are usually applied with only a polynomial number of parameters, limiting their applicability. This research's objective is to present a fresh approach to wavefunction parametrization that is size-consistent, rapidly convergent, and robust numerically. Specifically, we propose a hierarchical ansatz that converges rapidly (with respect to the number of least-squares optimization). The general utility of this approach is verified by applying it to uncorrelated, weakly-correlated, and strongly-correlated systems, including small molecules and the one-dimensional Hubbard model.
Computer simulation is central to understanding the behaviour of matter. Yet, more than a century after the development of quantum theory, first-principles simulation of chemistry remains a daunting challenge, owing to the exponential growth in memory required to represent interacting quantum particles such as electrons in molecules. Quantum computing offers, in principle, a fundamentally more efficient paradigm for simulating quantum systems, with quantum chemistry often cited as a flagship application. However, many quantum algorithms face intrinsic limitations, and any genuine quantum advantage must surpass the strong baseline set by decades of progress in classical algorithms and hardware. While classical methods often suffice for simulating weakly correlated systems, systems with many strongly correlated electrons remain a challenge for both classical and quantum approaches. In this thesis, we develop quantum algorithms for solving the time-independent Schrödinger equation, with a focus on molecular systems with strongly correlated electrons. We introduce a framework for identifying a compact set of states that parametrise the many-body wavefunction by capturing the correlation due to spin coupling between localised electrons. This representation requires very few variational parameters but incurs a very high memory cost on classical computers. To overcome this, we design quantum circuits that efficiently prepare such states by exploiting their symmetry, encoding the dominant entanglement structure of electronic wavefunctions into the initial qubit states. Through theoretical analysis and classical simulations of quantum computers, we show that this substantially reduces the quantum resources required to accurately compute ground- and excitedstate properties. Finally, we develop an approach for approximating the optimal ansatz within the variational quantum eigensolver, an algorithm designed for near-term quantum devices. Our method constructs wavefunctions from products of symmetrypreserving unitary operators and couples discrete and continuous optimisation to yield highly compact representations of strongly correlated electrons using shallow quantum circuits. Together, these results establish complementary directions for embedding problemspecific structure into quantum simulation algorithms, advancing the practical simulation of strongly correlated electrons.
Efficient quantum state preparation remains a central challenge in first-principles quantum simulations of dynamics in quantum field theories, where the Hilbert space is intrinsically infinite-dimensional. Here, we introduce a large language model (LLM)-assisted framework for quantum-circuit design that systematically scales state-preparation circuits to large lattice volumes. Applied to a 1+1d XY spin chain, the LLM autonomously discovers a compact 4-parameter circuit that captures boundary-induced symmetry breaking with sub-percent energy deviation, enabling successful validation on the \texttt{Zuchongzhi} quantum processor. Guided by this insight, we extend the framework to 2+1d quantum field theories, where scalable variational ansätze have remained elusive. For a scalar field theory, the search yields a symmetry-preserving, 3-parameter shallow-depth ansatz whose optimized parameters converge to size-independent constants for lattices n≥4n \ge 4n≥4, providing, to our knowledge, the first scalable ansatz for this class of 2+1d models. Our results establish a practical route toward AI-assisted, human-guided discovery in quantum simulation.
The ground state search problem is central to quantum computing, with applications spanning quantum chemistry, condensed matter physics, and optimization. The Variational Quantum Eigensolver (VQE) has shown promise for small systems but faces significant limitations. These include barren plateaus, restricted ansatz expressivity, and reliance on domain-specific structure. We present SpinGQE, an extension of the Generative Quantum Eigensolver (GQE) framework to spin Hamiltonians. Our approach reframes circuit design as a generative modeling task. We employ a transformer-based decoder to learn distributions over quantum circuits that produce low-energy states. Training is guided by a weighted mean-squared error loss between model logits and circuit energies evaluated at each gate subsequence. We validate our method on the four-qubit Heisenberg model, demonstrating successfulconvergencetonear-groundstates. Throughsystematichyperparameterexploration, we identify optimal configurations: smaller model architectures (12 layers, 8 attention heads), longer sequence lengths (12 gates), and carefully chosen operator pools yield the most reliable convergence. Our results show that generative approaches can effectively navigate complex energy landscapes without relying on problem-specific symmetries or structure. This provides a scalable alternative to traditional variational methods for general quantum systems. An open-source implementation is available at https://github.com/Mindbeam-AI/SpinGQE.