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

Quantum algorithms for quantum many-body systems and small quantum computers

Yimin Ge

Published Jan 1, 2020• 4 citations
OpenAlex

Related papers

Quantum many-body physics and quantum computers

T. E. Mehlstäubler, Henning A. Fürst, C. Ospelkaus

Ptb-mitteilungen•Jan 1, 2020•0 citations

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

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

arXiv:1001.0767•Springer eBooks•Jan 1, 2012•23 citations

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

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,⟨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.

EPJ Web of Conferences•Jan 1, 2023•6 citations

Quantum computing with and for many-body physics

Thomas Ayral, Pauline Besserve, Denis Lacroix A +1 more

arXiv:2303.04850•The European Physical Journal A•Oct 13, 2023•50 citations

QUANTUM SIMULATION OF SIMPLE MANY-BODY DYNAMICS

Yale Fan

We describe a general quantum computational algorithm that simulates the time evolution of an arbitrary nonrelativistic, Coulombic many-body system in three dimensions, considering only spatial degrees of freedom. We use a simple discretized model of Schrödinger evolution in the coordinate representation and discuss detailed constructions of the operators necessary to realize the scheme of Wiesner and Zalka. The algorithm is simulated numerically for small test cases, and its outputs are found to be in good agreement with analytical solutions.

arXiv:0901.4163•International Journal of Quantum Information•Aug 1, 2012•6 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, ⟨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 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.
We describe a general quantum computational algorithm that simulates the time evolution of an arbitrary nonrelativistic, Coulombic many-body system in three dimensions, considering only spatial degrees of freedom. We use a simple discretized model of Schrödinger evolution in the coordinate representation and discuss detailed constructions of the operators necessary to realize the scheme of Wiesner and Zalka. The algorithm is simulated numerically for small test cases, and its outputs are found to be in good agreement with analytical solutions.