Pith. sign in

REVIEW 4 major objections 4 minor 1 cited by

This paper presents 2D and 3D fermion-to-qubit stabilizer codes whose distance can be made arbitrarily large while stabilizer weights stay constant and logical operators stay local, and it claims the 3D construction is the first to achieve

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

A new family of fermion-to-qubit stabilizer codes in 2D and 3D achieves arbitrarily large code distance with constant-weight stabilizers and local logical operators, with the 3D construction being the first of its kind.

T0 review reviewed 2026-08-05 challenge →

load-bearing objection Plausible and potentially important 2D/3D fermion-to-qubit code construction, but the advertised arbitrary-distance claim rests on an unproven deformation step; worth refereeing, not worth citing as a theorem yet. the 4 major comments →

arxiv 2509.00147 v1 pith:UZEMTRJT submitted 2025-08-29 quant-ph

High-Distance Error-Correcting Codes for Fermion-to-Qubit Mappings in 2D and 3D

Ruby Wei , Aqua Chung , Luke Coffman , Su-Kuan Chu , Xun Gao This is my paper
classification quant-ph PACS 03.67.Pp03.67.Lx
keywords fermion-to-qubit mappingstabilizer codesfermionic color codesquantum error correctionquantum simulationlocality-preserving encoding3D fermionic systemsconcatenated codes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The reading

The paper tries to show that fermionic systems can be simulated on qubit lattices with codes that get arbitrarily good at detecting errors while keeping practical costs fixed: stabilizer weights do not grow with distance, and local fermionic operators map to local qubit operators. It constructs such codes in both two and three dimensions, and claims the 3D code is the first to combine these three properties at once. The construction concatenates a small-distance fermion-to-qubit code with a high-distance fermionic color code, embedding many color-code blocks into one shared square or cubic lattice so that logical fermions anticommute correctly. If the construction is right, it gives a scalable route to robust quantum simulation of 2D and 3D fermionic Hamiltonians.

Core claim

The central claim is that a two-level concatenation yields a fermion-to-qubit stabilizer code whose overall distance d_Fq = Theta(d_Ff d_fq) can be made arbitrarily large while the stabilizers keep constant weight and logical Majorana operators stay local for any fixed distance. The inner code maps physical fermions to qubits using local hopping and occupation operators; the outer code is a 2D fermionic color code of distance d_Ff, whose logical Majorana operators are products of physical Majorana operators. Multiple color-code blocks are deformed and embedded into the same lattice, which is essential for preserving anticommutation between logical fermions. In 3D, a stacked construction with

What carries the argument

The load-bearing machinery is a concatenation of two layers: a small-distance fermion-to-qubit mapping in which physical fermions emerge as excitations of a stabilizer code on qubits, and a fermionic color code—a Majorana-fermion code whose logical operators are products of physical Majorana operators placed on the vertices of a color-code lattice—used as the high-distance outer layer. The key innovation is the shared-lattice embedding: multiple deformed color-code blocks are placed on the same square or cubic lattice, with padding vertices between them, instead of on separate lattices, so that logical fermions supported on different blocks can still anticommute. The distance grows with the

Load-bearing premise

The advertised distance scaling rests on the assumption that deforming and embedding the color-code blocks into the square or cubic lattice does not create low-weight logical operators; if a deformed block admitted a logical operator much lighter than d_Ff, the claimed large distance would collapse.

What would settle it

Numerically enumerate all logical Pauli operators of the embedded code for a moderate color-code distance such as d_Ff = 7 or 9. If any operator commutes with all stabilizers and has weight smaller than Theta(d_Ff d_fq), the construction has a logical error path the paper does not account for; in 3D, the same check can be run on the stacked code with d_fq = 3.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • At any fixed target distance, a local fermionic Hamiltonian maps to a local qubit Hamiltonian, so simulations do not incur long-range interaction overhead.
  • The overall distance can be increased by enlarging the color-code blocks while stabilizer weights stay at O(d_fq), making experimentally plausible error rates plausible at larger distances.
  • In 3D the construction achieves Theta(1/d_Fq^2) encoding rate, better than the one-dimensional Majorana-chain elongation approach, which costs Theta(1/d^3) in 3D.
  • With d_Ff of order log(N_F), the paper's concatenated-decoder argument predicts the logical failure rate stays constant as the number of simulated fermionic sites grows.
  • The paper notes that fault-tolerant protocols for the logical hopping and occupation operators are still missing, so an optimal distance may exist for near-term simulation because larger logical operators require larger circuits.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same two-level recipe should work with any small-distance fermion-to-qubit map that supplies emergent fermions, so the construction may generalize to honeycomb or other hardware geometries without redoing the distance argument.
  • The paper treats extensive-weight Pauli Z loops and membranes as negligible under stochastic noise; testing the proposed concatenated decoder numerically could show that practical memory lifetimes are better than the adversarial distance suggests.
  • Embedding only 2D fermionic color codes caps the 3D encoding rate at inverse-square scaling; using higher-dimensional fermionic codes or non-stacked layouts may push closer to the known geometric tradeoff bound for 3D storage.
  • A direct test of the distance claim would be to brute-force search for logical operators on deformed blocks at moderate color-code distances, where any operator below Theta(d_Ff d_fq) would expose a gap in the deformation argument.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes 2D and 3D fermion-to-qubit stabilizer codes obtained by concatenating a small-distance emergent-fermion-to-qubit mapping (d_fq=2 in 2D, d_fq=3 in 3D) with high-distance 2D fermionic color codes. Multiple color-code blocks are deformed and embedded into a shared square or cubic lattice, with padding and plaquette-type stabilizers. The paper claims that the resulting codes have arbitrarily large code distance d_Fq = Θ(d_Ff d_fq), constant stabilizer weights, and locality-preserving logical operators, and that the 3D construction is the first to combine these properties. The logical Majorana operators are products of physical Majorana operators on color-code blocks, and nontrivial Pauli Z loops/membranes that commute with all stabilizers are discussed in Appendix B.

Significance. If the distance claim were rigorously established, the 3D construction would be a notable advance: it would provide the first locality-preserving 3D fermion-to-qubit mapping with arbitrarily large distance and constant-weight stabilizers. The concatenation idea and the shared-lattice embedding of color-code blocks are conceptually appealing and are supported by explicit small-distance examples. The paper also gives a concrete encoding-rate comparison and a plausible decoder strategy. However, the advertised distance scaling is not proven at the required level of rigor; the construction is explicitly checked only for d_Ff=5, and several load-bearing steps are asserted rather than demonstrated. The significance is therefore conditional on closing these gaps.

major comments (4)
  1. [Sec. II B and Fig. 2] The general deformation and embedding of 2D fermionic color codes onto a square lattice is only illustrated for d_Ff=5. The caption states that the same principle can be applied to larger distances, but no general construction is given and no proof is supplied that the deformation/embedding preserves the color-code distance. This is load-bearing: the claim d_Fq=Θ(d_Ff) requires that every embedded block has logical Majorana operators of weight at least d_Ff and that no low-weight representatives are introduced by the deformation.
  2. [Sec. II D, Eq. (12)] The distance lower-bound argument is heuristic. From the fact that a logical operator acts on at least d_Ff physical fermions, the paper infers a Pauli-weight lower bound of Ω(d_Ff). This inference is not justified: Pauli representatives can be shortened by stabilizer equivalences, by cancellations in the small-distance mapping, or by nontrivial deformations of the color code. The statement that 'for a fermion to occupy a vertex, Pauli operators must act on at least one of the edges connected to that vertex' does not rule out such shortenings. A rigorous proof of the lower bound is needed for the central claim.
  3. [Appendix B] Appendix B shows that nontrivial Pauli Z loops (2D) and membranes (3D) commute with all stabilizers and are thus logical operators. The paper dismisses them because their weight scales as Θ(√N_F d_Ff), saying this 'exceeds the weights of our logical hopping and occupation operators.' However, no inequality with explicit constants is given. For fixed N_F, this weight is Θ(d_Ff), the same asymptotic order as the intended logical operators; the distance is the minimum over all logical operators, so these operators must be included in the distance calculation. If N_F grows with d_Ff, the Z-loop/membrane weight is even larger in order and could set a worse upper bound. The manuscript needs to prove that these operators do not reduce the distance, or define the code family so that the issue is controlled.
  4. [Sec. III B] The 3D stacking argument is asserted rather than proven. The statement that d_Ff is identical to the distance of one 2D color-code block, and that the Sec. II D proof 'remains valid in 3D,' does not address logical operators that run along the z direction, that pass between layers, or that combine low-weight operators from multiple layers. Appendix B discusses only extensive Z membranes; this does not exclude other logical operators. A rigorous distance analysis for the stacked code is required before the 3D claim can be accepted.
minor comments (4)
  1. [Fig. 3] The caption states that the numbering of vertices in Fig. 3(a) does not correspond to the numbering in Fig. 2, which makes it difficult to verify the stabilizer and logical-operator mappings. Please align the numbering or add a translation table.
  2. [Eqs. (10) and (11)] The three expressions for γ_a^L and for γ̃_a^L are written as equalities. It should be stated explicitly that these expressions are equal only up to stabilizers and signs, and preferably which stabilizers are used.
  3. [Sec. II D] The formula |T_ab^L| ≥ (5/2)d_Ff − 1/2 is stated without derivation. Including one explicit calculation for a representative logical hopping operator would help the reader verify the constant and the scaling.
  4. [Abstract] The phrase 'arbitrarily large code distances' is ambiguous: it should specify whether the distance is increased for a fixed number of logical fermionic sites or in a family where N_F also grows. In light of Appendix B, this distinction matters for the distance statement.

Circularity Check

0 steps flagged

No significant circularity: the construction is concatenative, uses external prior codes as building blocks, and contains no fitted-input-as-prediction or self-citation chain.

full rationale

The paper's derivation chain is a code construction: take a known small-distance fermion-to-qubit mapping (Refs [12,13,21], none authored by the present authors), take a known high-distance fermionic color code (Refs [43-46]), concatenate, and bound the distance by the color-code distance. Eq. (12), d_Fq = Θ(d_Ff d_fq), is a derived estimate: the parametrization is explicit (logical operators of the color code become products of physical Majoranas; physical Majoranas are in turn Pauli strings), and no parameter is fitted to a target output, nor is the target distance inserted as an assumption. The central worry—whether deforming/embedding the 2D color code blocks into square/cubic lattices preserves d_Ff for arbitrary d_Ff—is a genuine mathematical gap (the paper illustrates d_Ff=5 and asserts the principle; the Sec. II D argument assumes logical operators contain at least d_Ff physical fermions and addresses nontrivial Z loops only by dismissing their weight as Θ(√(N_F) d_Ff), which for fixed N_F is the same order), but that is a correctness/rigor risk, not circularity: it does not make the conclusion equivalent to its premise. The paper also self-identifies its open points (decoder thresholds rely on an expected argument; fault-tolerant implementation of logical operators is undeveloped). There is no self-citation load-bearing chain: the cited prior results are externally developed and used as ingredients, not invoked to define the present claim. Hence score 0.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

The code relies on well-established fermion-to-qubit maps and color codes rather than on new physical postulates. The main unproven input is that the deformation/embedding preserves the color code distance for arbitrary d_Ff, and that global Z loops/membranes do not reduce the advertised distance scaling.

axioms (4)
  • standard math Stabilizer formalism and Majorana anticommutation relations
    Basis of the code construction throughout Secs II and III.
  • domain assumption Existence of small-distance fermion-to-qubit mappings with d_fq=2 (2D) and d_fq=3 (3D) as constructed in Refs [12,13,21]
    Used as the inner code in the concatenation (Sec II A, Sec III).
  • domain assumption 2D fermionic color codes have distance d_Ff and can be deformed onto square lattices without reducing distance
    Central to embedding logical fermions (Sec II B, Fig 2).
  • domain assumption The concatenated code's logical operators have weight Θ(d_Ff d_fq) and no other logical operator has lower weight
    Distance scaling claim d_Fq=Θ(d_Ff d_fq) in Eq (12); the proof in Sec II D is heuristic and discounts global Z loops/membranes.

reviewed 2026-08-05 · how reviews work

0 comments
Cite this review

Pith. "Pith review of High-Distance Error-Correcting Codes for Fermion-to-Qubit Mappings in 2D and 3D." pith.science (2026). https://pith.science/paper/UZEMTRJT

@misc{pith2026250900147,
  author       = {Pith},
  title        = {Pith review of: High-Distance Error-Correcting Codes for Fermion-to-Qubit Mappings in 2D and 3D},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UZEMTRJT}},
  note         = {Machine review of arXiv:2509.00147}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum simulation of fermionic systems is a leading application of quantum computers. One promising approach is to represent fermions with qubits via fermion-to-qubit mappings. In this work, we present high-distance fermion-to-qubit stabilizer codes for simulating 2D and 3D fermionic systems. These codes achieve arbitrarily large code distances while keeping stabilizer weights constant. They also preserve locality by mapping local fermionic operators to local qubit operators at any fixed distance. Notably, our 3D construction is the first to simultaneously achieve high distance, constant stabilizer weights, and locality preservation. Our construction is based on concatenating a small-distance 2D or 3D fermion-to-qubit code with a high-distance fermionic color code. Together, these features provide a robust and scalable pathway to quantum simulation of fermionic systems.

Figures

Figures reproduced from arXiv: 2509.00147 by Aqua Chung, Luke Coffman, Ruby Wei, Su-Kuan Chu, Xun Gao.

Figure 1
Figure 1. Figure 1: FIG. 1. Overview of our 2D and 3D fermion-to-qubit codes. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. (a) Embedding of a color code block into a square lat [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Mapping of the generators of stabilizers and logical operators in their minimum-weight representation, which may not [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. A mapping between 3D Pauli operators and the cor [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Summary of the generators of stabilizers and logical operators for our 3D fermion-to-qubit code. (a) Stabilizer [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. A complete list of all distinct 2D plaquette-type stabilizer generators from deforming the 2D color code, derived from [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. A complete list of all distinct plaquette-type stabilizer generators in our 3D code, derived from combining the mapping [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Nontrivial loops and membranes of Pauli [PITH_FULL_IMAGE:figures/full_fig_p017_8.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Evolving Quantum Error-Correcting Encodings for Molecular Simulation

    quant-ph 2026-06 conditional novelty 7.0

    LLM-driven evolutionary program synthesis discovers Generalized Superfast Encodings with exact distance 5 (and 6 on one instance) for molecular Hamiltonians, the first beyond distance 3.

Reference graph

Works this paper leans on

77 extracted references · 52 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    On the level of creating emergent physical fermions from qubits, we use a 3D mapping with distance df q = 3 in Ref. [13]. The stabilizers, hopping and occupation operators on this level are shown in Fig. 4

    work page

  2. [2]

    2—along the z-direction

    To simulate a 3D fermionic system on a cubic lat- tice, we stack multiple layers—each consisting of the 2D staggered arrangement of fermionic color codes shown in Fig. 2—along the z-direction. The distance of the formed “stacked” code, dF f, is iden- tical to the distance of one 2D color code block. +y +x +z Occupation at v: v vv, , a ab abb v(b) (a) Stab...

    work page

  3. [3]

    R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21, 467 (1982)

    1982

  4. [4]

    Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. John- son, M. Kieferov´ a, I. D. Kivlichan, T. Menke, B. Per- opadre, N. P. Sawaya, et al., Quantum chemistry in the age of quantum computing, Chem. Rev. 119, 10856 (2019)

    work page 2019

  5. [5]

    McArdle, S

    S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, Quantum computational chemistry, Rev. Mod. Phys. 92, 015003 (2020)

    2020

  6. [6]

    Jordan and E

    P. Jordan and E. Wigner, ¨Uber das Paulische ¨Aquivalenzverbot, Z. Phys. 47, 631 (1928)

    1928

  7. [7]

    Fradkin, Field Theories of Condensed Matter Physics, 2nd ed

    E. Fradkin, Field Theories of Condensed Matter Physics, 2nd ed. (Cambridge University Press, Cambridge, 2013)

    work page 2013

  8. [8]

    Nys and G

    J. Nys and G. Carleo, Quantum circuits for solving local fermion-to-qubit mappings, Quantum 7, 930 (2023)

    work page 2023

  9. [9]

    Bausch, T

    J. Bausch, T. Cubitt, C. Derby, and J. Klassen, Mitigat- ing errors in local fermionic encodings, arXiv:2003.07125

    Pith/arXiv arXiv 2003

  10. [10]

    Kobayashi, Y

    R. Kobayashi, Y. Li, H. Xue, P.-S. Hsin, and Y.-A. Chen, Generalized statistics on lattice, arXiv:2412.01886

    arXiv

  11. [11]

    Z. Li, D. Lee, and B. Yoshida, How much entanglement is needed for topological codes and mixed states with anomalous symmetry?, Phys. Rev. X 15, 021090 (2025)

    work page 2025

  12. [12]

    Guaita, On the locality of qubit encodings of local fermionic modes, Quantum 9 (2025)

    T. Guaita, On the locality of qubit encodings of local fermionic modes, Quantum 9 (2025)

    work page 2025

  13. [13]

    Verstraete and J

    F. Verstraete and J. I. Cirac, Mapping local Hamiltonians of fermions to local Hamiltonians of spins, J. Stat. Mech. 2005, P09012 (2005)

    work page 2005

  14. [14]

    Y.-A. Chen, A. Kapustin, and D. Radiˇ cevi´ c, Exact bosonization in two spatial dimensions and a new class of lattice gauge theories, Ann. Phys. 393, 234 (2018)

    work page 2018

  15. [15]

    Chen and A

    Y.-A. Chen and A. Kapustin, Bosonization in three spa- tial dimensions and a 2-form gauge theory, Phys. Rev. B 100, 245127 (2019)

    work page 2019

  16. [16]

    Jiang, J

    Z. Jiang, J. McClean, R. Babbush, and H. Neven, Majorana loop stabilizer codes for error mitigation in fermionic quantum simulations, Phys. Rev. Appl. 12, 064041 (2019)

    work page 2019

  17. [17]

    Setia, S

    K. Setia, S. Bravyi, A. Mezzacapo, and J. D. Whitfield, Superfast encodings for fermionic quantum simulation, Phys. Rev. Res. 1, 033033 (2019)

    work page 2019

  18. [18]

    Chen, Exact bosonization in arbitrary dimensions, Phys

    Y.-A. Chen, Exact bosonization in arbitrary dimensions, Phys. Rev. Res. 2, 033527 (2020)

    work page 2020

  19. [19]

    Derby, J

    C. Derby, J. Klassen, J. Bausch, and T. Cubitt, Compact fermion to qubit mappings, Phys. Rev. B 104, 035118 (2021)

    work page 2021

  20. [20]

    R. W. Chien and J. Klassen, Optimizing fermionic encodings for both Hamiltonian and hardware, arXiv:2210.05652

    Pith/arXiv arXiv

  21. [21]

    Chen and Y

    Y.-A. Chen and Y. Xu, Equivalence between fermion-to- 12 qubit mappings in two spatial dimensions, PRX Quan- tum 4, 010326 (2023)

    work page 2023

  22. [22]

    A. J. Landahl and B. C. A. Morrison, Logical fermions for fault-tolerant quantum simulation, arXiv:2110.10280

    Pith/arXiv arXiv

  23. [23]

    Y.-A. Chen, A. V. Gorshkov, and Y. Xu, Error-correcting codes for fermionic quantum simulation, SciPost Phys. 16, 033 (2024)

    2024

  24. [24]

    M. G. Algaba, P. V. Sriluckshmy, M. Leib, and F. ˇSimkovic IV, Low-depth simulations of fermionic sys- tems on square-grid quantum hardware, Quantum 8, 1327 (2024)

    work page 2024

  25. [25]

    ˇSimkovic IV, M

    F. ˇSimkovic IV, M. Leib, and F. R. F. Pereira, Low- weight high-distance error-correcting fermionic encod- ings, Phys. Rev. Res. 6, 043123 (2024)

    work page 2024

  26. [26]

    M. G. Algaba, M. Papiˇ c, I. de Vega, A. Calzona, and F. ˇSimkovic IV, Fermion-to-qubit encodings with arbi- trary code distance, arXiv:2505.02916

    Pith/arXiv arXiv

  27. [27]

    Wosiek, A local representation for fermions on a lattice, Acta Phys

    J. Wosiek, A local representation for fermions on a lattice, Acta Phys. Polon. B 13, 543 (1982)

    work page 1982

  28. [28]

    Ball, Fermions without fermion fields, Phys

    R. Ball, Fermions without fermion fields, Phys. Rev. Lett. 95, 176407 (2005)

    work page 2005

  29. [29]

    Kitaev, Anyons in an exactly solved model and be- yond, Ann

    A. Kitaev, Anyons in an exactly solved model and be- yond, Ann. Phys. 321, 2–111 (2006)

    work page 2006

  30. [30]

    T. C. Farrelly and A. J. Short, Causal fermions in discrete space-time, Phys. Rev. A 89, 012302 (2014)

    work page 2014

  31. [31]

    J. D. Whitfield, V. Havl ´ ıˇ cek, and M. Troyer, Local spin operators for fermion simulations, Phys. Rev. A 94, 030301 (2016)

    work page 2016

  32. [32]

    Steudtner and S

    M. Steudtner and S. Wehner, Quantum codes for quan- tum simulation of fermions on a square lattice of qubits, Phys. Rev. A 99, 022308 (2019)

    work page 2019

  33. [33]

    Bochniak and B

    A. Bochniak and B. Ruba, Bosonization based on Clifford algebras and its gauge theoretic interpretation, J. High Energy Phys. 2020 (118)

    work page 2020

  34. [34]

    H. C. Po, Symmetric Jordan-Wigner transformation in higher dimensions, arXiv:2107.10842

    work page internal anchor Pith review Pith/arXiv arXiv

  35. [35]

    Li and H

    K. Li and H. C. Po, Higher-dimensional jordan-wigner transformation and auxiliary majorana fermions, Phys. Rev. B 106, 115109 (2022)

    work page 2022

  36. [36]

    R. W. Chien, K. Setia, X. Bonet-Monroig, M. Steudtner, and J. D. Whitfield, Simulating quantum error mitigation in fermionic encodings, arXiv:2303.02270

    Pith/arXiv arXiv

  37. [37]

    Chiew and S

    M. Chiew and S. Strelchuk, Discovering optimal fermion- qubit mappings through algorithmic enumeration, Quan- tum 7, 1145 (2023)

    work page 2023

  38. [38]

    O’Brien and S

    O. O’Brien and S. Strelchuk, Ultrafast hybrid fermion- to-qubit mapping, Phys. Rev. B 109, 115149 (2024)

    work page 2024

  39. [39]

    Harrison, M

    B. Harrison, M. Chiew, J. Necaise, A. Projansky, S. Strelchuk, and J. D. Whitfield, A Sierpinski triangle fermion-to-qubit transform, arXiv:2409.04348

    Pith/arXiv arXiv

  40. [40]

    Y.-C. Chen, R. Wu, M. Cheng, and M.-H. Hsieh, Neu- ral network assisted fermionic compression encoding: A lossy-QSCI framework for scalable quantum chemistry simulations, arXiv:2505.17846

    work page arXiv

  41. [41]

    J. Xu, S. Chiesa, E. J. Walter, and S. Zhang, Magnetic order in the hubbard model in three dimensions and the crossover to two dimensions, Journal of Physics: Con- densed Matter 25, 415602 (2013)

    work page 2013

  42. [42]

    Armitage, E

    N. Armitage, E. Mele, and A. Vishwanath, Weyl and Dirac semimetals in three-dimensional solids, Rev. Mod. Phys. 90, 015001 (2018)

    2018

  43. [43]

    Bansil, M

    A. Bansil, M. Lindroos, S. Sahrakorpi, and R. S. Markiewicz, Influence of the third dimension of quasi- two-dimensional cuprate superconductors on angle- resolved photoemission spectra, Phys. Rev. B 71, 012503 (2005)

    work page 2005

  44. [44]

    A. N. Ciavarella, Quantum simulation of lattice QCD with improved Hamiltonians, Phys. Rev. D 108, 094513 (2023)

    work page 2023

  45. [45]

    Bravyi, B

    S. Bravyi, B. M. Terhal, and B. Leemhuis, Majorana fermion codes, New J. Phys. 12, 083039 (2010)

    2010

  46. [46]

    Vijay, T

    S. Vijay, T. H. Hsieh, and L. Fu, Majorana fermion sur- face code for universal quantum computation, Phys. Rev. X 5, 041038 (2015)

    2015

  47. [47]

    Litinski and F

    D. Litinski and F. von Oppen, Quantum computing with majorana fermion codes, Phys. Rev. B 97, 205404 (2018)

    work page 2018

  48. [48]

    Schuckert, E

    A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, Fermion-qubit fault-tolerant quantum computing, arXiv:2411.08955

    Pith/arXiv arXiv

  49. [49]

    Miller, Z

    A. Miller, Z. Zimbor´ as, S. Knecht, S. Maniscalco, and G. Garc ´ ıa-P´ erez, Bonsai algorithm: Grow your own fermion-to-qubit mappings, PRX Quantum 4, 030314 (2023)

    work page 2023

  50. [50]

    Jiang, A

    Z. Jiang, A. Kalev, W. Mruczkiewicz, and H. Neven, Op- timal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning, Quan- tum 4, 276 (2020)

    work page 2020

  51. [51]

    A. Y. Vlasov, Clifford algebras, spin groups and qubit trees, Quanta 11, 97–114 (2022)

    work page 2022

  52. [52]

    A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303, 2 (2003)

    2003

  53. [53]

    Bonet-Monroig, R

    X. Bonet-Monroig, R. Sagastizabal, M. Singh, and T. E. O’Brien, Low-cost error mitigation by symmetry verifi- cation, Phys. Rev. A 98, 062339 (2018)

    work page 2018

  54. [54]

    Nigmatullin, K

    R. Nigmatullin, K. H´ emery, K. Ghanem, S. Moses, D. Gresh, P. Siegfried, M. Mills, T. Gatterman, N. He- witt, E. Granet, and H. Dreyer, Experimental demon- stration of breakeven for a compact fermionic encoding, Nat. Phys. (2025)

    work page 2025

  55. [55]

    Papiˇ c, M

    M. Papiˇ c, M. G. Algaba, E. Godinez-Ramirez, I. de Vega, A. Auer, F. ˇSimkovic IV, and A. Calzona, Near-term fermionic simulation with subspace noise tailored quan- tum error mitigation, arXiv:2503.11785

    Pith/arXiv arXiv

  56. [56]

    Dyrenkova, R

    E. Dyrenkova, R. Laflamme, and M. Vasmer, Scalable simulation of fermionic encoding performance on noisy quantum computers, arXiv:2506.06425

    work page arXiv

  57. [57]

    M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010)

    2010

  58. [58]

    Bomb ´ ın, Single-shot fault-tolerant quantum error cor- rection, Phys

    H. Bomb ´ ın, Single-shot fault-tolerant quantum error cor- rection, Phys. Rev. X 5, 031043 (2015)

    work page 2015

  59. [59]

    A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Camp- bell, Single-shot error correction of three-dimensional homological product codes, PRX Quantum 2, 020340 (2021)

    work page 2021

  60. [60]

    Dennis, A

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topo- logical quantum memory, J. Math. Phys.43, 4452 (2002)

    2002

  61. [61]

    S.-T. Zhou, M. Cheng, T. Rakovszky, C. von Keyserlingk, and T. D. Ellison, Finite-temperature quantum topolog- ical order in three dimensions, arXiv:2503.02928

    Pith/arXiv arXiv

  62. [62]

    Bombin, Topological order with a twist: Ising anyons from an Abelian model, Phys

    H. Bombin, Topological order with a twist: Ising anyons from an Abelian model, Phys. Rev. Lett. 105, 030403 (2010)

    work page 2010

  63. [63]

    B. J. Brown, K. Laubscher, M. S. Kesselring, and J. R. Wootton, Poking holes and cutting corners to achieve Clifford gates with the surface code, Phys. Rev. X 7, 021029 (2017)

    work page 2017

  64. [64]

    Chen, Private communication, May 2025

    Y.-A. Chen, Private communication, May 2025. 13

    work page 2025

  65. [65]

    Bravyi and B

    S. Bravyi and B. Terhal, A no-go theorem for a two- dimensional self-correcting quantum memory based on stabilizer codes, New J. Phys. 11, 043029 (2009)

    work page 2009

  66. [66]

    Bravyi, D

    S. Bravyi, D. Poulin, and B. Terhal, Tradeoffs for reliable quantum information storage in 2D systems, Phys. Rev. Lett. 104, 050503 (2010)

    work page 2010

  67. [67]

    S. T. Flammia, J. Haah, M. J. Kastoryano, and I. H. Kim, Limits on the storage of quantum information in a volume of space, Quantum 1, 4 (2017)

    2017

  68. [68]

    Peruzzo, J

    A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nat. Commun. 5, 4213 (2014)

    2014

  69. [69]

    Kandala, A

    A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets, Nature 549, 242 (2017)

    2017

  70. [70]

    Aharonov, A

    D. Aharonov, A. Kitaev, and J. Preskill, Fault-tolerant quantum computation with long-range correlated noise, Phys. Rev. Lett. 96, 050504 (2006)

    2006

  71. [71]

    C. T. Chubb and S. T. Flammia, Statistical mechanical models for quantum codes with correlated noise, Ann. Inst. Henri Poincar´ e D8, 269–321 (2021)

    work page 2021

  72. [72]

    Sarvepalli and R

    P. Sarvepalli and R. Raussendorf, Efficient decoding of topological color codes, Phys. Rev. A 85, 022317 (2012)

    work page 2012

  73. [73]

    Kubica and N

    A. Kubica and N. Delfosse, Efficient color code decoders in d ≥ 2 dimensions from toric code decoders, Quantum 7, 929 (2023)

    work page 2023

  74. [74]

    S.-H. Lee, A. Li, and S. D. Bartlett, Color code decoder with improved scaling for correcting circuit-level noise, Quantum 9, 1609 (2025)

    work page 2025

  75. [75]

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86, 032324 (2012)

    2012

  76. [76]

    Takada and K

    Y. Takada and K. Fujii, Improving threshold for fault-tolerant color-code quantum computing by flagged weight optimization, PRX Quantum 5 (2024)

    work page 2024

  77. [77]

    14 2D Stabilizers: 3142 3344122 453162 3344122 41332 3412 44331122 31422 453612 44312 1423 13224 3142 3344122 453162 3344122 41332 3412 FIG

    Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638, 920–926 (2024). 14 2D Stabilizers: 3142 3344122 453162 3344122 41332 3412 44331122 31422 453612 44312 1423 13224 3142 3344122 453162 3344122 41332 3412 FIG. 6. A complete list of all distinct 2D plaquette-type stabilizer generators from deforming th...

    work page 2024

This paper was first reviewed by deepseek-v4-flash on August 5, 2026.