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:2306.14842 · Physical Review Research

Fermionic simulators for enhanced scalability of variational quantum simulation

Qingyu Li, Chiranjib Mukhopadhyay, Abolfazl Bayat

Published Nov 27, 2023• 11 citations
arXivHTMLPDF

Abstract

Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most of material science and chemistry, as one has to adopt fermion-to-qubit encodings which create significant additional resource overhead and trainability issues. Thanks to recent advances in trapping and manipulation of neutral atoms in optical tweezers, digital fermionic quantum simulators are becoming viable. A key question is whether these emerging fermionic simulators can outperform qubit-based simulators for characterizing strongly correlated electronic systems. Here we perform a comprehensive comparison of resource efficiency between qubit and fermionic simulators for variational ground-state emulation of fermionic systems in both condensed matter systems and quantum chemistry problems. We show that the fermionic simulators indeed outperform their qubit counterparts with respect to resources for quantum evolution (circuit depth) as well as classical optimization (number of required parameters and iterations). In addition, they show less sensitivity to the random initialization of the circuit. The relative advantage of fermionic simulators becomes even more pronounced as interaction becomes stronger, or tunneling is allowed in more than one dimension, as well as for spinful fermions. Importantly, this improvement is scalable, i.e., the performance gap between fermionic and qubit simulators only grows for bigger system sizes.

DOI
10.1103/physrevresearch.5.043175

Related papers

Accelerated variational algorithms for digital quantum simulation of many-body ground states

Chufan Lyu, Víctor Montenegro, Abolfazl Bayat

One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.

arXiv:2006.09415•Quantum•Sep 16, 2020•27 citations

Efficient Simulation of Sparse, Non-Local Fermion Models

Reinis Irmejs, J. Ignacio Cirac

Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic modes in which each participates in at most a constant number $d$ of interactions and study the circuit depth required to implement the Trotterized time evolution on qubit hardware with all-to-all connectivity. We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings. Although the preparation of the auxiliary fermion state incurs an initial overhead, this state remains invariant under time evolution. As a result, long-time evolution can be implemented with asymptotically optimal circuit depth, reducing a previously multiplicative $O(\log N)$ overhead to an additive overhead. Our results thus establish that the simulation of sparse fermionic models on qubit hardware matches the performance achievable on ideal fermionic hardware up to constant factors and $O(dN)$ ancillary qubits.

quant-pharXiv:2512.15843•Dec 18, 2025•1 citation

Fermionic quantum processing with programmable neutral atom arrays

Daniel González-Cuadra, Dolev Bluvstein, M. Kalinowski +10 more

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics.-5.4pc]Please note that the spelling of the following author names in the manuscript differs from the spelling provided in the article metadata: D. González-Cuadra, D. Bluvstein, M. Kalinowski, R. Kaubruegger, N. Maskara, P. Naldesi, T. V. Zache, A. M. Kaufman, M. D. Lukin, H. Pichler, B. Vermersch, Jun Ye, and P. Zoller. The spelling provided in the manuscript has been retained; please confirm. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding nonlocal fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement nonlocal gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation as well as to simulate lattice gauge theory dynamics.

arXiv:2303.06985•Proceedings of the National Academy of Sciences•Aug 22, 2023•105 citations

An application benchmark for fermionic quantum simulations

Pierre-Luc Dallaire-Demers, Michał Stęchły, Jérôme F. Gonthier +3 more

It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid evolution of quantum hardware, it is increasingly important to develop robust benchmarking techniques to gauge the capacity of quantum hardware specifically for the purpose of fermionic simulation. Here we propose using the one-dimensional Fermi-Hubbard model as an application benchmark for variational quantum simulations on near-term quantum devices. Since the one-dimensional Hubbard model is both strongly correlated and exactly solvable with the Bethe ansatz, it provides a reference ground state energy that a given device with limited coherence will be able to approximate up to a maximal size. The length of the largest chain that can be simulated provides an effective fermionic length. We use variational quantum eigensolver to approximate the ground state energy values of Fermi-Hubbard instances and show how the fermionic length benchmark can be used in practice to assess the performance of bounded-depth devices in a scalable fashion.

arXiv:2003.01862•Bulletin of the American Physical Society•Mar 4, 2020•48 citations

Qudit-based quantum simulation of fermionic systems

Mario Chizzini, Francesco Tacchino, Alessandro Chiesa +3 more

Model Hamiltonians described by fermionic operators are ubiquitous in physics and chemistry, but the quantum simulation of their properties is challenging on near-term quantum computers. Indeed, for any problem with more than two connected neighbors, standard mappings of fermions on qubits lead to many-body operators whose size increases with the size of the problem, quickly making the simulation unfeasible on noisy devices. Here we consider an alternative mapping based on qudits and the auxiliary fermion method, which leads to a significant reduction in the circuit depth and in the number of computational units to be controlled. These advantages increase for highly connected target Hamiltonians, such as lattices with long-range interactions or the molecular systems investigated in quantum chemistry. We numerically test our approach on qudits encoded in molecular spins, by performing the quantum simulation of a fermionic model on a small cluster. Published by the American Physical Society 2024

Physical Review A•Dec 2, 2024•14 citations

A Comparative Survey of Quantum Simulators: Limitations, Challenges, and Future Directions for Enhanced Performance

Lucky Saxena, Kailash Chandra Bandhu

Quantum simulators have emerged as indispensable tools for exploring and understanding complex quantum phenomena that are beyond the capabilities of classical computation. They enable controlled experimentation and modeling of quantum systems across domains such as condensed matter physics, quantum chemistry, and high-energy physics. Despite rapid advancements and the development of numerous platforms ranging from superconducting circuits and trapped ions to photonic and neutral atom systems there remains a lack of unified evaluation and benchmarking standards. This gap limits the ability to objectively compare simulator performance and hinders progress toward scalable, fault-tolerant designs. This study presents a comprehensive comparative survey of leading quantum simulators, systematically analyzing their performance based on key technical criteria, including scalability, fidelity, coherence time, noise modeling, connectivity, programmability, and hardware–software integration. Through this structured evaluation, we identify each platform’s strengths and inherent limitations, such as hardware constraints, limited qubit interconnectivity, or challenges in accurate noise emulation.

IEEE International Conference on Innovate for Humanitarian: Tech Solutions for Global Challenge (ICIH)•Nov 1, 2025•0 citations
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most of material science and chemistry, as one has to adopt fermion-to-qubit encodings which create significant additional resource overhead and trainability issues. Thanks to recent advances in trapping and manipulation of neutral atoms in optical tweezers, digital fermionic quantum simulators are becoming viable. A key question is whether these emerging fermionic simulators can outperform qubit-based simulators for characterizing strongly correlated electronic systems. Here we perform a comprehensive comparison of resource efficiency between qubit and fermionic simulators for variational ground-state emulation of fermionic systems in both condensed matter systems and quantum chemistry problems. We show that the fermionic simulators indeed outperform their qubit counterparts with respect to resources for quantum evolution (circuit depth) as well as classical optimization (number of required parameters and iterations). In addition, they show less sensitivity to the random initialization of the circuit. The relative advantage of fermionic simulators becomes even more pronounced as interaction becomes stronger, or tunneling is allowed in more than one dimension, as well as for spinful fermions. Importantly, this improvement is scalable, i.e., the performance gap between fermionic and qubit simulators only grows for bigger system sizes.
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with NNN fermionic modes in which each participates in at most a constant number ddd of interactions and study the circuit depth required to implement the Trotterized time evolution on qubit hardware with all-to-all connectivity. We introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions, enabling the removal of Jordan--Wigner strings. Although the preparation of the auxiliary fermion state incurs an initial overhead, this state remains invariant under time evolution. As a result, long-time evolution can be implemented with asymptotically optimal circuit depth, reducing a previously multiplicative O(log⁡N)O(\log N)O(logN) overhead to an additive overhead. Our results thus establish that the simulation of sparse fermionic models on qubit hardware matches the performance achievable on ideal fermionic hardware up to constant factors and O(dN)O(dN)O(dN) ancillary qubits.
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics.-5.4pc]Please note that the spelling of the following author names in the manuscript differs from the spelling provided in the article metadata: D. González-Cuadra, D. Bluvstein, M. Kalinowski, R. Kaubruegger, N. Maskara, P. Naldesi, T. V. Zache, A. M. Kaufman, M. D. Lukin, H. Pichler, B. Vermersch, Jun Ye, and P. Zoller. The spelling provided in the manuscript has been retained; please confirm. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding nonlocal fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement nonlocal gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation as well as to simulate lattice gauge theory dynamics.
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid evolution of quantum hardware, it is increasingly important to develop robust benchmarking techniques to gauge the capacity of quantum hardware specifically for the purpose of fermionic simulation. Here we propose using the one-dimensional Fermi-Hubbard model as an application benchmark for variational quantum simulations on near-term quantum devices. Since the one-dimensional Hubbard model is both strongly correlated and exactly solvable with the Bethe ansatz, it provides a reference ground state energy that a given device with limited coherence will be able to approximate up to a maximal size. The length of the largest chain that can be simulated provides an effective fermionic length. We use variational quantum eigensolver to approximate the ground state energy values of Fermi-Hubbard instances and show how the fermionic length benchmark can be used in practice to assess the performance of bounded-depth devices in a scalable fashion.
Model Hamiltonians described by fermionic operators are ubiquitous in physics and chemistry, but the quantum simulation of their properties is challenging on near-term quantum computers. Indeed, for any problem with more than two connected neighbors, standard mappings of fermions on qubits lead to many-body operators whose size increases with the size of the problem, quickly making the simulation unfeasible on noisy devices. Here we consider an alternative mapping based on qudits and the auxiliary fermion method, which leads to a significant reduction in the circuit depth and in the number of computational units to be controlled. These advantages increase for highly connected target Hamiltonians, such as lattices with long-range interactions or the molecular systems investigated in quantum chemistry. We numerically test our approach on qudits encoded in molecular spins, by performing the quantum simulation of a fermionic model on a small cluster. Published by the American Physical Society 2024
Quantum simulators have emerged as indispensable tools for exploring and understanding complex quantum phenomena that are beyond the capabilities of classical computation. They enable controlled experimentation and modeling of quantum systems across domains such as condensed matter physics, quantum chemistry, and high-energy physics. Despite rapid advancements and the development of numerous platforms ranging from superconducting circuits and trapped ions to photonic and neutral atom systems there remains a lack of unified evaluation and benchmarking standards. This gap limits the ability to objectively compare simulator performance and hinders progress toward scalable, fault-tolerant designs. This study presents a comprehensive comparative survey of leading quantum simulators, systematically analyzing their performance based on key technical criteria, including scalability, fidelity, coherence time, noise modeling, connectivity, programmability, and hardware–software integration. Through this structured evaluation, we identify each platform’s strengths and inherent limitations, such as hardware constraints, limited qubit interconnectivity, or challenges in accurate noise emulation.