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

Simulating Quantum Mechanics on a Quantum Computer

Bruce M. Boghosian, Washington Taylor

Published Jan 15, 1997• 98 citations
OpenAlex

Abstract

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac and gauge particles are discussed.

Related papers

Simulating quantum mechanics on a quantum computer

Bruce M. Boghosian, Washington Taylor

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.

arXiv:quant-ph/9701019•Physica D Nonlinear Phenomena•Sep 1, 1998•120 citations

Quantum Simulations

Antti Regelin

Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator $\hat{H}$, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.

•Sep 9, 2026•0 citations

A Quantum Algorithm for Molecular Dynamics Simulation

Yale Fan

Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. One of the central unresolved problems in developing quantum simulation algorithms has been constructing the necessary time evolution operators in enough detail for implementation in a quantum computer. This work presents a complete and very general solution to this problem: namely, a quantum computational algorithm for simulating an arbitrary Coulombic many-body system acting under the three-dimensional Schrödinger equation. We use the simplest discretized model and discuss detailed constructions of the operators involved. The algorithm is also implemented in MAT-LAB and tested against both analytical solutions and classical methods. Our algorithm can determine an arbitrary system’s dynamics rather than merely associated constants, as investigated in previous literature. It can hence be adapted for electronic structure calculations, chemical reaction simulations, etc. 1

•Jan 27, 2009•2 citations

Quantum Lattice-Gas Models for the Many-Body Schrödinger Equation

Bruce M. Boghosian, Washington Taylor

A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrödinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an exponential speedup over analogous simulations on classical computers. On a classical computer, these models give an explicitly unitary and local prescription for discretizing the Schrödinger equation. It is shown that models of this type can be constructed for an arbitrary number of particles moving in an arbitrary number of dimensions with an arbitrary interparticle interaction.

arXiv:quant-ph/9701016•International Journal of Modern Physics C•Aug 1, 1997•39 citations

Quantum Lattice-Gas Models for the Many-Body Schrödinger Equation

Bruce M. Boghosian, Washington Taylor

A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrodinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an exponential speedup over analogous simulations on classical computers. On a classical computer, these models give an explicitly unitary and local prescription for discretizing the Schrodinger equation. It is shown that models of this type can be constructed for an arbitrary number of particles moving in an arbitrary number of dimensions with an arbitrary interparticle interaction.

•Jan 14, 1997•31 citations

Relativistic quantum chemistry on quantum computers

Libor Veis, Jakub Višňák, Timo Fleig +4 more

The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, proof-of-principle experimental realizations have been reported. However, so far only the nonrelativistic regime (i.e., the Schr\"odinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. We present a quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with three qubits and nine or ten controlled-not (cnot) gates, which implement a proof-of-principle relativistic quantum chemical calculation for this molecule and might be suitable for an experimental realization.

arXiv:1111.3490•Physical Review A•Mar 23, 2012•36 citations
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac and gauge particles are discussed.
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.
Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator H^\hat{H}H^, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. One of the central unresolved problems in developing quantum simulation algorithms has been constructing the necessary time evolution operators in enough detail for implementation in a quantum computer. This work presents a complete and very general solution to this problem: namely, a quantum computational algorithm for simulating an arbitrary Coulombic many-body system acting under the three-dimensional Schrödinger equation. We use the simplest discretized model and discuss detailed constructions of the operators involved. The algorithm is also implemented in MAT-LAB and tested against both analytical solutions and classical methods. Our algorithm can determine an arbitrary system’s dynamics rather than merely associated constants, as investigated in previous literature. It can hence be adapted for electronic structure calculations, chemical reaction simulations, etc. 1
A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrödinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an exponential speedup over analogous simulations on classical computers. On a classical computer, these models give an explicitly unitary and local prescription for discretizing the Schrödinger equation. It is shown that models of this type can be constructed for an arbitrary number of particles moving in an arbitrary number of dimensions with an arbitrary interparticle interaction.
A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrodinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an exponential speedup over analogous simulations on classical computers. On a classical computer, these models give an explicitly unitary and local prescription for discretizing the Schrodinger equation. It is shown that models of this type can be constructed for an arbitrary number of particles moving in an arbitrary number of dimensions with an arbitrary interparticle interaction.
The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, proof-of-principle experimental realizations have been reported. However, so far only the nonrelativistic regime (i.e., the Schr\"odinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. We present a quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with three qubits and nine or ten controlled-not (cnot) gates, which implement a proof-of-principle relativistic quantum chemical calculation for this molecule and might be suitable for an experimental realization.