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

Improving fermion operators

G. Heatlie, C. T. Sachrajda, Guido Martinelli, Carlotta Pittori A, Giancarlo C. Rossi

Published Nov 1, 1989• 0 citations
OpenAlex

Related papers

The one nucleon transfer operator in the microscopic IBM without NOA

José Barea, Clara E. Alonso, J. M. Arias

The mapping of the single fermion creation operator (ci†) onto the Interacting Boson–Fermion space (IBFM) is revisited within the Generalized Seniority scheme. In the original work the Number Operator Approximation (NOA) was used. Here the exact evaluation of the relevant terms using exact values for the fermion matrix elements in the Generalized Seniority scheme is worked out. This provides a new, improved, single particle transfer operator to be used in IBFM.

Physics Letters B•Aug 19, 2014•7 citations

Treating Fermions

World Scientific lecture and course notes in chemistry•Mar 1, 1994•0 citations

Fermi Operators

WORLD SCIENTIFIC eBooks•Apr 1, 2003•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 $\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

Fermi Operators

WORLD SCIENTIFIC eBooks•Jun 16, 2009•0 citations

Learning fermionic linear optics with Heisenberg scaling and physical operations

Aria Christensen, Andrew Zhao

We revisit the problem of learning fermionic linear optics (FLO), also known as fermionic Gaussian unitaries. Given black-box query access to an unknown FLO, previous proposals required $\widetilde{\mathcal{O}}(n^5 / \varepsilon^2)$ queries, where $n$ is the system size and $\varepsilon$ is the error in diamond distance. These algorithms also use unphysical operations (i.e., violating fermionic superselection rules) and/or $n$ auxiliary modes to prepare Choi states of the FLO. In this work, we establish efficient and experimentally friendly protocols that obey superselection, use minimal ancilla (at most $1$ extra mode), and exhibit improved dependence on both parameters $n$ and $\varepsilon$. For arbitrary (active) FLOs this algorithm makes at most $\widetilde{\mathcal{O}}(n^4 / \varepsilon)$ queries, while for number-conserving (passive) FLOs we show that $\mathcal{O}(n^3 / \varepsilon)$ queries suffice. The complexity of the active case can be further reduced to $\widetilde{\mathcal{O}}(n^3 / \varepsilon)$ at the cost of using $n$ ancilla. This marks the first FLO learning algorithm that attains Heisenberg scaling in precision. As a side result, we also demonstrate an improved copy complexity of $\widetilde{\mathcal{O}}(n η^2 / \varepsilon^2)$ for time-efficient state tomography of $η$-particle Slater determinants in $\varepsilon$ trace distance, which may be of independent interest.

quant-pharXiv:2602.05058•Feb 6, 2026•12 citations
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.
We revisit the problem of learning fermionic linear optics (FLO), also known as fermionic Gaussian unitaries. Given black-box query access to an unknown FLO, previous proposals required O~(n5/ε2)\widetilde{\mathcal{O}}(n^5 / \varepsilon^2)O(n5/ε2) queries, where nnn is the system size and ε\varepsilonε is the error in diamond distance. These algorithms also use unphysical operations (i.e., violating fermionic superselection rules) and/or nnn auxiliary modes to prepare Choi states of the FLO. In this work, we establish efficient and experimentally friendly protocols that obey superselection, use minimal ancilla (at most 111 extra mode), and exhibit improved dependence on both parameters nnn and ε\varepsilonε. For arbitrary (active) FLOs this algorithm makes at most O~(n4/ε)\widetilde{\mathcal{O}}(n^4 / \varepsilon)O(n4/ε) queries, while for number-conserving (passive) FLOs we show that O(n3/ε)\mathcal{O}(n^3 / \varepsilon)O(n3/ε) queries suffice. The complexity of the active case can be further reduced to O~(n3/ε)\widetilde{\mathcal{O}}(n^3 / \varepsilon)O(n3/ε) at the cost of using nnn ancilla. This marks the first FLO learning algorithm that attains Heisenberg scaling in precision. As a side result, we also demonstrate an improved copy complexity of O~(nη2/ε2)\widetilde{\mathcal{O}}(n η^2 / \varepsilon^2)O(nη2/ε2) for time-efficient state tomography of ηηη-particle Slater determinants in ε\varepsilonε trace distance, which may be of independent interest.