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

arXiv:1907.08157 · Quantum

A diagrammatic approach to variational quantum ansatz construction

Yaroslav Herasymenko, Thomas E. O’Brien

Published Dec 2, 2021• 27 citations
arXivHTMLPDF

Abstract

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.

DOI
10.22331/q-2021-12-02-596

Related papers

Ansätz Expressivity and Optimization in Variational Quantum Simulations of Transverse-field Ising Model Across System Sizes

Ashutosh P. Tripathi, Nilmani Mathur, Vikram Tripathi

We explore the application of the Variational Quantum Eigensolver (VQE) to investigate the ground state properties, particularly the entanglement entropy, of the Transverse Field Ising Model (TFIM) in one, two, and three dimensions, considering systems of up to 27 spins. By benchmarking VQE results against exact diagonalization and analyzing the entanglement properties across different system sizes, we assess the algorithm's effectiveness in capturing faithful ground state. Using results of TFIM, we also investigate how VQE's expressivity and optimization influence the simulation of highly entangled quantum states. We employ different ansätze: the hardware-efficient EfficientSU2 from Qiskit, the physics-inspired Hamiltonian Variational ansätz (HVA) and HVA with symmetry breaking, and benchmark their performance using energy variance, entanglement entropy, spin correlations, and magnetization. We further discuss the implications for scaling these methods to larger quantum systems.

quant-pharXiv:2604.20961•Apr 24, 2026•2 citations

Ansatz optimization of the variational quantum eigensolver tested on the atomic Anderson model

Giuseppe De Riso, Francesco Cipriani, Lorenzo Villani +4 more

Abstract We present a detailed analysis and optimization of the variational quantum algorithms required to find the ground state of a correlated electron model, using several types of variational ansatz. Specifically, we apply our approach to the atomic limit of the Anderson model, which is widely studied in condensed matter physics since it can simulate fundamental physical phenomena, ranging from magnetism to superconductivity. The method is developed by presenting efficient state preparation circuits that exhibit total spin, spin projection, particle number and time-reversal symmetries. These states contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace allowing to avoid irrelevant sectors of Hilbert space. Then, we show how to construct quantum circuits, providing explicit decomposition and gate count in terms of standard gate sets. We test these quantum algorithms looking at ideal quantum computer simulations as well as implementing quantum noisy simulations. We finally perform an accurate comparative analysis among the approaches implemented, highlighting their merits and shortcomings.

New Journal of Physics•Jun 1, 2024•0 citations

Orthogonal-ansatz VQE: Locating excited states without modifying a cost-function

Kyle Sherbert, Marco Buongiorno Nardelli

Most literature in the Variational Quantum Eigensolver (VQE) algorithm focuses on finding the ground state of a physical system, by minimizing a quantum-computed cost-function. When excited states are required, the cost-function is usually modified to include additional terms ensuring orthogonality with the ground state. This generally requires additional quantum circuit executions and measurements, increasing algorithmic complexity. Here we present a design strategy for the variational ansatz which enforces orthogonality in candidate excited states while still fully exploring the remaining subset of Hilbert space. The result is an excited-state VQE solver which trades increasing measurement complexity for increasing circuit complexity. The latter is anticipated to become preferable as quantum error mitigation and correction become more refined. We demonstrate our approach with three distinct ansatze, beginning with a simple single-body example, before generalizing to accommodate the full Hilbert space spanned by all qubits, and a constrained Hilbert space obeying particle number conservation.

arXiv:2204.04361•Apr 9, 2022•10 citations

Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver

Nikolay V. Tkachenko, James Sud, Yu Zhang +6 more

The variational quantum eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers.However, the circuit depth is expected to grow significantly with the problem size.Increased depth can both degrade the accuracy of the results and reduce trainability.In this work, we propose an approach to reduce ansatz circuit depth.Our approach, called "PermVQE," adds an additional optimization loop to the VQE that permutes qubits in order to solve for the qubit Hamiltonian that maximally localizes correlations in the ground state.The choice of permutations is based on mutual information, which is a measure of interaction between electrons and/or holes in spin-orbitals.Encoding strongly entangled spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state.For representative molecular systems, LiH, H 2 , (H 2 ) 2 , H = 4 , H + 3 , and N 2 , we demonstrate that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy.The approach is designed for hardware-efficient ansatz of any qubit connectivity, and examples are demonstrated for linear and twodimensional grid architectures.The main ideas can also be applied to simulate molecules with other ansatz as well as variational quantum algorithms beyond the VQE.In particular, we demonstrate the beneficial effect of qubit permutations to build fermionic-adaptive derivative assembled pseudo-Trotter ansatz on a linear qubit connectivity architecture with nearly a twofold reduction of the number of controlled NOT gates.

arXiv:2009.04996•PRX Quantum•Jun 9, 2021•81 citations

Automated variational ansatz design

Matthys Johannes Lourens

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.

•Mar 1, 2026•0 citations

Truncation technique for variational quantum eigensolver for Molecular Hamiltonians

Xu, Qidong, Kanav Setia

The variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for the near-term noisy intermediate-scale quantum (NISQ) devices. The VQE typically involves finding the minimum energy of a quantum Hamiltonian through classical optimization of a parametrized quantum ansatz. One of the bottlenecks in VQEs is the number of quantum circuits to be measured. In this work, we propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian and then gradually transitions to the optimization for the original Hamiltonian via an operator classification method. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer. The reduction in required quantum resources for our strategy is substantial and likely scales with the system size. With numerical simulations, we demonstrate our method for various molecular systems.

arXiv:2402.01630•Feb 2, 2024•4 citations
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.
We explore the application of the Variational Quantum Eigensolver (VQE) to investigate the ground state properties, particularly the entanglement entropy, of the Transverse Field Ising Model (TFIM) in one, two, and three dimensions, considering systems of up to 27 spins. By benchmarking VQE results against exact diagonalization and analyzing the entanglement properties across different system sizes, we assess the algorithm's effectiveness in capturing faithful ground state. Using results of TFIM, we also investigate how VQE's expressivity and optimization influence the simulation of highly entangled quantum states. We employ different ansätze: the hardware-efficient EfficientSU2 from Qiskit, the physics-inspired Hamiltonian Variational ansätz (HVA) and HVA with symmetry breaking, and benchmark their performance using energy variance, entanglement entropy, spin correlations, and magnetization. We further discuss the implications for scaling these methods to larger quantum systems.
Abstract We present a detailed analysis and optimization of the variational quantum algorithms required to find the ground state of a correlated electron model, using several types of variational ansatz. Specifically, we apply our approach to the atomic limit of the Anderson model, which is widely studied in condensed matter physics since it can simulate fundamental physical phenomena, ranging from magnetism to superconductivity. The method is developed by presenting efficient state preparation circuits that exhibit total spin, spin projection, particle number and time-reversal symmetries. These states contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace allowing to avoid irrelevant sectors of Hilbert space. Then, we show how to construct quantum circuits, providing explicit decomposition and gate count in terms of standard gate sets. We test these quantum algorithms looking at ideal quantum computer simulations as well as implementing quantum noisy simulations. We finally perform an accurate comparative analysis among the approaches implemented, highlighting their merits and shortcomings.
Most literature in the Variational Quantum Eigensolver (VQE) algorithm focuses on finding the ground state of a physical system, by minimizing a quantum-computed cost-function. When excited states are required, the cost-function is usually modified to include additional terms ensuring orthogonality with the ground state. This generally requires additional quantum circuit executions and measurements, increasing algorithmic complexity. Here we present a design strategy for the variational ansatz which enforces orthogonality in candidate excited states while still fully exploring the remaining subset of Hilbert space. The result is an excited-state VQE solver which trades increasing measurement complexity for increasing circuit complexity. The latter is anticipated to become preferable as quantum error mitigation and correction become more refined. We demonstrate our approach with three distinct ansatze, beginning with a simple single-body example, before generalizing to accommodate the full Hilbert space spanned by all qubits, and a constrained Hilbert space obeying particle number conservation.
The variational quantum eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers.However, the circuit depth is expected to grow significantly with the problem size.Increased depth can both degrade the accuracy of the results and reduce trainability.In this work, we propose an approach to reduce ansatz circuit depth.Our approach, called "PermVQE," adds an additional optimization loop to the VQE that permutes qubits in order to solve for the qubit Hamiltonian that maximally localizes correlations in the ground state.The choice of permutations is based on mutual information, which is a measure of interaction between electrons and/or holes in spin-orbitals.Encoding strongly entangled spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state.For representative molecular systems, LiH, H 2 , (H 2 ) 2 , H = 4 , H + 3 , and N 2 , we demonstrate that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy.The approach is designed for hardware-efficient ansatz of any qubit connectivity, and examples are demonstrated for linear and twodimensional grid architectures.The main ideas can also be applied to simulate molecules with other ansatz as well as variational quantum algorithms beyond the VQE.In particular, we demonstrate the beneficial effect of qubit permutations to build fermionic-adaptive derivative assembled pseudo-Trotter ansatz on a linear qubit connectivity architecture with nearly a twofold reduction of the number of controlled NOT gates.
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.
The variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for the near-term noisy intermediate-scale quantum (NISQ) devices. The VQE typically involves finding the minimum energy of a quantum Hamiltonian through classical optimization of a parametrized quantum ansatz. One of the bottlenecks in VQEs is the number of quantum circuits to be measured. In this work, we propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian and then gradually transitions to the optimization for the original Hamiltonian via an operator classification method. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer. The reduction in required quantum resources for our strategy is substantial and likely scales with the system size. With numerical simulations, we demonstrate our method for various molecular systems.