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

Hardware-efficient fermionic simulation with a cavity-QED system

Yiğit Subaşı

Published Feb 15, 2024• 3 citations
OpenAlex

Abstract

Computation performed by applying a series of one and two qubit gates from a universal set and performing measurements on qubits.Computational complexity measured by the circuit-depth. Fermionic Embedding ProblemThe Hilbert space of n qubits is the tensor product of n 2-level Hilbert spaces.Each qubit is distinguishable.Fermions are indistinguishable particles with anti-symmetric wavefunctions.(Fermi-Dirac Statistics) Can we represent a fermionic system with a system of qubits?

Related papers

Barriers to Simulation ofQuantum Chemistry onQuantum Hardware.

Benjamin C. A Morrison

Inconvenient Implementation Details• The systems we're trying to simulate are made of electrons, which are indistinguishable fermions.• (Almost) any quantum computer we're likely to use to simulate them is going to be made of qubits, which are distinguishable two-level systems.• To map one onto another, we will need to correct the shape of our Hilbert space.• This has a cost in overhead, either increased weight/nonlocality of operators (Jordan-Wigner, Bravyi-Kitaev, Parity Basis) or extra qubits (BK Superfast).• In the former case, we multiply our circuit depth/time cost by O(n) or O(log n) depending on the connectivity of our hardware, where n is the number of orbitals considered.• In the latter case, we multiply our qubit count/space cost by the degree of the interaction graph, which in the general case is O(n).• If we had a quantum computer made of fermions instead of qubits, this would be free… 5

•Dec 13, 2021•0 citations

Hardware-efficient fermionic simulation with a cavity–QED system

Guanyu Zhu, Yiğit Subaşı, James Daniel Whitfield +1 more

Abstract In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given decoherence time. Here we show how one can use a cavity–QED system to perform digital quantum simulation of fermionic models. In particular, we show that highly nonlocal Jordan–Wigner or Bravyi–Kitaev transformations can be efficiently implemented through a hardware approach. The key idea is using ancilla cavity modes, which are dispersively coupled to a qubit string, to collectively manipulate and measure qubit states. Our scheme reduces the circuit depth in each Trotter step of the Jordan–Wigner encoding by a factor ofN2, comparing to the scheme for a device with only local connectivity, whereNis the number of orbitals for a generic two-body Hamiltonian. Additional analysis for the Fermi–Hubbard model on anN × Nsquare lattice results in a similar reduction. We also discuss a detailed implementation of our scheme with superconducting qubits and cavities.

arXiv:1707.04760•npj Quantum Information•Feb 14, 2018•24 citations

Qubits in second quantisation in fermionic simulators

Ahana Ghoshal, Carlos de Gois, Kiara Hansenne +2 more

Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native fermionic simulators as an alternative. While allowing for fermionic problems to be simulated efficiently, this class of fermionic simulators carries also specific constraints with them and poses other challenges unfamiliar to qubit systems. Here, we propose to pair fermionic modes to form a so-called qubit in second quantisation representation. This allows fermionic gates to be represented as rotations of these second quantised qubits, enabling adaptation of methods for qubit systems. As an application, we use this pairing scheme to represent the measurement of two- and four-point correlators in fermionic simulators with its native gates as a graph problem. Optimising measurement settings is then analysed with various analytical and algorithmic methods.

quant-pharXiv:2512.11726•Physical Review A•Dec 15, 2025•1 citation

Succinct Fermion Data Structures

Carolan, Joseph, Luke Schaeffer

Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of $F$ fermions in $M$ modes. An information theoretic minimum of $\mathcal{I}:=\lceil\log \binom{M}{F}\rceil$ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses $\mathcal I+o(\mathcal I)$ qubits when $F=o(M)$, and allows rotations generated by creation-annihilation operators in $O(\mathcal I)$ gates and $O(\log M \log \log M)$ depth. (2) Our second construction uses $\mathcal I+O(1)$ qubits when $F=Θ(M)$, and allows rotations generated by creation-annihilation operators in $O(\mathcal I^3)$ gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.

arXiv:2410.04015•Leibniz international proceedings in informatics•Oct 5, 2024•6 citations

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

Putting fermions onto a digital quantum computer

Riley W. Chien, Mitchell L. Chiew, Brent Harrison +8 more

Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and, now the simulation of fermionic systems on quantum computers based on qubits provides yet another application. In this perspective, we review methods for encoding fermionic degrees of freedom into qubits and attempt to dispel the persistent notion that fermionic systems beyond one dimension are fundamentally more difficult to deal with.

quant-pharXiv:2602.07151•Nature Reviews Physics•Feb 10, 2026•5 citations
Computation performed by applying a series of one and two qubit gates from a universal set and performing measurements on qubits.Computational complexity measured by the circuit-depth. Fermionic Embedding ProblemThe Hilbert space of n qubits is the tensor product of n 2-level Hilbert spaces.Each qubit is distinguishable.Fermions are indistinguishable particles with anti-symmetric wavefunctions.(Fermi-Dirac Statistics) Can we represent a fermionic system with a system of qubits?
Inconvenient Implementation Details• The systems we're trying to simulate are made of electrons, which are indistinguishable fermions.• (Almost) any quantum computer we're likely to use to simulate them is going to be made of qubits, which are distinguishable two-level systems.• To map one onto another, we will need to correct the shape of our Hilbert space.• This has a cost in overhead, either increased weight/nonlocality of operators (Jordan-Wigner, Bravyi-Kitaev, Parity Basis) or extra qubits (BK Superfast).• In the former case, we multiply our circuit depth/time cost by O(n) or O(log n) depending on the connectivity of our hardware, where n is the number of orbitals considered.• In the latter case, we multiply our qubit count/space cost by the degree of the interaction graph, which in the general case is O(n).• If we had a quantum computer made of fermions instead of qubits, this would be free… 5
Abstract In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given decoherence time. Here we show how one can use a cavity–QED system to perform digital quantum simulation of fermionic models. In particular, we show that highly nonlocal Jordan–Wigner or Bravyi–Kitaev transformations can be efficiently implemented through a hardware approach. The key idea is using ancilla cavity modes, which are dispersively coupled to a qubit string, to collectively manipulate and measure qubit states. Our scheme reduces the circuit depth in each Trotter step of the Jordan–Wigner encoding by a factor ofN2, comparing to the scheme for a device with only local connectivity, whereNis the number of orbitals for a generic two-body Hamiltonian. Additional analysis for the Fermi–Hubbard model on anN × Nsquare lattice results in a similar reduction. We also discuss a detailed implementation of our scheme with superconducting qubits and cavities.
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native fermionic simulators as an alternative. While allowing for fermionic problems to be simulated efficiently, this class of fermionic simulators carries also specific constraints with them and poses other challenges unfamiliar to qubit systems. Here, we propose to pair fermionic modes to form a so-called qubit in second quantisation representation. This allows fermionic gates to be represented as rotations of these second quantised qubits, enabling adaptation of methods for qubit systems. As an application, we use this pairing scheme to represent the measurement of two- and four-point correlators in fermionic simulators with its native gates as a graph problem. Optimising measurement settings is then analysed with various analytical and algorithmic methods.
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of FFF fermions in MMM modes. An information theoretic minimum of I:=⌈log⁡(MF)⌉\mathcal{I}:=\lceil\log \binom{M}{F}\rceilI:=⌈log(FM​)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses I+o(I)\mathcal I+o(\mathcal I)I+o(I) qubits when F=o(M)F=o(M)F=o(M), and allows rotations generated by creation-annihilation operators in O(I)O(\mathcal I)O(I) gates and O(log⁡Mlog⁡log⁡M)O(\log M \log \log M)O(logMloglogM) depth. (2) Our second construction uses I+O(1)\mathcal I+O(1)I+O(1) qubits when F=Θ(M)F=Θ(M)F=Θ(M), and allows rotations generated by creation-annihilation operators in O(I3)O(\mathcal I^3)O(I3) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
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.
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and, now the simulation of fermionic systems on quantum computers based on qubits provides yet another application. In this perspective, we review methods for encoding fermionic degrees of freedom into qubits and attempt to dispel the persistent notion that fermionic systems beyond one dimension are fundamentally more difficult to deal with.