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

Simulating strongly interacting fermionic systems in a quantum computer

Alexandre Choquette, Panagiotis Kl. Barkoutsos, Agustín Di Paolo, Alexandre Foley, David Sénéchal, Ivano Tavernelli, Alexandre Blais

Published Mar 5, 2019• 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 fermions on a quantum computer

Gerardo Ortíz, James E. Gubernatis, Emanuel H. Knill +1 more

Computer Physics Communications•Jul 1, 2002•14 citations

Quantum Monte Carlo Studies of Strongly Interacting Fermionic Systems

Lucas Madeira

•Jan 1, 2018•0 citations

Fermionic non-Gaussianity via computable measures and experimentally accessible bounds

Leela Ganesh Chandra Lakkaraju, Naga Dileep Varikuti, Philipp Hauke

Interacting fermions owe both their non-trivial correlations and their computational power to their departure from Gaussianity. Yet, quantifying that departure geometrically faces two challenges: the Gaussian manifold is non-convex, and perturbative treatments are confined to weak interactions. Here, we introduce a geometric measure of fermionic non-Gaussianity, the fidelity distance of a target state to the manifold of fermionic Gaussian states. We construct an iteration formalism to numerically access it, applicable also at strong coupling. Further, we prove a sharpened operator Jensen inequality, of interest in its own right. We use it to derive a witness that involves only two- and four-point fermionic correlators. Numerical benchmarks on the one-dimensional Fermi--Hubbard model show that the quality of the witness improves with system size and, for strong coupling, is tighter than antiflatness. Our results open a scalable route to charting non-Gaussianity of strongly-interacting fermionic quantum simulators.

quant-pharXiv:2610.17219•Oct 14, 2026•0 citations

Parallelization techniques for quantum simulation of fermionic systems

Jacob Bringewatt, Zohreh Davoudi

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

arXiv:2207.12470•Quantum•Apr 13, 2023•3 citations

Quantum-Monte-Carlo simulations for fermionic systems

I. Morgenstern

The European Physical Journal B•Jun 1, 1989•14 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.
Interacting fermions owe both their non-trivial correlations and their computational power to their departure from Gaussianity. Yet, quantifying that departure geometrically faces two challenges: the Gaussian manifold is non-convex, and perturbative treatments are confined to weak interactions. Here, we introduce a geometric measure of fermionic non-Gaussianity, the fidelity distance of a target state to the manifold of fermionic Gaussian states. We construct an iteration formalism to numerically access it, applicable also at strong coupling. Further, we prove a sharpened operator Jensen inequality, of interest in its own right. We use it to derive a witness that involves only two- and four-point fermionic correlators. Numerical benchmarks on the one-dimensional Fermi--Hubbard model show that the quality of the witness improves with system size and, for strong coupling, is tighter than antiflatness. Our results open a scalable route to charting non-Gaussianity of strongly-interacting fermionic quantum simulators.
Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.