Variance minimisation on a quantum computer for nuclear structure
- URL: http://arxiv.org/abs/2209.07820v1
- Date: Fri, 16 Sep 2022 09:38:07 GMT
- Title: Variance minimisation on a quantum computer for nuclear structure
- Authors: Isaac Hobday, Paul Stevenson, James Benstead
- Abstract summary: We present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer.
Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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, $\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.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation.
We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture.
We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
arXiv Detail & Related papers (2024-05-31T16:43:20Z) - Polynomial-time classical sampling of high-temperature quantum Gibbs
states [0.22843885788439797]
computational complexity of simulating quantum many-body systems scales exponentially with the number of particles.
We present a classical algorithm that discovering samples from a high-temperature quantum Gibbs state in a computational (product) basis.
Our result implies that measurement-based quantum computation on a Gibbs state can provide exponential speed up only at sufficiently low temperature.
arXiv Detail & Related papers (2023-05-29T18:00:00Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Quantum Simulation of Hawking Radiation Using VQE Algorithm on IBM
Quantum Computer [0.0]
We use variational quantum eigensolver (VQE) algorithm to simulate Hawking radiation phenomenon.
Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied.
arXiv Detail & Related papers (2021-12-31T15:03:17Z) - Variational quantum algorithm based on the minimum potential energy for
solving the Poisson equation [7.620967781722716]
We present a variational quantum algorithm for solving the Poisson equation.
The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian.
Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
arXiv Detail & Related papers (2021-06-17T09:01:53Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Inverse iteration quantum eigensolvers assisted with a continuous
variable [0.0]
We propose inverse iteration quantum eigensolvers, which exploit the power of quantum computing for the classical inverse power iteration method.
A key ingredient is constructing an inverse Hamiltonian as a linear combination of coherent Hamiltonian evolution.
We demonstrate the quantum algorithm with numerical simulations under finite squeezing for various physical systems.
arXiv Detail & Related papers (2020-10-07T07:31:11Z) - Simulating quantum chemistry in the seniority-zero space on qubit-based
quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers.
We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.