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

EPJ Web of Conferences

Variance minimisation on a quantum computer of the Lipkin-Meshkov-Glick model with three particles

Isaac Hobday, P. D. Stevenson, James Benstead

Published Jan 1, 2023• 6 citations
Publisher

Abstract

Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today’s quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian,⟨H⟩2 − ⟨H⟩2, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.

DOI
10.1051/epjconf/202328416002

Related papers

Variance minimisation on a quantum computer for nuclear structure

Isaac Hobday, P. D. Stevenson, James Benstead

Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today's quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian, $\langle H^2\rangle - \langle H\rangle ^2$, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.

arXiv:2209.07820•Sep 16, 2022•1 citation

Variance Minimisation of the Lipkin-Meshkov-Glick Model on a Quantum Computer

Isaac Hobday, P. D. Stevenson, James Benstead

Quantum computing can potentially provide advantages for specific computational tasks. The simulation of fermionic systems is one such task that lends itself well to quantum computation, with applications in nuclear physics and electronic systems. Here we present work in which we use a variance minimisation method to find the full spectrum of energy eigenvalues of the Lipkin-Meshkov-Glick model; an exactly-solvable nuclear shell model-type system. We perform these calculations using both quantum simulators and real quantum hardware accessed via IBM cloud-based quantum computers. Using these IBM quantum computers we are able to obtain all eigenvalues for the cases of three and seven fermions (nucleons) in the Lipkin-Meshkov-Glick model.

arXiv:2403.08625•Mar 13, 2024•0 citations

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Caroline Robin, Martin J. Savage A

Background: Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly interacting many-body systems relevant to nuclear physics is, however, inefficient, even using ideal quantum computers. In addition, currently available noisy intermediate-scale quantum (NISQ) era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the noncommutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations.Purpose: The goal of the present study is to explore and utilize the noncommutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning.Method: We introduce an iterative hybrid classical-quantum algorithm, the Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wave function. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\mathrm{logarithm}$ of the size of the effective model space, rather than the particle number.Results: HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wave function, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cutoff as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for one- and two-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions.Conclusions: For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other nonperturbative EFTs.

arXiv:2301.05976•Physical Review C•Aug 18, 2023•39 citations

Lipkin model on a quantum computer

Michael J. Cervia, A. B. Balantekin, S. N. Coppersmith +5 more

Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. We present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.

arXiv:2011.04097•Physical Review C•Aug 3, 2021•62 citations

Quantum computing calculations for nuclear structure and nuclear data

Isaac Hobday, P. D. Stevenson, James Benstead

Calculations of nuclear properties and nuclear models are performed using quantum computing algorithms on simulated and real quantum computers. The models are a realistic calculation of deuteron binding based on effective field theory, and a simplified two-level version of the nuclear shell model. A method of reducing the number of qubits needed for practical calculation is presented, the reduction being with respect to that used when the standard Jordan-Wigner encoding is used. Its efficacy is shown in the case of the deuteron binding and shell model. A version of the variational quantum eigensolver in which all eigenstates in a spectrum are targeted on an equal basis is shown. The method involves finding the minima of the variance of the Hamiltonian, and its ability to find the full spectrum of small version of the simplified shell model is presented.

arXiv:2205.05576•SPIE Quantum Technologies•May 6, 2022•5 citations

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

Ravikumar Chinnarasu, C. Poole, Linipun Phuttitarn +5 more

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

arXiv:2501.06097•PRX Quantum•Jun 12, 2025•11 citations
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today’s quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian,⟨H⟩2 − ⟨H⟩2, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today's quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian, ⟨H2⟩−⟨H⟩2\langle H^2\rangle - \langle H\rangle ^2⟨H2⟩−⟨H⟩2, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.
Quantum computing can potentially provide advantages for specific computational tasks. The simulation of fermionic systems is one such task that lends itself well to quantum computation, with applications in nuclear physics and electronic systems. Here we present work in which we use a variance minimisation method to find the full spectrum of energy eigenvalues of the Lipkin-Meshkov-Glick model; an exactly-solvable nuclear shell model-type system. We perform these calculations using both quantum simulators and real quantum hardware accessed via IBM cloud-based quantum computers. Using these IBM quantum computers we are able to obtain all eigenvalues for the cases of three and seven fermions (nucleons) in the Lipkin-Meshkov-Glick model.
Background: Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly interacting many-body systems relevant to nuclear physics is, however, inefficient, even using ideal quantum computers. In addition, currently available noisy intermediate-scale quantum (NISQ) era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the noncommutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations.Purpose: The goal of the present study is to explore and utilize the noncommutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning.Method: We introduce an iterative hybrid classical-quantum algorithm, the Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wave function. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the logarithm\mathrm{logarithm}logarithm of the size of the effective model space, rather than the particle number.Results: HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wave function, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cutoff as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for one- and two-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions.Conclusions: For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other nonperturbative EFTs.
Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. We present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.
Calculations of nuclear properties and nuclear models are performed using quantum computing algorithms on simulated and real quantum computers. The models are a realistic calculation of deuteron binding based on effective field theory, and a simplified two-level version of the nuclear shell model. A method of reducing the number of qubits needed for practical calculation is presented, the reduction being with respect to that used when the standard Jordan-Wigner encoding is used. Its efficacy is shown in the case of the deuteron binding and shell model. A version of the variational quantum eigensolver in which all eigenstates in a spectrum are targeted on an equal basis is shown. The method involves finding the minima of the variance of the Hamiltonian, and its ability to find the full spectrum of small version of the simplified shell model is presented.
We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.