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/9603028

Simulations of Many-Body Quantum Systems by a Quantum Computer

Stephen J. Wiesner

Published Mar 26, 1996• 127 citations
arXivHTMLPDF

Abstract

We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer.
DOI
10.48550/arxiv.quant-ph/9603028

Related papers

Simulating many-body open quantum systems eases with computational advances

Mara Johnson-Groh

Artificial intelligence and quantum computing are helping overcome bottlenecks in simulating complex quantum systems.

Scilight•Mar 24, 2025•0 citations

Solving Burgers’ equation with quantum computing

Furkan Oz, Rohit K. S. S. Vuppala, Kursat Kara +1 more

Abstract Computational fluid dynamics (CFD) simulations are a vital part of the design process in the aerospace industry. Although reliable CFD results can be obtained with turbulence models, direct numerical simulation of complex bodies in three spatial dimensions (3D) is impracticable due to the massive amount of computational elements. For instance, a 3D direct numerical simulation of a turbulent boundary-layer over the wing of a commercial jetliner that resolves all relevant length scales using a serial CFD solver on a modern digital computer would take approximately 750 million years or roughly 20% of the earth’s age. Over the past 25 years, quantum computers have become the object of great interest worldwide as powerful quantum algorithms have been constructed for several important, computationally challenging problems that provide enormous speed-up over the best-known classical algorithms. In this paper, we adapt a recently introduced quantum algorithm for partial differential equations to Burgers’ equation and develop a quantum CFD solver that determines its solutions. We used our quantum CFD solver to verify the quantum Burgers’ equation algorithm to find the flow solution when a shockwave is and is not present. The quantum simulation results were compared to: (i) an exact analytical solution for a flow without a shockwave; and (ii) the results of a classical CFD solver for flows with and without a shockwave. Excellent agreement was found in both cases, and the error of the quantum CFD solver was comparable to that of the classical CFD solver.

Quantum Information Processing•Dec 31, 2021•55 citations

Hybrid Quantum Algorithms for N-Body Simulations

S. Rajasekaran, P. Agrawal, R. Lagasse +2 more

N-body simulations is a fundamental problem in molecular dynamics. For example, N-body simulations can be employed to study powder flow. It is worth noting that powder or granular materials are the second ubiquitous substance in the industry after water. Numerous sequential and parallel algorithms have been proposed in the literature for N-body simulations on classical computers. Given a set of n particles in a d-dimensional space, a brute force algorithm will take Ω(n2d) time to simulate each step of this system of particles. Numerous algorithms in the literature perform better than this under some suitable assumptions. Given the potential speedups offered by quantum computing, an interesting open problem is to investigate how much speedups can be obtained for N-body simulations using quantum computers. In this paper we present efficient algorithms that run on quantum-classical hybrid models of computing. Specifically, our algorithms solve the problem of finding close neighbors using a quantum computer and the other steps on a Parallel Random Access Machine (PRAM). Our quantum algorithms outperform other algorithms in the literature asymptotically as well as on empirical evaluations.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•0 citations

Simulating quantum many-body physics on quantum and classical computers

Jason Saroni

•Jan 1, 2025•0 citations

Progress in Superconducting Quantum Computation: Quantum Simulation of Dynamical Phase Transitions

Heng Fan

Quantum simulation uses a controllable quantum system to mimic complex systems or solve intractable problems,among which the non-equilibrium problems of quantum many-body systems have attracted wide research interest since they are hard to simulate using classical computers.Instead,popular quantum simulators,such as superconducting circuits,can provide insights into these problems.

中国科学院院刊：英文版•Jan 1, 2020•0 citations

Many-body quantum mechanics

Michael L. Wall, Arghavan Safavi-Naini, Martin Gärttner

Special purpose quantum computers---realized with current technology---have the potential to revolutionize physics, chemistry, and materials science.

XRDS Crossroads The ACM Magazine for Students•Sep 20, 2016•3 citations
Abstract Computational fluid dynamics (CFD) simulations are a vital part of the design process in the aerospace industry. Although reliable CFD results can be obtained with turbulence models, direct numerical simulation of complex bodies in three spatial dimensions (3D) is impracticable due to the massive amount of computational elements. For instance, a 3D direct numerical simulation of a turbulent boundary-layer over the wing of a commercial jetliner that resolves all relevant length scales using a serial CFD solver on a modern digital computer would take approximately 750 million years or roughly 20% of the earth’s age. Over the past 25 years, quantum computers have become the object of great interest worldwide as powerful quantum algorithms have been constructed for several important, computationally challenging problems that provide enormous speed-up over the best-known classical algorithms. In this paper, we adapt a recently introduced quantum algorithm for partial differential equations to Burgers’ equation and develop a quantum CFD solver that determines its solutions. We used our quantum CFD solver to verify the quantum Burgers’ equation algorithm to find the flow solution when a shockwave is and is not present. The quantum simulation results were compared to: (i) an exact analytical solution for a flow without a shockwave; and (ii) the results of a classical CFD solver for flows with and without a shockwave. Excellent agreement was found in both cases, and the error of the quantum CFD solver was comparable to that of the classical CFD solver.
N-body simulations is a fundamental problem in molecular dynamics. For example, N-body simulations can be employed to study powder flow. It is worth noting that powder or granular materials are the second ubiquitous substance in the industry after water. Numerous sequential and parallel algorithms have been proposed in the literature for N-body simulations on classical computers. Given a set of n particles in a d-dimensional space, a brute force algorithm will take Ω(n2d) time to simulate each step of this system of particles. Numerous algorithms in the literature perform better than this under some suitable assumptions. Given the potential speedups offered by quantum computing, an interesting open problem is to investigate how much speedups can be obtained for N-body simulations using quantum computers. In this paper we present efficient algorithms that run on quantum-classical hybrid models of computing. Specifically, our algorithms solve the problem of finding close neighbors using a quantum computer and the other steps on a Parallel Random Access Machine (PRAM). Our quantum algorithms outperform other algorithms in the literature asymptotically as well as on empirical evaluations.