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

Zhongguo kexue. Wulixue Lixue Tianwenxue

Efficient solving of interacting many-body problems and its applications in condensed matter science and cosmological simulations

XinGuo REN, Xiaohui Liu, Minye Zhang, Haobo Chen, Huanjing Gong, Zicun Li, Qi Zhang, Pengyu Yang, Haijun Liao, RuiJuan XIAO, Junshi Chen, Lei Wang, Qiao Wang, Lixin He

Published Aug 1, 2026• 0 citations
Publisher
DOI
10.1360/sspma-2026-0481

Related papers

Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions

Jorge Casanova, Antonio Mezzacapo, Lucas Lamata +1 more

We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of fermionic operators onto nonlocal spin operators and decompose the resulting dynamics in efficient steps with Trotter methods, yielding an overall protocol that employs only polynomial resources. The proposed scheme can be relevant in a variety of fields such as condensed-matter or high-energy physics, where quantum simulations may solve problems intractable for classical computers.

arXiv:1110.3730•Physical Review Letters•May 10, 2012•118 citations

An Approximate Method for Solving the Quantum Many-Body Problem

CRC Press eBooks•May 21, 2004•19 citations

Model-Space Effective Interactions in Many-Body Problems

T.T.S. Kuo

Chinese Journal of Physics•Oct 1, 1994•0 citations

Quantum Computing and Simulation of Many-Body Systems

Dr.Prakash Dubey

Quantum computing introduces a revolutionary approach to solving problems that are computationally beyond the reach of classical systems. Among its most promising applications is the simulation of many-body systems, where strong particle interactions lead to complex quantum behaviors. Traditional computational techniques often fail due to exponential resource requirements, but quantum simulators can efficiently model these interactions through entanglement and superposition. Recent advances in superconducting qubits, trapped ions, and photonic quantum devices have enabled small- scale experimental demonstrations of spin models, Hubbard systems, and correlated electron dynamics. These developments offer new insights into condensed matter physics and quantum phase transitions. As quantum technologies continue to evolve, they hold the potential to transform the study of materials, superconductivity, and other many-body phenomena with remarkable precision and scalability.

International Journal on Science and Technology•Feb 10, 2026•0 citations

Contracting projected entangled pair states is average-case hard

Jonas Haferkamp, Dominik Hangleiter, Jens Eisert +1 more

An accurate calculation of the properties of quantum many-body systems is one of the most important yet intricate challenges of modern physics and computer science. In recent years, the tensor network ansatz has established itself as one of the most promising approaches enabling striking efficiency of simulating static properties of one-dimensional systems and abounding numerical applications in condensed matter theory. In higher dimensions, however, a connection to the field of computational complexity theory has shown that the accurate normalization of the two-dimensional tensor networks called projected entangled pair states (PEPS) is #P-complete. Therefore an efficient algorithm for PEPS contraction would allow solving exceedingly difficult combinatorial counting problems, which is considered highly unlikely. Due to the importance of understanding two- and three-dimensional systems the question currently remains: Are the known constructions typical of states relevant for quantum many-body systems? In this work, we show that an accurate evaluation of normalization or expectation values of PEPS is as hard to compute for typical instances as for special configurations of highest computational hardness. We discuss the structural property of average-case hardness in relation to the current research on efficient algorithms attempting tensor network contraction, hinting at a wealth of possible further insights into the average-case hardness of important problems in quantum many-body theory.

•Jan 1, 2020•44 citations

Many-Body Techniques in Condensed Matter Physics

Jaime Merino, A. Levy Yeyati

UNITEXT for physics•Jan 1, 2024•1 citation
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of fermionic operators onto nonlocal spin operators and decompose the resulting dynamics in efficient steps with Trotter methods, yielding an overall protocol that employs only polynomial resources. The proposed scheme can be relevant in a variety of fields such as condensed-matter or high-energy physics, where quantum simulations may solve problems intractable for classical computers.
Quantum computing introduces a revolutionary approach to solving problems that are computationally beyond the reach of classical systems. Among its most promising applications is the simulation of many-body systems, where strong particle interactions lead to complex quantum behaviors. Traditional computational techniques often fail due to exponential resource requirements, but quantum simulators can efficiently model these interactions through entanglement and superposition. Recent advances in superconducting qubits, trapped ions, and photonic quantum devices have enabled small- scale experimental demonstrations of spin models, Hubbard systems, and correlated electron dynamics. These developments offer new insights into condensed matter physics and quantum phase transitions. As quantum technologies continue to evolve, they hold the potential to transform the study of materials, superconductivity, and other many-body phenomena with remarkable precision and scalability.
An accurate calculation of the properties of quantum many-body systems is one of the most important yet intricate challenges of modern physics and computer science. In recent years, the tensor network ansatz has established itself as one of the most promising approaches enabling striking efficiency of simulating static properties of one-dimensional systems and abounding numerical applications in condensed matter theory. In higher dimensions, however, a connection to the field of computational complexity theory has shown that the accurate normalization of the two-dimensional tensor networks called projected entangled pair states (PEPS) is #P-complete. Therefore an efficient algorithm for PEPS contraction would allow solving exceedingly difficult combinatorial counting problems, which is considered highly unlikely. Due to the importance of understanding two- and three-dimensional systems the question currently remains: Are the known constructions typical of states relevant for quantum many-body systems? In this work, we show that an accurate evaluation of normalization or expectation values of PEPS is as hard to compute for typical instances as for special configurations of highest computational hardness. We discuss the structural property of average-case hardness in relation to the current research on efficient algorithms attempting tensor network contraction, hinting at a wealth of possible further insights into the average-case hardness of important problems in quantum many-body theory.