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

arXiv:quant-ph/9603026 · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences

Simulating quantum systems on a quantum computer

Christof Zalka

Published Jan 8, 1998• 423 citations
arXivHTMLPDF

Abstract

We show that the time evolution of the wave function of a quantum–mechanical many–particle system can be simulated precisely and efficiently on a quantum computer. The time needed for such a simulation is comparable to the time of a conventional simulation of the corresponding classical system, a performance which can't be expected from any classical simulation of a quantum system. We then show how quantities of interest, like the energy spectrum of a system, can be obtained. We also indicate that ultimately the simulation of quantum field theory might be possible on large quantum computers.

DOI
10.1098/rspa.1998.0162

Related papers

Efficient Simulation of Quantum Systems by Quantum Computers

Christof Zalka

We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a conventional simulation of the corresponding classical system. Ultimately the simulation of quantum field theory might be possible on large quantum computers.

Fortschritte der Physik•Nov 1, 1998•121 citations

Quantum Algorithms for Quantum Field Theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Quantum Leap? Quantum computers are expected to be able to solve some of the most difficult problems in mathematics and physics. It is not known, however, whether quantum field theories (QFTs) can be simulated efficiently with a quantum computer. QFTs are used in particle and condensed matter physics and have an infinite number of degrees of freedom; discretization is necessary to simulate them digitally. Jordan et al. (p. 1130 ; see the Perspective by Hauke et al. ) present an algorithm for the efficient simulation of a particular kind of QFT (with quartic interactions) and estimate the error caused by discretization. Even for the most difficult case of strong interactions, the run time of the algorithm was polynomial (rather than exponential) in parameters such as the number of particles, their energy, and the prescribed precision, making it much more efficient than the best classical algorithms.

arXiv:1111.3633•Science•May 31, 2012•610 citations

Classical Simulation of Quantum Systems

Maarten Van den Nest, Frank Verstraete

The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.

•Jan 1, 2016•0 citations

Simulation of quantum many body systems

Maarten Van den Nest, Frank Verstraete

The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.

•Jul 20, 2010•0 citations

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Ryan Babbush, William J. Huggins, Dominic William Berry +6 more

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree-Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

arXiv:2301.01203•Nature Communications•Jul 10, 2023•46 citations

Quantum Computing Through Multi-Scale Modeling and Simulation

Jincheng Zhang

This paper presents a novel approach to quantum computing leveraging multi-scale modeling and simulation. The core claim is to develop a method capable of simultaneously simulating quantum systems at both microscopic and macroscopic levels, thereby enhancing the precision and efficiency of quantum computations. This is achieved through the construction of a multi-scale model integrating quantum mechanics and classical mechanics, coupled with advanced numerical simulation techniques. The proposed framework addresses the limitations of current quantum simulation methods by offering a more holistic representation of quantum systems. This allows for a deeper understanding of quantum phenomena and ultimately contributes to the advancement of quantum computing technologies. The key mathematical components utilized within this framework include the Schrödinger equation, perturbation theory, and various numerical integration schemes. Specifically, the time evolution of a quantum state is governed by the equation: (iħ ∂/∂t) |ψ(t)> = H |ψ(t)> where |ψ(t)> is the quantum state at time *t*, *ħ* is the reduced Planck constant, and *H* is the Hamiltonian operator. Perturbation theory, used to approximate the solution when the Hamiltonian is not solvable exactly, relies on the expansion: |ψperturbed>(t) = |ψunperturbed>(t) + ∑n=1∞ (-1)n+1 *An* |ψn>(t) where *An* are the perturbation coefficients. Numerical integration techniques, such as the Runge-Kutta method, are employed to approximate the time evolution operator. The accuracy of the simulation is critically dependent on the chosen time step, Δt, and the order of the integration method. A smaller Δt generally leads to higher accuracy but requires more computational resources. The overall approach seeks to bridge the gap between theoretical quantum mechanics and practical quantum computation, offering a viable path towards building more sophisticated and reliable quantum computers.

•Sep 5, 2026•0 citations
We show that the time evolution of the wave function of a quantum–mechanical many–particle system can be simulated precisely and efficiently on a quantum computer. The time needed for such a simulation is comparable to the time of a conventional simulation of the corresponding classical system, a performance which can't be expected from any classical simulation of a quantum system. We then show how quantities of interest, like the energy spectrum of a system, can be obtained. We also indicate that ultimately the simulation of quantum field theory might be possible on large quantum computers.
Quantum Leap? Quantum computers are expected to be able to solve some of the most difficult problems in mathematics and physics. It is not known, however, whether quantum field theories (QFTs) can be simulated efficiently with a quantum computer. QFTs are used in particle and condensed matter physics and have an infinite number of degrees of freedom; discretization is necessary to simulate them digitally. Jordan et al. (p. 1130 ; see the Perspective by Hauke et al. ) present an algorithm for the efficient simulation of a particular kind of QFT (with quartic interactions) and estimate the error caused by discretization. Even for the most difficult case of strong interactions, the run time of the algorithm was polynomial (rather than exponential) in parameters such as the number of particles, their energy, and the prescribed precision, making it much more efficient than the best classical algorithms.
The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.
The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree-Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.
This paper presents a novel approach to quantum computing leveraging multi-scale modeling and simulation. The core claim is to develop a method capable of simultaneously simulating quantum systems at both microscopic and macroscopic levels, thereby enhancing the precision and efficiency of quantum computations. This is achieved through the construction of a multi-scale model integrating quantum mechanics and classical mechanics, coupled with advanced numerical simulation techniques. The proposed framework addresses the limitations of current quantum simulation methods by offering a more holistic representation of quantum systems. This allows for a deeper understanding of quantum phenomena and ultimately contributes to the advancement of quantum computing technologies. The key mathematical components utilized within this framework include the Schrödinger equation, perturbation theory, and various numerical integration schemes. Specifically, the time evolution of a quantum state is governed by the equation: (iħ ∂/∂t) |ψ(t)> = H |ψ(t)> where |ψ(t)> is the quantum state at time *t*, *ħ* is the reduced Planck constant, and *H* is the Hamiltonian operator. Perturbation theory, used to approximate the solution when the Hamiltonian is not solvable exactly, relies on the expansion: |ψperturbed>(t) = |ψunperturbed>(t) + ∑n=1∞ (-1)n+1 *An* |ψn>(t) where *An* are the perturbation coefficients. Numerical integration techniques, such as the Runge-Kutta method, are employed to approximate the time evolution operator. The accuracy of the simulation is critically dependent on the chosen time step, Δt, and the order of the integration method. A smaller Δt generally leads to higher accuracy but requires more computational resources. The overall approach seeks to bridge the gap between theoretical quantum mechanics and practical quantum computation, offering a viable path towards building more sophisticated and reliable quantum computers.