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

Solving Many-Body Problems on Quantum Computers

Fauseweh, Benedikt

Published Jan 1, 2025• 0 citations
OpenAlex

Related papers

Simulations of Many-Body Quantum Systems by a Quantum Computer

Stephen J. Wiesner

We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer.

arXiv:quant-ph/9603028•Mar 26, 1996•237 citations

Quantum Many-Body Problems

David M. Ceperley, Malvin H. Kalos

Topics in current physics•Jan 1, 1979•65 citations

Quantum problem solving as simultaneous computation

Giuseppe Castagnoli

I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem under the simultaneous influence of all the problem constraints. This requires a perfectly accurate, rigid, and reversible relation between the coordinates of the machine parts - the machine can be considered the many body generalization of another perfect machine, the bounching ball model of reversible computation. The mathematical description of the machine, as it is, is applicable to quantum problem solving, an extension of the quantum algorithms that comprises the physical representation of the problem-solution interdependence. The perfect relation between the coordinates of the machine parts is transferred to the populations of the reduced density operators of the parts of the computer register. The solution of the problem is reversibly and nondeterministically produced under the simultaneous influence of the state before measurement and the quantum principle. At the light of the present notion of simultaneous computation, the quantum speed up turns out to be "precognition" of the solution, namely the reduction of the initial ignorance of the solution due to backdating, to before running the algorithm, a time-symmetric part of the state vector reduction on the solution; as such, it is bounded by state vector reduction through an entropic inequality. PACS numbers: 03.67.Lx, 01.55.+b, 01.70.+w

arXiv:0710.1744•Oct 9, 2007•2 citations

Quantum Many-Body Problems

David M. Ceperley, Malvin H. Kalos

Topics in current physics•Jan 1, 1986•46 citations

Machine learning on quantum experimental data toward solving quantum many-body problems

Gyungmin Cho, Dohun Kim

Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been only realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of theoretically suggested classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data. Classical machine learning methods trained on quantum simulation data can efficiently solve quantum many-body problems, but this has been mostly shown for numerically generated data. Here the authors successfully apply such methods to data acquired on a superconducting quantum processor with error mitigation.

arXiv:2310.19416•Nature Communications•Aug 30, 2024•29 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•71 citations
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem under the simultaneous influence of all the problem constraints. This requires a perfectly accurate, rigid, and reversible relation between the coordinates of the machine parts - the machine can be considered the many body generalization of another perfect machine, the bounching ball model of reversible computation. The mathematical description of the machine, as it is, is applicable to quantum problem solving, an extension of the quantum algorithms that comprises the physical representation of the problem-solution interdependence. The perfect relation between the coordinates of the machine parts is transferred to the populations of the reduced density operators of the parts of the computer register. The solution of the problem is reversibly and nondeterministically produced under the simultaneous influence of the state before measurement and the quantum principle. At the light of the present notion of simultaneous computation, the quantum speed up turns out to be "precognition" of the solution, namely the reduction of the initial ignorance of the solution due to backdating, to before running the algorithm, a time-symmetric part of the state vector reduction on the solution; as such, it is bounded by state vector reduction through an entropic inequality. PACS numbers: 03.67.Lx, 01.55.+b, 01.70.+w
Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been only realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of theoretically suggested classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data. Classical machine learning methods trained on quantum simulation data can efficiently solve quantum many-body problems, but this has been mostly shown for numerically generated data. Here the authors successfully apply such methods to data acquired on a superconducting quantum processor with error mitigation.