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

Fermions and Qubits

Emmanuel Aram Iriarte Olea

Published May 2, 2021• 0 citations
OpenAlex

Abstract

The essential component of the simulation of quantum systems is the mapping of the fermionic Fock space into qubits and the mapping of the creation and annihilation operators into qubit operators. This work covers the notions of the many-body problem, Slater determinants, second quantization as well as different mapping from the Fock space to the Hilbert space where qubits exist. Finally, this work also contains the development of a Mathematica code that performs two of the mappings mentioned above.

Related papers

Many-Body Physics and Second Quantization

Michael El-Batanouny

Introduces the idea of second quantized operators in the many-particle domain, Fock spaces, field operators, and vacuum states, and outlines how canonical transformations can be applied to solve many-body problems. Coherent states, as eigenstates of the annihilation operator, including the development of Grassmann’s algebra and calculus for fermions, are presented.

Cambridge University Press eBooks•Mar 6, 2020•0 citations

Lowering qubit requirements for quantum simulations of fermionic systems

Mark Steudtner, Stephanie Wehner

The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. One challenge in realizing simulations on near-term quantum devices is the large number of qubits required by such mappings. In this work, we develop methods that allow us to trade-off qubit requirements against the complexity of the resulting quantum circuit. We first show that any classical code used to map the state of a fermionic Fock space to qubits gives rise to a mapping of fermionic models to quantum gates. As an illustrative example, we present a mapping based on a non-linear classical error correcting code, which leads to significant qubit savings albeit at the expense of additional quantum gates. We proceed to use this framework to present a number of simpler mappings that lead to qubit savings with only a very modest increase in gate difficulty. We discuss the role of symmetries such as particle conservation, and savings that could be obtained if an experimental platform could easily realize multi-controlled gates.

arXiv:1712.07067•Bulletin of the American Physical Society•Dec 19, 2017•18 citations

Fermion-to-qubit mappings with varying resource requirements for quantum simulation

Mark Steudtner, Stephanie Wehner

The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. Interestingly, the minimal requirement of qubits for simulating Fermions seems to be agnostic of the actual number of particles as well as other symmetries. This leads to qubit requirements that are well above the minimal requirements as suggested by combinatorial considerations. In this work, we develop methods that allow us to trade-off qubit requirements against the complexity of the resulting quantum circuit. We first show that any classical code used to map the state of a fermionic Fock space to qubits gives rise to a mapping of fermionic models to quantum gates. As an illustrative example, we present a mapping based on a nonlinear classical error correcting code, which leads to significant qubit savings albeit at the expense of additional quantum gates. We proceed to use this framework to present a number of simpler mappings that lead to qubit savings with a more modest increase in gate difficulty. We discuss the role of symmetries such as particle conservation, and savings that could be obtained if an experimental platform could easily realize multi-controlled gates.

New Journal of Physics•May 16, 2018•104 citations

Quantum Many-Particle Systems and Second Quantization

Hans-Peter Eckle

Abstract Chapter 2 provides a review of pertinent aspects of the quantum mechanics of systems composed of many particles. It focuses on the foundations of quantum many-particle physics, the many-particle Hilbert spaces to describe large assemblies of interacting systems composed of Bosons or Fermions, which lead to the versatile formalism of second quantization as a convenient and eminently practical language ubiquitous in the mathematical formulation of the theory of many-particle systems of quantum matter. The main objects in which the formalism of second quantization is expressed are the Bosonic or Fermionic creation and annihilation operators that become, in the position basis, the quantum field operators.

•Jul 25, 2019•0 citations

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 I: = ⌈log₂ binom(M,F)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. 1) Our first construction uses I + o(I) qubits when F = o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) 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.

•Jan 1, 2025•0 citations

Introduction to the "second quantization" formalism for non-relativistic quantum mechanics: A possible substitution for Sections 6.7 and 6.8 of Feynman's "Statistical Mechanics"

Hal Tasaki

This is a self-contained and hopefully readable account on the method of creation and annihilation operators (also known as the Fock space representation or the "second quantization" formalism) for non-relativistic quantum mechanics of many particles. Assuming knowledge only on conventional quantum mechanics in the wave function formalism, we define the creation and annihilation operators, discuss their properties, and introduce corresponding representations of states and operators of many-particle systems. As the title of the note suggests, we cover most topics treated in sections 6.7 and 6.8 of Feynman's "Statistical Mechanics: A Set of Lectures". As a preliminary, we also carefully discuss the symmetry of wave functions describing indistinguishable particles. We note that all the contents of the present note are completely standard, and the definitions and the derivations presented here have been known to many. Although the style of the present note may be slightly more mathematical than standard physics literatures, we do not try to achieve full mathematical rigor.(Note to experts: In particular we here DERIVE the (anti)commutation relations of the creation and annihilation operators, rather than simply declaring them. In this sense our approach is quite close to that of Feynman's. But we here focus on the action of creation/annihilation operators on general $N$ body wave functions, while Feynman makes a heavy use of Slater-determinant-type states from the beginning. We hope that our presentation provides a better perspective on the formalism.)

arXiv:1812.10732•Dec 27, 2018•1 citation
The essential component of the simulation of quantum systems is the mapping of the fermionic Fock space into qubits and the mapping of the creation and annihilation operators into qubit operators. This work covers the notions of the many-body problem, Slater determinants, second quantization as well as different mapping from the Fock space to the Hilbert space where qubits exist. Finally, this work also contains the development of a Mathematica code that performs two of the mappings mentioned above.
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. One challenge in realizing simulations on near-term quantum devices is the large number of qubits required by such mappings. In this work, we develop methods that allow us to trade-off qubit requirements against the complexity of the resulting quantum circuit. We first show that any classical code used to map the state of a fermionic Fock space to qubits gives rise to a mapping of fermionic models to quantum gates. As an illustrative example, we present a mapping based on a non-linear classical error correcting code, which leads to significant qubit savings albeit at the expense of additional quantum gates. We proceed to use this framework to present a number of simpler mappings that lead to qubit savings with only a very modest increase in gate difficulty. We discuss the role of symmetries such as particle conservation, and savings that could be obtained if an experimental platform could easily realize multi-controlled gates.
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. Interestingly, the minimal requirement of qubits for simulating Fermions seems to be agnostic of the actual number of particles as well as other symmetries. This leads to qubit requirements that are well above the minimal requirements as suggested by combinatorial considerations. In this work, we develop methods that allow us to trade-off qubit requirements against the complexity of the resulting quantum circuit. We first show that any classical code used to map the state of a fermionic Fock space to qubits gives rise to a mapping of fermionic models to quantum gates. As an illustrative example, we present a mapping based on a nonlinear classical error correcting code, which leads to significant qubit savings albeit at the expense of additional quantum gates. We proceed to use this framework to present a number of simpler mappings that lead to qubit savings with a more modest increase in gate difficulty. We discuss the role of symmetries such as particle conservation, and savings that could be obtained if an experimental platform could easily realize multi-controlled gates.
Abstract Chapter 2 provides a review of pertinent aspects of the quantum mechanics of systems composed of many particles. It focuses on the foundations of quantum many-particle physics, the many-particle Hilbert spaces to describe large assemblies of interacting systems composed of Bosons or Fermions, which lead to the versatile formalism of second quantization as a convenient and eminently practical language ubiquitous in the mathematical formulation of the theory of many-particle systems of quantum matter. The main objects in which the formalism of second quantization is expressed are the Bosonic or Fermionic creation and annihilation operators that become, in the position basis, the quantum field operators.
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 I: = ⌈log₂ binom(M,F)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. 1) Our first construction uses I + o(I) qubits when F = o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) 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.
This is a self-contained and hopefully readable account on the method of creation and annihilation operators (also known as the Fock space representation or the "second quantization" formalism) for non-relativistic quantum mechanics of many particles. Assuming knowledge only on conventional quantum mechanics in the wave function formalism, we define the creation and annihilation operators, discuss their properties, and introduce corresponding representations of states and operators of many-particle systems. As the title of the note suggests, we cover most topics treated in sections 6.7 and 6.8 of Feynman's "Statistical Mechanics: A Set of Lectures". As a preliminary, we also carefully discuss the symmetry of wave functions describing indistinguishable particles. We note that all the contents of the present note are completely standard, and the definitions and the derivations presented here have been known to many. Although the style of the present note may be slightly more mathematical than standard physics literatures, we do not try to achieve full mathematical rigor.(Note to experts: In particular we here DERIVE the (anti)commutation relations of the creation and annihilation operators, rather than simply declaring them. In this sense our approach is quite close to that of Feynman's. But we here focus on the action of creation/annihilation operators on general NNN body wave functions, while Feynman makes a heavy use of Slater-determinant-type states from the beginning. We hope that our presentation provides a better perspective on the formalism.)