arxiv: 2512.15843 · v2 · submitted 2025-12-17 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Efficient Simulation of Sparse, Non-Local Fermion Models

Reinis Irmejs , J. Ignacio Cirac

Authors on Pith no claims yet

Pith reviewed 2026-05-16 21:21 UTC · model grok-4.3

classification 🪐 quant-ph

keywords fermion simulationJordan-Wigner transformationquantum circuit depthTrotterizationauxiliary modessparse interactionsqubit encoding

0 comments

The pith

An auxiliary-fermion encoding removes Jordan-Wigner strings from sparse models, allowing qubit simulations to achieve optimal circuit depth.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes an encoding for sparse fermionic models with N modes, each interacting with at most d constant others, that adds auxiliary fermions to each mode. This preparation eliminates the need for Jordan-Wigner string corrections in the time-evolution circuits. Because the auxiliary state stays unchanged during evolution, the circuit depth for long-time Trotter steps becomes asymptotically the same as on perfect fermionic hardware. The result uses O(d N) ancillary qubits but removes a previous multiplicative log N factor. Readers care because it makes simulating interacting fermions on near-term qubit devices far more efficient for models like those in chemistry and materials science.

Core claim

The authors introduce an encoding that augments each physical fermionic mode with a small number of auxiliary fermions. This removes Jordan-Wigner strings for all interactions in the sparse model. The auxiliary state is invariant under the time evolution, so after initial preparation the long-time evolution circuit depth is asymptotically optimal, matching ideal fermionic hardware up to constant factors with O(dN) ancillas.

What carries the argument

The auxiliary-fermion encoding that augments each of the N modes with a constant number of auxiliaries to cancel all Jordan-Wigner strings while preserving invariance of the auxiliary state under evolution.

Load-bearing premise

The auxiliary fermions remain in their prepared state throughout the entire time evolution without being affected by the dynamics.

What would settle it

Measuring whether the auxiliary state changes after a long sequence of Trotter steps in a concrete sparse model such as a 2D lattice with nearest and next-nearest neighbor interactions.

Figures

Figures reproduced from arXiv: 2512.15843 by J. Ignacio Cirac, Reinis Irmejs.

**Figure 2.** Figure 2: FIG. 2. (a) Proper edge coloring of the interaction graph with [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

read the original abstract

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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Auxiliary-fermion encoding cuts multiplicative log N depth to additive for sparse fermionic Trotter steps, but the invariance of the auxiliary state under all encoded terms needs explicit verification.

read the letter

The main point is that the authors give an encoding using auxiliary fermions that lets you simulate sparse non-local fermionic models on qubits with circuit depth that is optimal up to constants, instead of the usual log N factor from Jordan-Wigner strings. They prepare a fixed auxiliary state once and claim the encoded operators leave it unchanged during evolution, so the overhead stays additive for d-sparse graphs. That is a practical step for near-term hardware doing chemistry or condensed-matter simulations with all-to-all connectivity. The auxiliary count scales as O(d N), which is linear and acceptable. The construction appears new in how it targets sparsity to avoid the multiplicative cost that standard encodings carry. What they do well is frame the problem clearly around constant-degree interactions and show how auxiliaries can cancel the strings without repeated overhead. The abstract states the result matches ideal fermionic hardware up to constants, which is the right target. The soft spot is the invariance claim itself. The abstract asserts the auxiliary state stays put under every Trotter term, but the stress-test note is right to flag that this requires the encoding to map the chosen subspace to itself for every edge in an arbitrary sparse graph. If the auxiliary parity or mode choices are not perfectly consistent across neighboring terms, leakage could appear after a few steps and restore the log factor. The paper supplies no derivation or projector argument in the abstract, so the central claim rests on details that need checking in the full text. This is aimed at people who build or analyze fermionic simulators on qubit hardware. Readers who care about concrete circuit-depth improvements for Trotterized evolution will get value if the invariance holds. It deserves a serious referee because the idea is targeted and the potential gain is clear for practical applications. I recommend sending it to peer review, with a request to strengthen the invariance section first.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces an encoding that augments each of the N fermionic modes with auxiliary fermions to eliminate Jordan-Wigner strings in Trotterized time evolution for sparse models where each mode participates in at most d interactions. The auxiliary state is prepared once and claimed to remain invariant under the evolution, enabling circuit depths that are asymptotically optimal on qubit hardware with all-to-all connectivity, matching ideal fermionic hardware up to constant factors with an additive O(dN) ancillary qubit overhead.

Significance. If the invariance holds rigorously, this would eliminate the typical multiplicative logarithmic overhead of standard Jordan-Wigner encodings for sparse non-local models, making qubit simulations competitive with ideal fermionic hardware up to constants. The auxiliary-fermion construction for string cancellation while preserving the state could influence algorithm design for near-term devices in quantum chemistry and condensed-matter simulation.

major comments (2)

[Encoding construction and invariance argument] The central claim that the auxiliary fermion state remains invariant under every encoded Trotter term for arbitrary d-regular graphs lacks an explicit subspace-closure argument (e.g., a projector onto the auxiliary subspace or direct verification that each encoded operator maps the subspace to itself). This invariance is load-bearing for removing the O(log N) overhead; without it, leakage would restore multiplicative cost after O(1) steps. (Encoding section and invariance proof)
[Circuit depth and complexity analysis] The abstract asserts asymptotic optimality and reduction to additive overhead, yet supplies no derivation, error analysis, or explicit circuit-depth expressions comparing the encoded Trotter steps (including preparation cost) to prior JW results for sparse graphs. The full depth bound and its dependence on d and N must be derived. (Circuit complexity section)

minor comments (1)

[Abstract] Clarify the exact number of auxiliary fermions per mode and whether it scales with d; the O(dN) total is stated but the per-mode count is not derived in the abstract.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments, which have improved the rigor and clarity of the manuscript. We address each major comment below and have revised the paper to incorporate explicit arguments and derivations where needed.

read point-by-point responses

Referee: [Encoding construction and invariance argument] The central claim that the auxiliary fermion state remains invariant under every encoded Trotter term for arbitrary d-regular graphs lacks an explicit subspace-closure argument (e.g., a projector onto the auxiliary subspace or direct verification that each encoded operator maps the subspace to itself). This invariance is load-bearing for removing the O(log N) overhead; without it, leakage would restore multiplicative cost after O(1) steps. (Encoding section and invariance proof)

Authors: We agree that an explicit subspace-closure argument strengthens the presentation. In the revised manuscript, we have added a dedicated subsection in the Encoding section that defines the auxiliary subspace via a projector and verifies by direct computation that each encoded Trotter term maps the subspace to itself for any interaction graph of maximum degree d. This confirms invariance holds for the full evolution with no leakage, justifying the additive overhead. revision: yes
Referee: [Circuit depth and complexity analysis] The abstract asserts asymptotic optimality and reduction to additive overhead, yet supplies no derivation, error analysis, or explicit circuit-depth expressions comparing the encoded Trotter steps (including preparation cost) to prior JW results for sparse graphs. The full depth bound and its dependence on d and N must be derived. (Circuit complexity section)

Authors: We have expanded the Circuit complexity section with a full derivation. Each encoded Trotter step has depth O(d) on all-to-all connectivity after one-time preparation of O(dN) ancillas (depth O(dN)). For K Trotter steps with error epsilon the total depth is O(dK + dN), which is asymptotically optimal and reduces the prior multiplicative O(log N) factor to additive O(dN). We include error analysis showing preparation is amortized for long times and explicit comparisons to standard Jordan-Wigner results for sparse graphs. revision: yes

Circularity Check

0 steps flagged

No significant circularity in auxiliary-fermion encoding derivation

full rationale

The paper introduces a new encoding that augments each of the N fermionic modes with auxiliary fermions to cancel Jordan-Wigner strings for d-regular sparse interactions. The central claim—that the auxiliary state remains invariant under encoded Trotter steps, converting a multiplicative O(log N) overhead into an additive O(dN) cost—follows directly from the explicit construction of the encoding operators rather than from any fitted parameter, self-referential definition, or load-bearing self-citation. No step in the provided abstract reduces the target performance metric to an input by construction; the invariance is presented as a verifiable algebraic property of the chosen auxiliary subspace for arbitrary sparse graphs. The derivation is therefore self-contained against external benchmarks of circuit depth for fermionic simulation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The claim depends on standard quantum circuit assumptions and the invariance property of the auxiliary state; no free parameters or invented entities with independent evidence are stated in the abstract.

axioms (1)

domain assumption Trotterized time evolution accurately approximates the continuous dynamics for the models considered
The paper studies circuit depth for Trotterized evolution, implicitly assuming the Trotter error is controlled separately.

invented entities (1)

Auxiliary fermions no independent evidence
purpose: To augment physical modes and remove Jordan-Wigner strings
New entities introduced in the encoding; no independent falsifiable prediction is given in the abstract.

pith-pipeline@v0.9.0 · 5473 in / 1232 out tokens · 28930 ms · 2026-05-16T21:21:14.085373+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel (J(x) = ½(x + x⁻¹) − 1 is the unique calibrated reciprocal cost) unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

the auxiliary fermion state remains invariant under time evolution... P^(ℓ)_ij |Ψ_aux⟩ = + |Ψ_aux⟩ for every relevant stabilizer
IndisputableMonolith/Foundation/DimensionForcing.lean alexander_duality_circle_linking (D=3 forced by linking) unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Depth(W^M) = O(χ log χ + χ log N + M χ log χ) ... matches fermionic hardware up to constant factors

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

80 extracted references · 80 canonical work pages · 2 internal anchors

[1]

constructing the stabilizers P (ℓ) ij , such that they can eliminate the JW strings for all present interaction terms in the initial Hamiltonian,

work page
[2]

The condition Eq

efficiently preparing the initial state on the auxil- iary modes |Ψaux⟩, such that: P (ℓ) ij |Ψaux⟩ = + |Ψaux⟩ (10) for every relevant stabilizer P (ℓ) ij . The condition Eq. (10) asserts that the physics of the initial Hamiltonian remain unchanged, and the auxiliary state remains invariant: e−iτ hij P (ℓ) ij |Ψaux⟩ |Ψphys⟩ = |Ψaux⟩ e−iτ hij |Ψphys⟩ . (11...

work page
[3]

Olson, Matthias Degroote, Peter D

Yudong Cao, Jonathan Romero, Jonathan P. Olson, Matthias Degroote, Peter D. Johnson, M´ aria Kieferov´ a, Ian D. Kivlichan, Tim Menke, Borja Peropadre, Nicolas P. D. Sawaya, Sukin Sim, Libor Veis, and Al´ an Aspuru- Guzik. Quantum chemistry in the age of quantum com- puting. Chemical Reviews, 119(19):10856–10915, August

work page
[4]

doi:10.1021/acs.chemrev.8b00803

ISSN 1520-6890. doi:10.1021/acs.chemrev.8b00803

work page doi:10.1021/acs.chemrev.8b00803
[5]

Benjamin, and Xiao Yuan

Sam McArdle, Suguru Endo, Al´ an Aspuru-Guzik, Si- mon C. Benjamin, and Xiao Yuan. Quantum computa- tional chemistry. Rev. Mod. Phys., 92:015003, Mar 2020. doi:10.1103/RevModPhys.92.015003

work page doi:10.1103/revmodphys.92.015003 2020
[6]

Santos, and Evan Sheridan

Laura Clinton, Toby Cubitt, Brian Flynn, Filippo Maria Gambetta, Joel Klassen, Ashley Montanaro, Stephen Piddock, Raul A. Santos, and Evan Sheridan. Towards near-term quantum simulation of materials.Nature Com- munications, 15(1), January 2024. ISSN 2041-1723. doi: 10.1038/s41467-023-43479-6

work page doi:10.1038/s41467-023-43479-6 2024
[7]

Interacting electrons and quantum mag- netism

Assa Auerbach. Interacting electrons and quantum mag- netism. Springer Science & Business Media, 2012

work page 2012
[8]

The Hubbard Model: A Computational Perspective

Mingpu Qin, Thomas Sch¨ afer, Sabine Andergassen, Philippe Corboz, and Emanuel Gull. The hubbard model: A computational perspective. Annual Review of Con- densed Matter Physics, 13(1):275–302, March 2022. ISSN 1947-5462. doi:10.1146/annurev-conmatphys-090921- 033948

work page doi:10.1146/annurev-conmatphys-090921- 2022
[9]

Cooling in strongly corre- lated optical lattices: prospects and challenges

D C McKay and B DeMarco. Cooling in strongly corre- lated optical lattices: prospects and challenges. Reports on Progress in Physics , 74(5):054401, April 2011. ISSN 1361-6633. doi:10.1088/0034-4885/74/5/054401

work page doi:10.1088/0034-4885/74/5/054401 2011
[10]

Brown, Giuseppe Carleo, Lin- coln D

Ehud Altman, Kenneth R. Brown, Giuseppe Carleo, Lin- coln D. Carr, Eugene Demler, Cheng Chin, Brian De- Marco, Sophia E. Economou, Mark A. Eriksson, Fu, et al. Quantum simulators: Architectures and opportunities. PRX Quantum , 2(1), February 2021. ISSN 2691-3399. doi:10.1103/prxquantum.2.017003

work page doi:10.1103/prxquantum.2.017003 2021
[11]

Young, Martin Lebrat, and Markus Greiner

Muqing Xu, Lev Haldar Kendrick, Anant Kale, Youqi Gang, Chunhan Feng, Shiwei Zhang, Aaron W. Young, Martin Lebrat, and Markus Greiner. A neutral-atom hubbard quantum simulator in the cryogenic regime. Na- ture, 642(8069):909–915, 2025. doi:10.1038/s41586-025- 09112-w

work page doi:10.1038/s41586-025- 2025
[12]

Abanin, Laleh Aghababaie- Beni, et al

Rajeev Acharya, Dmitry A. Abanin, Laleh Aghababaie- Beni, et al. Quantum error correction below the surface code threshold. Nature, 638(8052):920–926, December

work page
[13]

doi:10.1038/s41586-024-08449-y

ISSN 1476-4687. doi:10.1038/s41586-024-08449-y

work page doi:10.1038/s41586-024-08449-y
[14]

Anthony Ransford, M. S. Allman, Jake Arkinstall, J. P. Campora III, Samuel F. Cooper, Robert D. Delaney, Joan M. Dreiling, Brian Estey, Caroline Figgatt, Alex Hall, Ali A. Husain, Akhil Isanaka, Colin J. Kennedy, Nikhil Kotibhaskar, et al. Helios: A 98-qubit trapped- ion quantum computer, 2025. URL https://arxiv.org/ abs/2511.05465

work page internal anchor Pith review Pith/arXiv arXiv 2025
[15]

Pro- grammable digital quantum simulation of 2d fermi- hubbard dynamics using 72 superconducting qubits,

Faisal Alam, Jan Lukas Bosse, Ieva ˇCepait˙ e, Adrian Chapman, Laura Clinton, Marcos Crichigno, Elizabeth 7 Crosson, Toby Cubitt, Charles Derby, et al. Pro- grammable digital quantum simulation of 2d fermi- hubbard dynamics using 72 superconducting qubits,

work page
[16]

URL https://arxiv.org/abs/2510.26845

work page arXiv
[17]

Quantum singular value transformation and be- yond: exponential improvements for quantum matrix arithmetics

Andr´ as Gily´ en, Yuan Su, Guang Hao Low, and Nathan Wiebe. Quantum singular value transformation and be- yond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , STOC 2019, page 193–204, New York, NY, USA, 2019. Asso- ciation for Computing Machinery. ISBN 9781450367059...

work page doi:10.1145/3313276.3316366 2019
[18]

Childs, Yuan Su, Minh C

Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu. Theory of trotter error with commutator scaling. Phys. Rev. X, 11:011020, Feb 2021. doi:10.1103/PhysRevX.11.011020

work page doi:10.1103/physrevx.11.011020 2021
[19]

Millis, Matthew B

Bela Bauer, Dave Wecker, Andrew J. Millis, Matthew B. Hastings, and Matthias Troyer. Hybrid quantum- classical approach to correlated materials. Phys. Rev. X, 6:031045, Sep 2016. doi:10.1103/PhysRevX.6.031045

work page doi:10.1103/physrevx.6.031045 2016
[20]

J. M. Kreula, S. R. Clark, and D. Jaksch. Non-linear quantum-classical scheme to simulate non-equilibrium strongly correlated fermionic many-body dynamics. Sci- entific Reports, 6(1):1–7, 2016. ISSN 20452322. doi: 10.1038/srep32940

work page doi:10.1038/srep32940 2016
[21]

Construction of Green’s functions on a quantum computer: Quasiparticle spectra of molecules

Taichi Kosugi and Yu Ichiro Matsushita. Construction of Green’s functions on a quantum computer: Quasiparticle spectra of molecules. Phys. Rev. A, 101(1):012330, 2020. ISSN 24699934. doi:10.1103/PhysRevA.101.012330

work page doi:10.1103/physreva.101.012330 2020
[22]

Wild, Mari Carmen Ba˜ nuls, and J

Esther Cruz, Dominik S. Wild, Mari Carmen Ba˜ nuls, and J. Ignacio Cirac. Quantum simulation of dynamical response functions of equilibrium states. Phys. Rev. A , 112:032610, Sep 2025. doi:10.1103/lpz2-j7vg

work page doi:10.1103/lpz2-j7vg 2025
[23]

Ignacio Cirac

Sirui Lu, Mari Carmen Ba˜ nuls, and J. Ignacio Cirac. Algorithms for quantum simulation at finite ener- gies. PRX Quantum , 2:020321, May 2021. doi: 10.1103/PRXQuantum.2.020321

work page doi:10.1103/prxquantum.2.020321 2021
[24]

Quantum mechanics: two volumes bound as one

Albert Messiah. Quantum mechanics: two volumes bound as one. Dover Publications, Inc, Garden City, New York,

work page
[25]

ISBN 978-0-486-78455-7

work page
[26]

Bounds for the adiabatic approximation with applica- tions to quantum computation

Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler. Bounds for the adiabatic approximation with applica- tions to quantum computation. Journal of Mathemat- ical Physics , 48(10):102111, 10 2007. ISSN 0022-2488. doi:10.1063/1.2798382

work page doi:10.1063/1.2798382 2007
[27]

Tameem Albash and Daniel A. Lidar. Adiabatic quantum computation. Rev. Mod. Phys., 90:015002, Jan 2018. doi: 10.1103/RevModPhys.90.015002

work page doi:10.1103/revmodphys.90.015002 2018
[28]

Peruzzo, J

Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man- Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al´ an Aspuru- Guzik, and Jeremy L. O’Brien. A variational eigen- value solver on a photonic quantum processor. Nature Communications, 5(1), July 2014. ISSN 2041-1723. doi: 10.1038/ncomms5213

work page doi:10.1038/ncomms5213 2014
[29]

Reports986, 1–128, DOI: 10.1016/j.physrep.2022.08.003 (2022)

Jules Tilly, Hongxiang Chen, Shuxiang Cao, Dario Pi- cozzi, Kanav Setia, Ying Li, Edward Grant, Leonard Wossnig, Ivan Rungger, George H. Booth, and Jonathan Tennyson. The variational quantum eigensolver: A review of methods and best practices. Physics Re- ports, 986:1–128, November 2022. ISSN 0370-1573. doi: 10.1016/j.physrep.2022.08.003

work page doi:10.1016/j.physrep.2022.08.003 2022
[30]

Jordan, Hari Krovi, Keith S

Stephen P. Jordan, Hari Krovi, Keith S. M. Lee, and John Preskill. BQP-completeness of scattering in scalar quan- tum field theory. Quantum, 2:44, January 2018. ISSN 2521-327X. doi:10.22331/q-2018-01-08-44

work page doi:10.22331/q-2018-01-08-44 2018
[31]

Bravyi and Alexei Yu

Sergey B. Bravyi and Alexei Yu. Kitaev. Fermionic quan- tum computation. Annals of Physics , 298(1):210–226, May 2002. ISSN 0003-4916. doi:10.1006/aphy.2002.6254

work page doi:10.1006/aphy.2002.6254 2002
[32]

Zache, Peter Zoller, Adam M

Robert Ott, Daniel Gonz´ alez-Cuadra, Torsten V. Zache, Peter Zoller, Adam M. Kaufman, and Hannes Pichler. Error-corrected fermionic quantum processors with neu- tral atoms, 2024. URL https://arxiv.org/abs/2412. 16081

work page 2024
[33]

Schuckert, E

Alexander Schuckert, Eleanor Crane, Alexey V. Gor- shkov, Mohammad Hafezi, and Michael J. Gullans. Fault- tolerant fermionic quantum computing, 2025. URL https://arxiv.org/abs/2411.08955

work page arXiv 2025
[34]

¨Uber das paulische ¨ aquivalenzverbot.Zeitschrift f¨ ur Physik, 47(9):631–651, 1928

Pascual Jordan and Eugene Wigner. ¨Uber das paulische ¨ aquivalenzverbot.Zeitschrift f¨ ur Physik, 47(9):631–651, 1928

work page 1928
[35]

On the locality of qubit encodings of local fermionic modes

Tommaso Guaita. On the locality of qubit encodings of local fermionic modes. Quantum, 9:1644, February 2025. ISSN 2521-327X. doi:10.22331/q-2025-02-25-1644

work page doi:10.22331/q-2025-02-25-1644 2025
[36]

Low-depth quantum simulation of materials

Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain, Hartmut Neven, and Garnet Kin-Lic Chan. Low-depth quantum simulation of materials. Physical Review X , 8(1), March 2018. ISSN 2160-3308. doi: 10.1103/physrevx.8.011044

work page doi:10.1103/physrevx.8.011044 2018
[37]

Kivlichan, Jarrod McClean, Nathan Wiebe, Craig Gidney, Al´ an Aspuru-Guzik, Garnet Kin-Lic Chan, and Ryan Babbush

Ian D. Kivlichan, Jarrod McClean, Nathan Wiebe, Craig Gidney, Al´ an Aspuru-Guzik, Garnet Kin-Lic Chan, and Ryan Babbush. Quantum simulation of electronic structure with linear depth and connectiv- ity. Phys. Rev. Lett. , 120:110501, Mar 2018. doi: 10.1103/PhysRevLett.120.110501

work page doi:10.1103/physrevlett.120.110501 2018
[38]

Nishad Maskara, Marcin Kalinowski, Daniel Gonzalez- Cuadra, and Mikhail D. Lukin. Fast simulation of fermions with reconfigurable qubits, 2025. URL https: //arxiv.org/abs/2509.08898

work page arXiv 2025
[39]

Childs, Michael J

Nathan Constantinides, Jeffery Yu, Dhruv Devulapalli, Ali Fahimniya, Andrew M. Childs, Michael J. Gullans, Alexander Schuckert, and Alexey V. Gorshkov. Simu- lating fermions with exponentially lower overhead, 2025. URL https://arxiv.org/abs/2510.05099

work page arXiv 2025
[40]

Mapping local hamiltonians of fermions to local hamiltonians of spins

F Verstraete and J I Cirac. Mapping local hamiltonians of fermions to local hamiltonians of spins. Journal of Statistical Mechanics: Theory and Experiment, 2005(09): P09012–P09012, September 2005. ISSN 1742-5468. doi: 10.1088/1742-5468/2005/09/p09012

work page doi:10.1088/1742-5468/2005/09/p09012 2005
[41]

Whitfield

Kanav Setia, Sergey Bravyi, Antonio Mezzacapo, and James D. Whitfield. Superfast encodings for fermionic quantum simulation. Physical Review Re- search, 1(3), October 2019. ISSN 2643-1564. doi: 10.1103/physrevresearch.1.033033

work page doi:10.1103/physrevresearch.1.033033 2019
[42]

Majorana loop stabilizer codes for error mit- igation in fermionic quantum simulations

Zhang Jiang, Jarrod McClean, Ryan Babbush, and Hart- mut Neven. Majorana loop stabilizer codes for error mit- igation in fermionic quantum simulations. Physical Re- view Applied , 12(6), December 2019. ISSN 2331-7019. doi:10.1103/physrevapplied.12.064041

work page doi:10.1103/physrevapplied.12.064041 2019
[43]

& Cubitt, T

Charles Derby, Joel Klassen, Johannes Bausch, and Toby Cubitt. Compact fermion to qubit mappings. Physi- cal Review B , 104(3), July 2021. ISSN 2469-9969. doi: 10.1103/physrevb.104.035118

work page doi:10.1103/physrevb.104.035118 2021
[44]

Chien, Kanav Setia, Xavier Bonet-Monroig, Mark Steudtner, and James D

Riley W. Chien, Kanav Setia, Xavier Bonet-Monroig, Mark Steudtner, and James D. Whitfield. Simulating quantum error mitigation in fermionic encodings, 2023. URL https://arxiv.org/abs/2303.02270

work page arXiv 2023
[45]

Landahl and Benjamin C

Andrew J. Landahl and Benjamin C. A. Morrison. Logi- cal fermions for fault-tolerant quantum simulation, 2023. 8 URL https://arxiv.org/abs/2110.10280

work page arXiv 2023
[46]

72.Yu, J., Liu, Y ., Sugiura, S., Van V oorhis, T

Teodor Parella-Dilm´ e, Korbinian Kottmann, Leonardo Zambrano, Luke Mortimer, Jakob S. Kottmann, and An- tonio Ac´ ın. Reducing entanglement with physically in- spired fermion-to-qubit mappings. PRX Quantum , 5: 030333, Aug 2024. doi:10.1103/PRXQuantum.5.030333

work page doi:10.1103/prxquantum.5.030333 2024
[47]

Ultrafast hybrid fermion-to-qubit mapping

Oliver O’Brien and Sergii Strelchuk. Ultrafast hybrid fermion-to-qubit mapping. Phys. Rev. B , 109:115149, Mar 2024. doi:10.1103/PhysRevB.109.115149

work page doi:10.1103/physrevb.109.115149 2024
[48]

Algaba, P

Manuel G. Algaba, P. V. Sriluckshmy, Martin Leib, and Fedor ˇSimkovic IV. Low-depth simulations of fermionic systems on square-grid quantum hardware. Quantum, 8: 1327, April 2024. ISSN 2521-327X. doi:10.22331/q-2024- 04-30-1327

work page doi:10.22331/q-2024- 2024
[49]

K. S. Tikhonov and A. D. Mirlin. Statistics of eigen- states near the localization transition on random reg- ular graphs. Phys. Rev. B , 99:024202, Jan 2019. doi: 10.1103/PhysRevB.99.024202

work page doi:10.1103/physrevb.99.024202 2019
[50]

Garc´ ıa-Garc´ ıa, Yiyang Jia, Dario Rosa, and Jacobus J

Antonio M. Garc´ ıa-Garc´ ıa, Yiyang Jia, Dario Rosa, and Jacobus J. M. Verbaarschot. Sparse sachdev- ye-kitaev model, quantum chaos, and gravity du- als. Phys. Rev. D , 103:106002, May 2021. doi: 10.1103/PhysRevD.103.106002

work page doi:10.1103/physrevd.103.106002 2021
[51]

Optimizing sparse fermionic Hamil- tonians

Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, and Barbara Terhal. Optimizing sparse fermionic Hamil- tonians. Quantum, 7:1081, August 2023. ISSN 2521- 327X. doi:10.22331/q-2023-08-10-1081

work page doi:10.22331/q-2023-08-10-1081 2023
[52]

Karcher, Konstantin S

Jan-Niklas Herre, Jonas F. Karcher, Konstantin S. Tikhonov, and Alexander D. Mirlin. Ergodicity- to-localization transition on random regular graphs with large connectivity and in many-body quantum dots. Phys. Rev. B , 108:014203, Jul 2023. doi: 10.1103/PhysRevB.108.014203

work page doi:10.1103/physrevb.108.014203 2023
[53]

Tsironis and Efthimios Kaxiras

G.P. Tsironis and Efthimios Kaxiras. Quantum dynam- ics on tight binding small world networks and flat band spectra. Physics Letters A, 497:129330, 2024. ISSN 0375-

work page 2024
[54]

doi:10.1016/j.physleta.2024.129330

work page doi:10.1016/j.physleta.2024.129330 2024
[55]

Dalzell, Mario Berta, Fer- nando G

Chi-Fang Chen, Alexander M. Dalzell, Mario Berta, Fer- nando G. S. L. Brand˜ ao, and Joel A. Tropp. Sparse ran- dom hamiltonians are quantumly easy. Phys. Rev. X, 14: 011014, Feb 2024. doi:10.1103/PhysRevX.14.011014

work page doi:10.1103/physrevx.14.011014 2024
[56]

Even though there are νN fermion modes, since the relative ordering of the modes on each site remains un- changed, we only require O(log N) staricase permuta- tions to permute them

work page
[57]

The ancillas required for the fermion permutation can be reused during the preparation of C(ℓ) ord

work page
[58]

Ancilla- Free Quantum Adder with Sublinear Depth , page 137–154

Maxime Remaud and Vivien Vandaele. Ancilla- Free Quantum Adder with Sublinear Depth , page 137–154. Springer Nature Switzerland, 2025. ISBN 9783031970634. doi:10.1007/978-3-031-97063-4˙11

work page doi:10.1007/978-3-031-97063-4 2025
[59]

On an estimate of the chromatic class of a p-graph

Vadim G Vizing. On an estimate of the chromatic class of a p-graph. Diskret analiz, 3:25–30, 1964

work page 1964
[60]

Quantum Circuits: Fanout, Parity, and Counting

Cristopher Moore. Quantum circuits: Fanout, par- ity, and counting, 1999. URL https://arxiv.org/abs/ quant-ph/9903046

work page internal anchor Pith review Pith/arXiv arXiv 1999
[61]

Quantum lower bounds for fanout, 2003

Maosen Fang, Stephen Fenner, Frederic Green, Steven Homer, and Yong Zhang. Quantum lower bounds for fanout, 2003. URL https://arxiv.org/abs/quant-ph/ 0312208

work page 2003
[62]

Maldacena and D

Juan Maldacena and Douglas Stanford. Remarks on the sachdev-ye-kitaev model. Physical Review D, 94(10), November 2016. ISSN 2470-0029. doi: 10.1103/physrevd.94.106002

work page doi:10.1103/physrevd.94.106002 2016
[63]

Asymptotic be- havior of the chromatic index for hypergraphs

Nicholas Pippenger and Joel Spencer. Asymptotic be- havior of the chromatic index for hypergraphs. Journal of Combinatorial Theory, Series A , 51(1):24–42, 1989. ISSN 0097-3165. doi:10.1016/0097-3165(89)90074-5. Appendix A: Detailed JW transformations In this appendix we show how to use the stabilizers P (ℓ) ij to cancel the long JW strings of non-local h...

work page doi:10.1016/0097-3165(89)90074-5 1989
[64]

Using (4) a† i aj + a† jai = j−1Y n=i νY k=0 Z(k) n ! 2X(0) i X(0) j + 2Y(0) i Y(0) j 4 = 1 2 X(0) i X(0) j + Y(0) i Y(0) j j−1Y n=i νY k=0 Z(k) n !

Hopping term We begin with the hopping term between two arbitrary sites i < j . Using (4) a† i aj + a† jai = j−1Y n=i νY k=0 Z(k) n ! 2X(0) i X(0) j + 2Y(0) i Y(0) j 4 = 1 2 X(0) i X(0) j + Y(0) i Y(0) j j−1Y n=i νY k=0 Z(k) n ! . (A1) This is the standard JW form of the hopping term: a two-qubit operator on the physical modes at sites i and j multiplied ...

work page
[65]

For this term no transformation is necessary because ni is already local in the JW representation

Interaction terms Here we consider Fermi–Hubbard (FH) type density– density interaction ninj with ni = a† i ai. For this term no transformation is necessary because ni is already local in the JW representation. ni = a† i ai = 1 2(1 + Z(0) i ). (A5) The FH density–density term ninj is therefore a product of single-site operators in the JW representation an...

work page
[66]

(A8) It will be the building block for transforming four-fermion (and higher) interaction terms

Identity for a† i P (ℓ) ij aj We consider the term a† i P (ℓ) ij aj a† i P (ℓ) ij aj = Si X(0) i + iY(0) i 2 ! −i SiZi,<ℓX(ℓ) i SjZj,<ℓY(ℓ) j × (A6) × Sj X(0) j − iY(0) j 2 ! = − i 4 SiSiSjSj(X(0) i + iY(0) i )Zi,<ℓX(ℓ) i × Zj,<ℓY(ℓ) j (X(0) j − iY(0) j ) (A7) = − i 4(Zi,<ℓZj,<ℓ)X(ℓ) i Y(ℓ) j × h X(0) i X(0) j + Y(0) i Y(0) j − i(X(0) i Y(0) j − Y(0) i X(...

work page
[67]

(A10) We assume that the indicesi, j, k, l are such that the pairs (i, k) and ( j, l) correspond to existing stabilizers (if they do not, we add the edges to the interaction graph)

T ransformation of four-fermion terms We now consider a generic chemistry-style four-fermion interaction term of the form hijkl = a† i a† jakal + a† l a† kajai. (A10) We assume that the indicesi, j, k, l are such that the pairs (i, k) and ( j, l) correspond to existing stabilizers (if they do not, we add the edges to the interaction graph). We transform h...

work page
[68]

The terms do not necessarily need to be number preserving, the stabilizers allow to eliminate the JW strings in any case

Arbitrary Interaction terms The same approach as in Appendix A 3 can further be used to eliminate the JW strings from any even fermion term by suitably introducing the stabilizers P (ℓ) ij . The terms do not necessarily need to be number preserving, the stabilizers allow to eliminate the JW strings in any case. By equivalent arguments as above, a general ...

work page
[69]

Here each γ(0) i can be either the c(0) i or d(0) i Majorana operator

SYK terms A term that appears in the SYK model (see Appendix F 2) is the four-Majorana operator γ(0) i γ(0) j γ(0) k γ(0) l . Here each γ(0) i can be either the c(0) i or d(0) i Majorana operator. We show that it can be transformed to a constant-weight Pauli term by multi- plication with the stabilizers. We choose to transform it as: γ(0) i γ(0) j γ(0) k ...

work page
[70]

Given a Hamiltonian Hhop on N modes we construct a graph G = ( V, E) with |V | = N

Constructing the interaction graph Firstly, it is trivial to generate a hopping Hamiltonian. Given a Hamiltonian Hhop on N modes we construct a graph G = ( V, E) with |V | = N. The graph G encodes the locality pattern: we assume that ( i, j) ∈ E exactly when the hopping term between sites i and j is present (tij ̸= 0). However, one might also be intereste...

work page
[71]

pick one stabilizer configuration that simplifies the higher order terms

work page
[72]

This strategy works for creating an appropriate (albeit not unique) interaction graph

for each stabilizer P (ℓ) ij that we require, we add an edge (i, j) to E, if it is not already present. This strategy works for creating an appropriate (albeit not unique) interaction graph. We do not concern our- selves with finding the best possible solution here. In the next section, we assume that we are given an instance of such an interaction graph ...

work page
[73]

An edge coloring is a map col : E → {1,

Edge coloring and auxiliary layers To assign commuting stabilizers, we use a proper edge coloring of the graph G. An edge coloring is a map col : E → {1, . . . , χ} (C2) such that no two edges incident on the same vertex share the same color. The minimum number χ of colors for which such a coloring exists is the chromatic index (or edge chromatic number) ...

work page
[74]

A graph G = (V, E) is d− regular if each v ∈ V belong to exactly d edges in E

Regular graph properties A relevant example of sparse interactions graphs are the d−regular graphs. A graph G = (V, E) is d− regular if each v ∈ V belong to exactly d edges in E. For regular graphs, it is possible to bound their chro- matic index χ using the Vizing’s theorem [52]: d ≤ χ ≤ d + 1. (C15) Appendix D: Ordered state circuit construction In Sect...

work page
[75]

To embed it into a unitary we introduce an additional auxiliary qubit: U(ℓ) ij = |0⟩ ⟨0|anc ⊗ c(ℓ) i + |1⟩ ⟨1|anc ⊗ (−id(ℓ) j )

Mapping to a unitary First, note that the operation c(ℓ) i −id(ℓ) j√ 2 is not unitary. To embed it into a unitary we introduce an additional auxiliary qubit: U(ℓ) ij = |0⟩ ⟨0|anc ⊗ c(ℓ) i + |1⟩ ⟨1|anc ⊗ (−id(ℓ) j ). (D1) One can verify that U(ℓ)† ij U(ℓ) ij = U(ℓ) ij U(ℓ)† ij = = |0⟩ ⟨0|anc ⊗ c(ℓ)2 i + |1⟩ ⟨1|anc ⊗ d(ℓ)2 j = |0⟩ ⟨0|anc ⊗ 1 + |1⟩ ⟨1|anc ⊗ ...

work page
[76]

To try that, let us first try to simplify C(ℓ) ord (Eq

Circuit decomposition of the ordered state preparation Having showed how we can initialize the respective state, let us show how we can prepare an efficient cir- cuit in the ordered case. To try that, let us first try to simplify C(ℓ) ord (Eq. (19)) in the qubit picture: 2 N 4 C(ℓ) ord = N/2Y k=1 (S2k−1Z2k−1,<ℓX(ℓ) 2k−1 + iS2kZ2k,<ℓY(ℓ) 2k ) = N/2Y k=1 S2...

work page
[77]

This also straight- forwardly extends to higher order fermion interactions

Commutator bounds Consider the commutator bounds on the transformed Hamiltonian:h ˜hij, ˜hkl i = h hijP (ℓ) ij , hklP (ℓ′) kl i = [hij, hkl]P (ℓ) ij P (ℓ′) kl , (E1) 14 since the projectors commute with themselves (our con- struction) and the physical operators. This also straight- forwardly extends to higher order fermion interactions. Thus, h ˜hij, ˜hkl...

work page
[78]

Such an evolution can be imple- mented with a single qubit rotation, conjugated between a n−qubit CNOT staircase (Pauli gadget method)

Implementing n−qubit evolution Consider an evolution of a Hamiltonian term sup- ported on n−qubits. Such an evolution can be imple- mented with a single qubit rotation, conjugated between a n−qubit CNOT staircase (Pauli gadget method). Such a CNOT ladder can be implemented with a O(log(n)) depth circuit without any ancillas [51]. Thus, any evolu- tion of ...

work page
[79]

(F2) On a d−regular graph d ≤ χ ≤ d + 1 (see Appendix C 3), thus we need at most ν = ⌈(d + 1)/2⌉ ancillary fermions per site

F ermi–Hubbard model Consider a Fermi–Hubbard model on a d−regular graph G = (V, E), meaning that each vertex v ∈ V has exactly d edges: HFH = Hhop + Hint = (F1) = X (i,j)∈E tij (a† i aj + a† jai) + X (i,j)∈E Vija† i aia† jaj. (F2) On a d−regular graph d ≤ χ ≤ d + 1 (see Appendix C 3), thus we need at most ν = ⌈(d + 1)/2⌉ ancillary fermions per site. Even...

work page
[80]

No assumption is made on the dis- tribution of the couplings Je, which may be arbitrary

SYK model We consider a quartic Sachdev–Ye–Kitaev (SYK) type Hamiltonian [55] acting onN Majorana fermions {γi}N i=1, HSYK = X e∈E Je Y i∈e γi, (F6) where E denotes the edge set of a 4-uniform hypergraph, such that each interaction term involves exactly four fermionic operators. No assumption is made on the dis- tribution of the couplings Je, which may be...

work page