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:2103.15021 · Quantum

Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model

Saad Yalouz, Bruno Senjean, Filippo M. Miatto, Vedran Dunjko

Published Nov 8, 2021• 10 citations
arXivHTMLPDF

Abstract

Variational quantum algorithms (VQA) are considered as some of the most promising methods to determine the properties of complex strongly correlated quantum many-body systems, especially from the perspective of devices available in the near term. In this context, the development of efficient quantum circuit ansatze to encode a many-body wavefunction is one of the keys for the success of a VQA. Great efforts have been invested to study the potential of current quantum devices to encode the eigenstates of fermionic systems, but little is known about the encoding of bosonic systems. In this work, we investigate the encoding of the ground state of the (simple but rich) attractive Bose-Hubbard model using a Continuous-Variable (CV) photonic-based quantum circuit. We introduce two different ansatz architectures and demonstrate that the proposed continuous variable quantum circuits can efficiently encode (with a fidelity higher than 99%) the strongly correlated many-boson wavefunction with just a few layers, in all many-body regimes and for different number of bosons and initial states. Beyond the study of the suitability of the ansatz to approximate the ground states of many-boson systems, we also perform initial evaluations of the use of the ansatz in a variational quantum eigensolver algorithm to find it through energy minimization. To this end we also introduce a scheme to measure the Hamiltonian energy in an experimental system, and study the effect of sampling noise.

DOI
10.22331/q-2021-11-08-572

Related papers

Ab initio polaritonic chemistry on diverse quantum computing platforms: Ansatz circuit design for qubit, qudit, and hybrid qubit-qumode architectures

Even Chiari, Wafa Makhlouf, Lucie Pepe +5 more

In the field of ab initio polaritonic chemistry, the use of quantum computers may offer, in the long term, a promising computational pathway for simulating and exploring novel cavity-induced light-matter phenomena. Addressing such problems on emerging platforms, however, already presents significant challenges that need to be considered for near-term applications. Within the framework of the variational quantum eigensolver (VQE), a key question concerns the development of quantum circuit Ans\"atze capable of encoding strongly correlated electron-photon states at a reasonable resource cost. Motivated by this question, in this work we develop different Ansatz strategies covering not only conventional qubit-based approaches but also higher-dimensional information units. Specifically, we introduce a set of circuits tailored to three different quantum computing architectures: (i) qubits, (ii) qudits, and (iii) hybrid qubit-qumode units of information. All circuits are designed to be both compact and physically motivated, with a central element being the development of spin-adapted electron-photon entangling fragment circuits tailored to the native capabilities of each platform. Integrating the different Ans\"atze within the state-averaged VQE, we numerically benchmark the three strategies on a cavity-embedded ${\mathrm{H}}_{2}$ molecule using state-vector simulations. Our results show that each proposed Ansatz achieves high accuracy in encoding the ground, first, and second polaritonic eigenstates of the system, even reproducing characteristic light-matter phenomena such as light-induced avoided crossings and conical intersections. This prospective work, beyond introducing multiple computational strategies adapted to different platforms, also highlights the potential of higher-dimensional quantum architectures to address hybrid fermion-boson systems.

arXiv:2506.12504•Physical Review A•Nov 18, 2025•2 citations

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

Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model

Antonios M. Alvertis, Abid Khan, Thomas Iadecola +2 more

Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.

arXiv:2408.00836•Quantum•May 20, 2025•4 citations

A non-orthogonal variational quantum eigensolver

William J. Huggins, Joonho Lee, Unpil Baek +2 more

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the π -system of hexatriene (C 6 H 8 ).

arXiv:1909.09114•New Journal of Physics•Apr 3, 2020•148 citations

A non-orthogonal variational quantum eigensolver

Huggins, WJ, Lee, J, Baek, U +2 more

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

•Jul 1, 2020•128 citations

Specialising neural-network quantum states for the Bose Hubbard model

Michael Y. Pei, Stephen R. L. Clark

Abstract Projected variational wavefunctions such as the Gutzwiller, many-body correlator and Jastrow ansatzes have provided crucial insight into the nature of superfluid-Mott insulator transition in the Bose Hubbard model (BHM) in two or more spatial dimensions. However, these ansatzes have no obvious tractable and systematic way of being improved. A promising alternative is to use Neural-network quantum states (NQS) based on Restricted Boltzmann Machines (RBMs). With binary visible and hidden units NQS have proven to be a highly effective at describing quantum states of interacting spin- 1 2 lattice systems. The application of NQS to bosonic systems has so far been based on one-hot encoding from machine learning where the multi-valued site occupation is distributed across several binary-valued visible units of an RBM. Compared to spin- 1 2 systems one-hot encoding greatly increases the number of variational parameters whilst also making their physical interpretation opaque. Here we revisit the construction of NQS for bosonic systems by reformulating a one-hot encoded RBM into a correlation operator applied to a reference state, analogous to the structure of the projected variational ansatzes. In this form we then propose a number of specialisations of the RBM motivated by the physics of the BHM and the ability to capture exactly the projected variational ansatzes. We analyse in detail the variational performance of these new RBM variants for a 10 × 10 BHM, using both a standard Bose condensate state and a pre-optimised Jastrow + many-body correlator state as the reference state of the calculation. Several of our new ansatzes give robust results as nearly good as one-hot encoding across the regimes of the BHM, but at a substantially reduced cost. Such specialised NQS are thus primed tackle bosonic lattice problems beyond the accuracy of classic variational wavefunctions.

arXiv:2402.15424•Journal of Physics B Atomic Molecular and Optical Physics•Sep 23, 2024•5 citations
Variational quantum algorithms (VQA) are considered as some of the most promising methods to determine the properties of complex strongly correlated quantum many-body systems, especially from the perspective of devices available in the near term. In this context, the development of efficient quantum circuit ansatze to encode a many-body wavefunction is one of the keys for the success of a VQA. Great efforts have been invested to study the potential of current quantum devices to encode the eigenstates of fermionic systems, but little is known about the encoding of bosonic systems. In this work, we investigate the encoding of the ground state of the (simple but rich) attractive Bose-Hubbard model using a Continuous-Variable (CV) photonic-based quantum circuit. We introduce two different ansatz architectures and demonstrate that the proposed continuous variable quantum circuits can efficiently encode (with a fidelity higher than 99%) the strongly correlated many-boson wavefunction with just a few layers, in all many-body regimes and for different number of bosons and initial states. Beyond the study of the suitability of the ansatz to approximate the ground states of many-boson systems, we also perform initial evaluations of the use of the ansatz in a variational quantum eigensolver algorithm to find it through energy minimization. To this end we also introduce a scheme to measure the Hamiltonian energy in an experimental system, and study the effect of sampling noise.
In the field of ab initio polaritonic chemistry, the use of quantum computers may offer, in the long term, a promising computational pathway for simulating and exploring novel cavity-induced light-matter phenomena. Addressing such problems on emerging platforms, however, already presents significant challenges that need to be considered for near-term applications. Within the framework of the variational quantum eigensolver (VQE), a key question concerns the development of quantum circuit Ans\"atze capable of encoding strongly correlated electron-photon states at a reasonable resource cost. Motivated by this question, in this work we develop different Ansatz strategies covering not only conventional qubit-based approaches but also higher-dimensional information units. Specifically, we introduce a set of circuits tailored to three different quantum computing architectures: (i) qubits, (ii) qudits, and (iii) hybrid qubit-qumode units of information. All circuits are designed to be both compact and physically motivated, with a central element being the development of spin-adapted electron-photon entangling fragment circuits tailored to the native capabilities of each platform. Integrating the different Ans\"atze within the state-averaged VQE, we numerically benchmark the three strategies on a cavity-embedded H2{\mathrm{H}}_{2}H2​ molecule using state-vector simulations. Our results show that each proposed Ansatz achieves high accuracy in encoding the ground, first, and second polaritonic eigenstates of the system, even reproducing characteristic light-matter phenomena such as light-induced avoided crossings and conical intersections. This prospective work, beyond introducing multiple computational strategies adapted to different platforms, also highlights the potential of higher-dimensional quantum architectures to address hybrid fermion-boson systems.
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.
Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the π -system of hexatriene (C 6 H 8 ).
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).
Abstract Projected variational wavefunctions such as the Gutzwiller, many-body correlator and Jastrow ansatzes have provided crucial insight into the nature of superfluid-Mott insulator transition in the Bose Hubbard model (BHM) in two or more spatial dimensions. However, these ansatzes have no obvious tractable and systematic way of being improved. A promising alternative is to use Neural-network quantum states (NQS) based on Restricted Boltzmann Machines (RBMs). With binary visible and hidden units NQS have proven to be a highly effective at describing quantum states of interacting spin- 1 2 lattice systems. The application of NQS to bosonic systems has so far been based on one-hot encoding from machine learning where the multi-valued site occupation is distributed across several binary-valued visible units of an RBM. Compared to spin- 1 2 systems one-hot encoding greatly increases the number of variational parameters whilst also making their physical interpretation opaque. Here we revisit the construction of NQS for bosonic systems by reformulating a one-hot encoded RBM into a correlation operator applied to a reference state, analogous to the structure of the projected variational ansatzes. In this form we then propose a number of specialisations of the RBM motivated by the physics of the BHM and the ability to capture exactly the projected variational ansatzes. We analyse in detail the variational performance of these new RBM variants for a 10 × 10 BHM, using both a standard Bose condensate state and a pre-optimised Jastrow + many-body correlator state as the reference state of the calculation. Several of our new ansatzes give robust results as nearly good as one-hot encoding across the regimes of the BHM, but at a substantially reduced cost. Such specialised NQS are thus primed tackle bosonic lattice problems beyond the accuracy of classic variational wavefunctions.