pith. machine review for the scientific record. sign in

arxiv: 2605.10943 · v1 · submitted 2026-05-11 · 🪐 quant-ph · cond-mat.str-el· cs.IT· math-ph· math.IT· math.MG· math.MP

Recognition: 2 theorem links

· Lean Theorem

A passive self-correcting quantum memory in three dimensions

Shankar Balasubramanian , Margarita Davydova , Ting-Chun Lin
Authors on Pith no claims yet

Pith reviewed 2026-05-12 03:20 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-elcs.ITmath-phmath.ITmath.MGmath.MP
keywords self-correcting quantum memory3D stabilizer codesfinite-temperature stabilitypassive error correctionPauli Hamiltonianrecursive constructionquantum information encoding
0
0 comments X

The pith

A 3D Pauli stabilizer Hamiltonian encodes a qubit for exponential time at finite temperature.

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

The paper constructs a three-dimensional Hamiltonian built from Pauli operators whose ground states can hold a qubit of quantum information. It begins with a basic seed Hamiltonian and applies a sequence of transformations that raise the energy barrier protecting the information. These steps keep all interactions local within a three-dimensional space. A sympathetic reader would care because typical quantum memories lose information quickly to thermal noise unless actively corrected at every step, while this approach aims for passive protection that lasts exponentially longer as the system grows.

Core claim

We construct a 3D Pauli stabilizer Hamiltonian whose ground state space can encode a qubit for exponential time when coupled to a bath at non-zero temperature. Our construction recursively applies a sequence of transformations to a seed Hamiltonian that increases the memory lifetime of the encoded qubit while maintaining geometric locality in R^3.

What carries the argument

The recursive sequence of transformations applied to a seed Hamiltonian that raises the barrier against logical errors while preserving three-dimensional geometric locality.

If this is right

  • The encoded qubit remains protected against thermal errors for times exponential in the linear system size.
  • The full Hamiltonian stays strictly local with interactions confined to a three-dimensional lattice.
  • The ground-state degeneracy continues to encode exactly one logical qubit after each transformation.
  • No active syndrome measurements or corrections are required to maintain the information.

Where Pith is reading between the lines

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

  • The same recursive method might be adapted to construct memories that protect multiple qubits or higher-weight logical operators.
  • If the energy barrier scales as expected, the construction could be tested in small lattices using numerical simulations of thermal dynamics.
  • Related recursive enlargements may apply to other classes of local Hamiltonians beyond Pauli stabilizers.

Load-bearing premise

The sequence of transformations can be repeated without introducing new error channels, losing locality in three dimensions, or reducing the encoded information capacity.

What would settle it

A computation of the logical error rate in the final Hamiltonian that shows lifetime grows only polynomially rather than exponentially with system size at fixed nonzero temperature.

Figures

Figures reproduced from arXiv: 2605.10943 by Margarita Davydova, Shankar Balasubramanian, Ting-Chun Lin.

Figure 1
Figure 1. Figure 1: An illustration of the perturbation step and its effect on the embedding density. [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Local effect of the degree reduction step. On the left, we show a toy example of degree [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An illustration of the replacement process. A square [PITH_FULL_IMAGE:figures/full_fig_p026_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A schematic illustration of the nodes and edges in the decoding graph. It contains subgraphs [PITH_FULL_IMAGE:figures/full_fig_p044_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The syndrome σ is supported on the level-i complex C(i) , while the coarse-grained syndrome σ ′ is supported on the level-(i − 1) complex C(i−1). 1. Defining the coarse-grained syndrome σ ′ : Recall that C 2 (i) ∼= C 2 Z = L z C 2 z , and Cz ≜ (C • (Yz))T . Thus, the syndrome σ ∈ C 2 (i) decomposes as σ = X z∈VZ,(i−1) σ|Yz (129) where σ|Yz denotes the restriction of σ to the local complex Yz, viewed as a v… view at source ↗
Figure 6
Figure 6. Figure 6: Decomposition of a piece Yx,j associated with a face j ∈ Xx(2). Each piece consists of Yx,j,0 (gray) and Yx,j,1 (orange), corresponding to layers 0 and 1, together with Yx,j,left (pink) and Yx,j,right (purple) which connect the two layers. Proof of Lemma 4.8. We fix x and drop the subscript x throughout the proof; for example, σx ∈ C 2 x and f ∈ C 1 x will be denoted as σ and f. The complex Yx decomposes i… view at source ↗
Figure 7
Figure 7. Figure 7: An example of pairing syndromes on a piece [PITH_FULL_IMAGE:figures/full_fig_p052_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Illustration of the contribution to g 1 xq(f) from crossings of the interfaces. Each crossing involves qubits supported on the interface, which induce syndrome outside Yx through g 1 xq. Crossings along the left–right interface contribute weight 2, while crossings along other interfaces contribute weight 1. • If b = 0, the possible unpaired syndromes in Yx,j,0 and Yx,j,1 can be paired by a string crossing … view at source ↗
Figure 9
Figure 9. Figure 9: An example of complex Cq illustrating the regions mid, ∂, and int. Proof. Recall that δ 1 i = δ 1 loc +g 1 XQ +g 1 QZ, where g 1 XQ : C 1 X → C 2 Q and g 1 QZ : C 1 Q → C 2 Z . Then, we write |σ2| = [PITH_FULL_IMAGE:figures/full_fig_p057_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Left: the orange points indicate the syndrome at level [PITH_FULL_IMAGE:figures/full_fig_p063_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: The first two iterations for ℓ = 4, showing X(0), X(1), and X(2). Black edges are obtained from scaling and copying X(0). Purple edges are the new cylinder edges added in X(1), and brown edges are the new cylinder edges added in X(2). Every lattice point that appears as a degree-2 or degree-3 vertex in the figure indeed represents a vertex of the complex incident to all adjacent edges shown. By contrast, … view at source ↗
Figure 12
Figure 12. Figure 12: The first two iterations for ℓ = 4, showing C(0), C(1) = RRep(C(0)), C(2) = RPar(C(1)). 71 [PITH_FULL_IMAGE:figures/full_fig_p071_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Illustration of the pictorial conventions used in the figures, in particular the three different [PITH_FULL_IMAGE:figures/full_fig_p075_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: The doubling step for a unit square in X(i) in the simple case. near the boundary of the scaled square, so the candidate ribs can still be defined in the middle. We illustrate this point with another example. Example 6.6. We direct the reader to [PITH_FULL_IMAGE:figures/full_fig_p077_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: The doubling step with a perturbed scaled square. [PITH_FULL_IMAGE:figures/full_fig_p078_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: The doubling step for two overlapping squares. [PITH_FULL_IMAGE:figures/full_fig_p079_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: The three types of simple local structures in [PITH_FULL_IMAGE:figures/full_fig_p080_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: The three types of local configurations near the attaching regions: T-junctions, glued [PITH_FULL_IMAGE:figures/full_fig_p080_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: A schematic diagram showing how local structures transforms under refinement (in pink) [PITH_FULL_IMAGE:figures/full_fig_p081_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: Examples of the non-square faces appearing in the gadgets associated with T-junctions. [PITH_FULL_IMAGE:figures/full_fig_p083_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: This gadget depicts how a doubled T-junction is perturbed in the first step of one iteration. [PITH_FULL_IMAGE:figures/full_fig_p084_21.png] view at source ↗
Figure 22
Figure 22. Figure 22: This gadget depicts how a doubled T-junction is perturbed in the first step of the iteration [PITH_FULL_IMAGE:figures/full_fig_p085_22.png] view at source ↗
Figure 23
Figure 23. Figure 23: This gadget depicts how a doubled T-junction is perturbed in the first step of one iteration, [PITH_FULL_IMAGE:figures/full_fig_p085_23.png] view at source ↗
Figure 24
Figure 24. Figure 24: This gadget depicts how a doubled glued cross is perturbed in the first step of the iteration [PITH_FULL_IMAGE:figures/full_fig_p086_24.png] view at source ↗
Figure 25
Figure 25. Figure 25: This gadget depicts how a doubled free cross is perturbed in the first step of the iteration [PITH_FULL_IMAGE:figures/full_fig_p086_25.png] view at source ↗
Figure 26
Figure 26. Figure 26: The gadgets describing the doubling structure near a T-junction. The blue medium-thick [PITH_FULL_IMAGE:figures/full_fig_p088_26.png] view at source ↗
Figure 27
Figure 27. Figure 27: The gadgets describing the doubling structure near a glued cross. The blue medium-thick [PITH_FULL_IMAGE:figures/full_fig_p088_27.png] view at source ↗
Figure 28
Figure 28. Figure 28: The gadgets describing the doubling structure near a free cross. The blue and green [PITH_FULL_IMAGE:figures/full_fig_p088_28.png] view at source ↗
Figure 29
Figure 29. Figure 29: A subcomplex of a T-junction. Compared with Figure [PITH_FULL_IMAGE:figures/full_fig_p089_29.png] view at source ↗
Figure 30
Figure 30. Figure 30: Another subcomplex of a T-junction. Compared with Figure [PITH_FULL_IMAGE:figures/full_fig_p089_30.png] view at source ↗
read the original abstract

We construct a 3D Pauli stabilizer Hamiltonian whose ground state space can encode a qubit for exponential time when coupled to a bath at non-zero temperature. Our construction recursively applies a sequence of transformations to a seed Hamiltonian that increases the memory lifetime of the encoded qubit while maintaining geometric locality in $\mathbb{R}^3$.

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.

Referee Report

1 major / 0 minor

Summary. The manuscript describes the construction of a three-dimensional Pauli stabilizer Hamiltonian obtained through recursive transformations applied to a seed Hamiltonian. The resulting system is claimed to have a ground state degeneracy that encodes a logical qubit with an exponentially long lifetime when the system is coupled to a thermal bath at finite temperature, while preserving geometric locality in R^3.

Significance. Should the construction be shown to work as described, it would be of high significance to the field of quantum error correction, as passive self-correcting memories in three dimensions have been elusive due to various no-go results. The recursive method could provide a pathway to overcome dimensional constraints if the details support the claims of locality preservation and error channel control.

major comments (1)
  1. [Abstract] No explicit definition is given for the seed Hamiltonian or the sequence of recursive transformations. Without these, it is not possible to confirm that each step maintains strict 3-locality in three dimensions or that the logical operators remain protected by a system-size-dependent energy barrier, as required for the exponential lifetime claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We are grateful to the referee for their thorough review of our work. Below we respond to the major comment and outline the changes we will implement in the revised manuscript.

read point-by-point responses

  1. Referee: [Abstract] No explicit definition is given for the seed Hamiltonian or the sequence of recursive transformations. Without these, it is not possible to confirm that each step maintains strict 3-locality in three dimensions or that the logical operators remain protected by a system-size-dependent energy barrier, as required for the exponential lifetime claim.

    Authors: The referee correctly notes that the abstract does not include explicit definitions of the seed Hamiltonian or the recursive transformations. These are defined in detail in the main body of the manuscript. To address this concern, we will revise the abstract to provide a concise description of the seed Hamiltonian and the sequence of transformations, ensuring that the claims regarding locality and the energy barrier are better contextualized. We believe this will allow readers to better appreciate the construction without immediately referring to the full text. The analysis of the energy barrier and lifetime is presented in the subsequent sections. revision: yes

Circularity Check

0 steps flagged

No derivation chain or equations supplied; abstract states existence of recursive construction without definitions

full rationale

The available text is limited to the abstract, which asserts that a 3D Pauli stabilizer Hamiltonian is obtained by recursively applying transformations to a seed Hamiltonian to achieve exponential memory lifetime while preserving locality. No seed Hamiltonian, transformation rules, equations, or self-citations appear. Without any explicit steps or relations, no load-bearing claim can be quoted that reduces to its own inputs by construction, self-definition, fitted prediction, or imported uniqueness. The central claim is an existence statement whose verification would require the missing details; it does not exhibit circularity on inspection.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Based solely on the abstract; no explicit free parameters, axioms, or invented entities are detailed. The construction relies on standard quantum stabilizer formalism and locality assumptions implicit in 3D Pauli Hamiltonians.

axioms (1)
  • standard math Pauli stabilizer formalism and geometric locality in R^3
    The Hamiltonian is specified as a 3D Pauli stabilizer code, which presupposes these standard elements of quantum error correction.

pith-pipeline@v0.9.0 · 5326 in / 1133 out tokens · 62496 ms · 2026-05-12T03:20:30.556665+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

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

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

37 extracted references · 37 canonical work pages

  1. [1]

    Topological quantum memory

    Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill. Topological quantum memory. Journal of Mathematical Physics, 43(9):4452–4505, 2002

    work page 2002

  2. [2]

    Quantum memories at finite temperature.Reviews of Modern Physics, 88(4):045005, 2016

    Benjamin J Brown, Daniel Loss, Jiannis K Pachos, Chris N Self, and James R Wootton. Quantum memories at finite temperature.Reviews of Modern Physics, 88(4):045005, 2016

    work page 2016

  3. [3]

    On thermal stability of topological qubit in Kitaev’s 4D model.Open Systems & Information Dynamics, 17(01):1–20, 2010

    Robert Alicki, Michal Horodecki, Pawel Horodecki, and Ryszard Horodecki. On thermal stability of topological qubit in Kitaev’s 4D model.Open Systems & Information Dynamics, 17(01):1–20, 2010

    work page 2010

  4. [4]

    On thermalization in Kitaev’s 2D model

    Robert Alicki, Mark Fannes, and Michal Horodecki. On thermalization in Kitaev’s 2D model. Journal of Physics A: Mathematical and Theoretical, 42(6):065303, 2009

    work page 2009

  5. [5]

    A no-go theorem for a two-dimensional self-correcting quan- tum memory based on stabilizer codes.New Journal of Physics, 11(4):043029, 2009

    Sergey Bravyi and Barbara Terhal. A no-go theorem for a two-dimensional self-correcting quan- tum memory based on stabilizer codes.New Journal of Physics, 11(4):043029, 2009

    work page 2009

  6. [6]

    Feasibility of self-correcting quantum memory and thermal stability of topological order.Annals of Physics, 326(10):2566–2633, 2011

    Beni Yoshida. Feasibility of self-correcting quantum memory and thermal stability of topological order.Annals of Physics, 326(10):2566–2633, 2011

    work page 2011

  7. [7]

    Local stabilizer codes in three dimensions without string logical operators

    Jeongwan Haah. Local stabilizer codes in three dimensions without string logical operators. Physical Review A—Atomic, Molecular, and Optical Physics, 83(4):042330, 2011

    work page 2011

  8. [8]

    Quantum self-correction in the 3d cubic code model.Physical review letters, 111(20):200501, 2013

    Sergey Bravyi and Jeongwan Haah. Quantum self-correction in the 3d cubic code model.Physical review letters, 111(20):200501, 2013

    work page 2013

  9. [9]

    Topological order and memory time in marginally-self-correcting quantum memory.Physical Review A, 95(3):032324, 2017

    Karthik Siva and Beni Yoshida. Topological order and memory time in marginally-self-correcting quantum memory.Physical Review A, 95(3):032324, 2017

    work page 2017

  10. [10]

    Commuting Pauli Hamiltonians as maps between free modules.Communications in Mathematical Physics, 324(2):351–399, 2013

    Jeongwan Haah. Commuting Pauli Hamiltonians as maps between free modules.Communications in Mathematical Physics, 324(2):351–399, 2013. 100

    work page 2013

  11. [11]

    3d topological quantum memory with a power-law energy barrier.Physical review letters, 113(13):130501, 2014

    Kamil P Michnicki. 3d topological quantum memory with a power-law energy barrier.Physical review letters, 113(13):130501, 2014

    work page 2014

  12. [12]

    Local quantum codes from subdivided manifolds, 2023

    Elia Portnoy. Local quantum codes from subdivided manifolds, 2023. URL:https://arxiv. org/abs/2303.06755,arXiv:2303.06755

    work page arXiv 2023

  13. [13]

    Geometrically local quantum and classical codes from subdivision.arXiv preprint arXiv:2309.16104, 2023

    Ting-Chun Lin, Adam Wills, and Min-Hsiu Hsieh. Geometrically local quantum and classical codes from subdivision.arXiv preprint arXiv:2309.16104, 2023

    work page arXiv 2023

  14. [14]

    Layer codes.arXiv preprint arXiv:2309.16503, 2023

    Dominic J Williamson and Nou´ edyn Baspin. Layer codes.arXiv preprint arXiv:2309.16503, 2023

    work page arXiv 2023

  15. [15]

    Layer codes as partially self-correcting quantum memories.arXiv preprint arXiv:2510.06659, 2025

    Shouzhen Gu, Libor Caha, Shin Ho Choe, Zhiyang He, Aleksander Kubica, and Eugene Tang. Layer codes as partially self-correcting quantum memories.arXiv preprint arXiv:2510.06659, 2025

    work page arXiv 2025

  16. [16]

    Partial self-correction in layer codes.arXiv preprint arXiv:2510.09218, 2025

    Dominic J Williamson. Partial self-correction in layer codes.arXiv preprint arXiv:2510.09218, 2025

    work page arXiv 2025

  17. [17]

    The Free Energy Barrier: An Eyring-Polanyi bound for stabilizer Hamiltonians, with applications to quantum error correction.arXiv preprint arXiv:2509.17356, 2025

    Nou´ edyn Baspin. The Free Energy Barrier: An Eyring-Polanyi bound for stabilizer Hamiltonians, with applications to quantum error correction.arXiv preprint arXiv:2509.17356, 2025

    work page arXiv 2025

  18. [18]

    A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less).New Journal of Physics, 18(1):013050, 2016

    Courtney G Brell. A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less).New Journal of Physics, 18(1):013050, 2016

    work page 2016

  19. [19]

    Spontaneous magnetization of the Ising model on the Sierpinski carpet fractal, a rigorous result.Journal of Physics A: Mathematical and General, 36(6):1593, 2003

    Alessandro Vezzani. Spontaneous magnetization of the Ising model on the Sierpinski carpet fractal, a rigorous result.Journal of Physics A: Mathematical and General, 36(6):1593, 2003

    work page 2003

  20. [20]

    Proposals for 3d self-correcting quantum memory.arXiv preprint arXiv:2411.03115, 2024

    Ting-Chun Lin, Hsin-Po Wang, and Min-Hsiu Hsieh. Proposals for 3d self-correcting quantum memory.arXiv preprint arXiv:2411.03115, 2024

    work page arXiv 2024

  21. [21]

    Generalizations of the Kolmogorov–Barzdin embedding es- timates.Duke Mathematical Journal, 161(13):2549–2603, 2012

    Misha Gromov and Larry Guth. Generalizations of the Kolmogorov–Barzdin embedding es- timates.Duke Mathematical Journal, 161(13):2549–2603, 2012. URL:https://doi.org/10. 1215/00127094-1812840

    work page 2012

  22. [22]

    Thermodynamic stability criteria for a quantum memory based on stabilizer and subsystem codes.New Journal of Physics, 12(2):025013, 2010

    Stefano Chesi, Daniel Loss, Sergey Bravyi, and Barbara M Terhal. Thermodynamic stability criteria for a quantum memory based on stabilizer and subsystem codes.New Journal of Physics, 12(2):025013, 2010. URL:https://arxiv.org/abs/0907.2807

    work page arXiv 2010

  23. [23]

    Hastings, and Spyridon Michalakis

    Sergey Bravyi, Matthew B. Hastings, and Spyridon Michalakis. Topological quantum order: Stability under local perturbations.Journal of Mathematical Physics, 51(9), 2010. URL:http: //dx.doi.org/10.1063/1.3490195,doi:10.1063/1.3490195

    work page doi:10.1063/1.3490195 2010

  24. [24]

    Domain walls from SPT-sewing

    Yabo Li, Zijian Song, Aleksander Kubica, and Isaac H Kim. Domain walls from SPT-sewing. arXiv preprint arXiv:2411.11967, 2024

    work page arXiv 2024

  25. [25]

    Rapid mixing for Gibbs states within a logical sector: a dynamical view of self-correcting quantum memories

    Thiago Bergamaschi, Reza Gheissari, and Yunchao Liu. Rapid mixing for Gibbs states within a logical sector: a dynamical view of self-correcting quantum memories. InProceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3407–3422. SIAM, 2026

    work page 2026

  26. [26]

    Breuckmann, and Quynh T

    Anurag Anshu, Nikolas P. Breuckmann, and Quynh T. Nguyen. Circuit-to-hamiltonian from tensor networks and fault tolerance. InProceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC ’24, page 585–595. ACM, 2024. URL:http://dx.doi.org/10. 1145/3618260.3649690,doi:10.1145/3618260.3649690. 101

    work page doi:10.1145/3618260.3649690 2024

  27. [27]

    Transform arbitrary good quantum ldpc codes into good geometrically local codes in any dimension.arXiv preprint arXiv:2408.01769, 2024

    Xingjian Li, Ting-Chun Lin, and Min-Hsiu Hsieh. Transform arbitrary good quantum ldpc codes into good geometrically local codes in any dimension.arXiv preprint arXiv:2408.01769, 2024

    work page arXiv 2024

  28. [28]

    Unified framework for quantum code embedding.Physical Review A, 113(2):022438, 2026

    Andrew C Yuan. Unified framework for quantum code embedding.Physical Review A, 113(2):022438, 2026

    work page 2026

  29. [29]

    homological perturbation theory.https://ncatlab.org/nlab/show/ homological+perturbation+theory, April 2026

    nLab authors. homological perturbation theory.https://ncatlab.org/nlab/show/ homological+perturbation+theory, April 2026. Revision 13

    work page 2026

  30. [30]

    Williamson

    David Aasen, Daniel Bulmash, Abhinav Prem, Kevin Slagle, and Dominic J. Williamson. Topological defect networks for fractons of all types.Physical Review Research, 2(4), Oc- tober 2020. URL:http://dx.doi.org/10.1103/PhysRevResearch.2.043165,doi:10.1103/ physrevresearch.2.043165

    work page doi:10.1103/physrevresearch.2.043165 2020

  31. [31]

    First and Tali Kaufman

    Uriya A. First and Tali Kaufman. On good 2-query locally testable codes from sheaves on high dimensional expanders, 2024. URL:https://arxiv.org/abs/2208.01778,arXiv:2208.01778

    work page arXiv 2024

  32. [32]

    Maximally extendable sheaf codes, 2024

    Pavel Panteleev and Gleb Kalachev. Maximally extendable sheaf codes, 2024. URL:https: //arxiv.org/abs/2403.03651,arXiv:2403.03651

    work page arXiv 2024

  33. [33]

    Transversalnon-cliffordgatesforquan- tum ldpc codes on sheaves,

    Ting-Chun Lin. Transversal non-clifford gates for quantum ldpc codes on sheaves, 2024. URL: https://arxiv.org/abs/2410.14631,arXiv:2410.14631

    work page arXiv 2024

  34. [34]

    Poincar\’e duality and multiplicative structures on quantum codes.arXiv preprint arXiv:2512.21922, 2025

    Yiming Li, Zimu Li, Zi-Wen Liu, and Quynh T Nguyen. Poincar\’e duality and multiplicative structures on quantum codes.arXiv preprint arXiv:2512.21922, 2025

    work page arXiv 2025

  35. [35]

    A constructive proof of the general Lov´ asz local lemma

    Robin A Moser and G´ abor Tardos. A constructive proof of the general Lov´ asz local lemma. Journal of the ACM (JACM), 57(2):1–15, 2010. URL:https://dl.acm.org/doi/abs/10.1145/ 1667053.1667060

    work page arXiv 2010

  36. [36]

    Rothblum, and Salil P

    Robin A Moser. A constructive proof of the Lov´ asz local lemma. InProceedings of the forty-first annual ACM symposium on Theory of computing, pages 343–350, 2009. URL:https://dl.acm. org/doi/abs/10.1145/1536414.1536462

    work page doi:10.1145/1536414.1536462 2009

  37. [37]

    Deterministic algorithms for the lov´ asz local lemma.SIAM Journal on Computing, 42(6):2132–2155, 2013

    Karthekeyan Chandrasekaran, Navin Goyal, and Bernhard Haeupler. Deterministic algorithms for the lov´ asz local lemma.SIAM Journal on Computing, 42(6):2132–2155, 2013. 102

    work page 2013