Variance minimisation on a quantum computer for nuclear structure
Isaac Hobday, Paul Stevenson, James Benstead

TL;DR
This paper introduces a variance minimization algorithm using a variational quantum eigensolver to determine nuclear excitation spectra on quantum computers, demonstrated with a Lipkin-Meshkov-Glick model.
Contribution
It develops a variance-based VQE method with reduced-qubit encoding for nuclear structure calculations on quantum computers, enabling excited state spectrum determination.
Findings
Successfully applied to Lipkin-Meshkov-Glick model
Demonstrated feasibility on limited-qubit quantum hardware
Provided a new approach for nuclear excitation spectra
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum chaos and dynamical systems
