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

Bulletin of the American Physical Society

Optimal quantum algorithms to simulate strongly correlated fermionic systems

Jiang Zhang, Kevin J. Sung, Kostyantyn Kechedzhi, Vadim Smelyanskiy, Sergio Boixo

Published Mar 7, 2018• 0 citations
OpenAlex

Related papers

Quantum Algorithms to Simulate Many-Body Physics of Correlated Fermions

Zhang Jiang, Kevin J. Sung, Kostyantyn Kechedzhi +2 more

Physical systems with strongly correlated electrons (fermions) are notoriously difficult to study using traditional computers. Meanwhile, as programmable $q\phantom{\rule{0}{0ex}}u\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}u\phantom{\rule{0}{0ex}}m$ computers become a reality, efficient (and preferably general) quantum algorithms are needed, in the face of limited qubit-qubit connectivity in the near term. Addressing both problems, the authors develop quantum algorithms that run on two-dimensional qubit lattices with nearest-neighbor interactions, to simulate strongly correlated fermions. Their approach avoids the parity problem in mapping fermionic operators to qubit operators, with hardly any overhead, and can be used for a whole class of problems.

arXiv:1711.05395•Physical Review Applied•Apr 26, 2018•175 citations

Simulating strongly interacting fermionic systems in a quantum computer

Alexandre Choquette, Panagiotis Kl. Barkoutsos, Agustín Di Paolo +4 more

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

Quantum Optimization Algorithms for Strongly Correlated Many-Body Systems

G. E. L. Pexe, L. A. M. Rattighieri, P. M. Prado +2 more

This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era. The simulation of strongly correlated systems is frequently intractable on classical computers due to the exponential growth of the Hilbert space and the fermionic sign problem. In this context, we review and compare the performance of traditional Variational Quantum Algorithms, such as the Variational Quantum Eigensolver and the Quantum Approximate Optimization Algorithm, against emerging heuristic approaches, specifically Feedback-based Quantum Algorithms, such as FALQON. We explore the applicability of these methods in the study of open phenomena in condensed matter physics, including Deconfined Quantum Criticality, strange metals, Many-Body Localization, topological phase transitions, and quantum spin liquids. We discuss how fundamental operational bottlenecks, notably expressibility- and noise-induced barren plateaus, severely compromise gradient-based optimization. We conclude that deterministic feedback-guided methods provide geometrically more robust trajectories for navigating the energy landscape of these systems, arguing that further advancement in the field will rely on deep hybridization and physics-informed circuit co-design towards fault tolerance.

quant-pharXiv:2606.03147•Journal of Physics Condensed Matter•Jun 3, 2026•0 citations

Quantum Monte-Carlo Simulations of Correlated Bosonic and Fermionic Systems

C. Lavalle, Marcos Rigol, M. Feldbacher +3 more

Springer eBooks•Jan 1, 2003•0 citations

Quantum-Monte-Carlo simulations for fermionic systems

I. Morgenstern

The European Physical Journal B•Jun 1, 1989•14 citations

Fermionic Orbital Optimization in Tensor Network States

Christian Krumnow, Libor Veis, Örs Legeza +1 more

Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems, specifically in the context of quantum chemistry. A new freedom arising in such nonlocal fermionic systems is the choice of orbitals, it being far from clear what choice of fermionic orbitals to make. In this Letter, we propose a way to overcome this challenge. We suggest a method intertwining the optimization over matrix product states with suitable fermionic Gaussian mode transformations. The described algorithm generalizes basis changes in the spirit of the Hartree-Fock method to matrix-product states, and provides a black box tool for basis optimization in tensor network methods.

arXiv:1504.00042•Physical Review Letters•Nov 18, 2016•84 citations
Physical systems with strongly correlated electrons (fermions) are notoriously difficult to study using traditional computers. Meanwhile, as programmable $q\phantom{\rule{0}{0ex}}u\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}u\phantom{\rule{0}{0ex}}m$ computers become a reality, efficient (and preferably general) quantum algorithms are needed, in the face of limited qubit-qubit connectivity in the near term. Addressing both problems, the authors develop quantum algorithms that run on two-dimensional qubit lattices with nearest-neighbor interactions, to simulate strongly correlated fermions. Their approach avoids the parity problem in mapping fermionic operators to qubit operators, with hardly any overhead, and can be used for a whole class of problems.
This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era. The simulation of strongly correlated systems is frequently intractable on classical computers due to the exponential growth of the Hilbert space and the fermionic sign problem. In this context, we review and compare the performance of traditional Variational Quantum Algorithms, such as the Variational Quantum Eigensolver and the Quantum Approximate Optimization Algorithm, against emerging heuristic approaches, specifically Feedback-based Quantum Algorithms, such as FALQON. We explore the applicability of these methods in the study of open phenomena in condensed matter physics, including Deconfined Quantum Criticality, strange metals, Many-Body Localization, topological phase transitions, and quantum spin liquids. We discuss how fundamental operational bottlenecks, notably expressibility- and noise-induced barren plateaus, severely compromise gradient-based optimization. We conclude that deterministic feedback-guided methods provide geometrically more robust trajectories for navigating the energy landscape of these systems, arguing that further advancement in the field will rely on deep hybridization and physics-informed circuit co-design towards fault tolerance.
Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems, specifically in the context of quantum chemistry. A new freedom arising in such nonlocal fermionic systems is the choice of orbitals, it being far from clear what choice of fermionic orbitals to make. In this Letter, we propose a way to overcome this challenge. We suggest a method intertwining the optimization over matrix product states with suitable fermionic Gaussian mode transformations. The described algorithm generalizes basis changes in the spirit of the Hartree-Fock method to matrix-product states, and provides a black box tool for basis optimization in tensor network methods.