pith. sign in

arxiv: 2410.16250 · v2 · submitted 2024-10-21 · 🪐 quant-ph · cond-mat.str-el· math-ph· math.MP

Cups and Gates I: Cohomology invariants and logical quantum operations

Nikolas P. Breuckmann , Margarita Davydova , Jens N. Eberhardt , Nathanan Tantivasadakarn This is my paper

Pith reviewed 2026-05-23 18:27 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-elmath-phmath.MP
keywords CSS codescup productClifford hierarchylogical gatescohomologyquantum error correctionconstant-depth circuitscochain complexes
0
0 comments X

The pith

CSS codes equipped with cup products on cochain complexes produce constant-depth diagonal logical gates at any Clifford hierarchy level.

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

The paper establishes that cohomology invariants in CSS codes, viewed as cochain complexes, can be made to induce diagonal logical gates when the code carries a cup product structure. This structure relaxes the full axioms of a differential graded algebra while preserving enough algebraic features for the invariants to correspond to gates. The resulting gates are realized by constant-depth unitary circuits rather than deeper circuits. A specific construction uses a Lambda-fold cup product across Lambda copies of the same code to obtain an operator at the Lambda-th level of the Clifford hierarchy. Families of codes with varying asymptotic parameters are shown to admit such structures for any chosen Lambda.

Core claim

Viewing CSS codes as cochain complexes, cohomology invariants naturally give rise to diagonal logical gates when the code is equipped with a cup product that relaxes properties of a differential graded algebra. The logical gates obtained can be implemented by a constant-depth unitary circuit. In particular, a Lambda-fold cup product produces a logical operator in the Lambda-th level of the Clifford hierarchy on Lambda copies of the same quantum code, which is called the copy-cup gate, and several families of quantum codes supporting gates in the Lambda-th level exist with various asymptotic code parameters.

What carries the argument

The copy-cup gate, defined via a Lambda-fold cup product on the cochain complexes of Lambda copies of a CSS code, that induces a diagonal logical operator in the Lambda-th level of the Clifford hierarchy.

If this is right

  • Cohomology invariants from the cup product directly correspond to diagonal logical gates implementable by constant-depth unitaries.
  • For any desired Lambda, multiple families of quantum codes admit gates at the Lambda-th Clifford level with different asymptotic parameters.
  • The cup product construction equips general CSS codes with a systematic way to produce these invariants.
  • The gates arise on multiple copies of the same underlying code.

Where Pith is reading between the lines

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

  • The approach may allow combining these diagonal gates with transversal operations to reach universality while preserving constant depth in some architectures.
  • Similar cup product structures could be sought in non-CSS stabilizer codes to broaden the set of codes supporting higher Clifford gates.
  • The asymptotic parameters of the constructed code families could be optimized further to improve rates at high Lambda.

Load-bearing premise

That a cup product can be defined on the cochain complex of a CSS code such that cohomology classes produce diagonal logical operators via the relaxed algebra structure.

What would settle it

A CSS code where no cup product structure exists that yields a non-trivial higher-level Clifford gate implementable by a constant-depth circuit.

read the original abstract

We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We show that such invariants exist if the quantum code has a structure that relaxes certain properties of a differential graded algebra. We show how to equip quantum codes with such a structure by defining cup products on CSS codes. The logical gates obtained from this approach can be implemented by a constant-depth unitary circuit. In particular, we construct a $\Lambda$-fold cup product that can produce a logical operator in the $\Lambda$-th level of the Clifford hierarchy on $\Lambda$ copies of the same quantum code, which we call the copy-cup gate. For any desired $\Lambda$, we can construct several families of quantum codes that support gates in the $\Lambda$-th level with various asymptotic code parameters.

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

2 major / 2 minor

Summary. The paper develops a framework for logical gates in CSS quantum codes by interpreting them as cochain complexes and constructing cohomology invariants from a relaxed differential graded algebra structure equipped with cup products. It defines cup products on CSS codes to produce diagonal logical operators implementable by constant-depth circuits, including a Λ-fold cup product yielding the copy-cup gate that realizes operators in the Λ-th level of the Clifford hierarchy acting on Λ copies of the code. Families of codes supporting such gates with various asymptotic parameters are constructed for any desired Λ.

Significance. If the central constructions are verified, the work provides a systematic algebraic-topology approach to generating higher-level Clifford gates in general CSS codes, which is a notable advance for fault-tolerant quantum computation. The explicit construction of constant-depth implementations and code families with tunable parameters strengthens the practical relevance; the use of relaxed DGA structures and cohomology invariants is a fresh perspective that could generalize beyond the presented examples.

major comments (2)
  1. [Abstract and § on cup-product definition] The central claim that cohomology invariants from the relaxed cup-product structure automatically yield logical operators (i.e., commute with all stabilizer generators) is load-bearing but not yet shown to follow from the relaxation alone. The abstract states that invariants exist once the relaxed DGA is imposed, yet the dropped compatibility conditions with the differential leave open whether the resulting cochain-level map satisfies [U, S_X] = [U, S_Z] = 0 for every CSS stabilizer S; explicit verification or a counter-example check is required in the section defining the cup product and the induced operator.
  2. [Section on copy-cup gate and Clifford hierarchy level] For the copy-cup gate, the manuscript must demonstrate that the Λ-fold product produces an operator that is both diagonal in the logical basis and lies strictly in the Λ-th level of the Clifford hierarchy rather than a lower level. The abstract asserts this for the constructed families, but the proof that the gate is non-Clifford for Λ > 2 and constant-depth must be checked against the explicit circuit construction.
minor comments (2)
  1. [Definition of relaxed structure] Notation for the relaxed DGA axioms should be introduced with a side-by-side comparison to the standard DGA axioms to clarify which compatibility conditions are dropped.
  2. [Code families section] The asymptotic parameters (rate, distance) for the constructed code families should be tabulated with explicit scaling in n for each Λ to allow direct comparison with existing code constructions.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. The two major comments identify places where additional explicit verification would strengthen the manuscript. We address each point below and will incorporate the requested clarifications.

read point-by-point responses

  1. Referee: [Abstract and § on cup-product definition] The central claim that cohomology invariants from the relaxed cup-product structure automatically yield logical operators (i.e., commute with all stabilizer generators) is load-bearing but not yet shown to follow from the relaxation alone. The abstract states that invariants exist once the relaxed DGA is imposed, yet the dropped compatibility conditions with the differential leave open whether the resulting cochain-level map satisfies [U, S_X] = [U, S_Z] = 0 for every CSS stabilizer S; explicit verification or a counter-example check is required in the section defining the cup product and the induced operator.

    Authors: We agree that an explicit verification step strengthens the argument. The definition of the cup product on CSS codes is constructed so that the resulting cochain-level map preserves the CSS commutation relations by design (the product is taken only between X-type and Z-type supports that already commute). Nevertheless, the referee is correct that the manuscript does not isolate this fact as a separate lemma. We will add a short lemma immediately after the cup-product definition that derives [U, S_X] = [U, S_Z] = 0 directly from the relaxed DGA axioms and the CSS stabilizer structure. This addresses the concern without altering the main claims. revision: yes

  2. Referee: [Section on copy-cup gate and Clifford hierarchy level] For the copy-cup gate, the manuscript must demonstrate that the Λ-fold product produces an operator that is both diagonal in the logical basis and lies strictly in the Λ-th level of the Clifford hierarchy rather than a lower level. The abstract asserts this for the constructed families, but the proof that the gate is non-Clifford for Λ > 2 and constant-depth must be checked against the explicit circuit construction.

    Authors: The manuscript already shows that the Λ-fold cup product is diagonal on the logical basis by construction (it is a cohomology invariant) and that the circuit realizing it has constant depth (each factor acts on a bounded number of qubits). However, we accept that an explicit check confirming the operator is not in a lower level of the hierarchy for Λ > 2 is missing. We will add a short paragraph in the copy-cup section that invokes the standard inductive definition of the Clifford hierarchy: the gate requires a controlled-(Λ-1) operation that cannot be reduced to lower levels when the underlying code supports a non-trivial Λ-fold product. This verification will be tied directly to the explicit circuit diagram already present. revision: yes

Circularity Check

0 steps flagged

No significant circularity; construction is definitional but self-contained.

full rationale

The paper constructs cup products on CSS cochain complexes to impose a relaxed DGA structure, from which cohomology invariants are shown to induce diagonal logical gates implementable by constant-depth circuits. This is an explicit definition and existence proof by construction rather than any reduction of a claimed prediction or theorem to fitted parameters, self-citations, or prior ansatzes. No load-bearing step equates an output to its input by definition, and the central copy-cup gate for Clifford-hierarchy operators is obtained directly from the newly defined Λ-fold product. External benchmarks (CSS stabilizer commutation) are addressed by the imposed structure rather than assumed circularly.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The framework rests on viewing CSS codes as cochain complexes and defining new cup product operations; no free parameters or fitted values are mentioned. The main invented structure is the cup product itself.

axioms (2)
  • domain assumption CSS codes can be viewed as cochain complexes over which cohomology invariants can be defined
    Stated at the opening of the abstract as the starting point for the framework
  • domain assumption A structure relaxing differential graded algebra properties suffices for cohomology invariants to yield diagonal logical gates
    Invoked to justify existence of the invariants used for the gates
invented entities (2)
  • cup product on CSS codes no independent evidence
    purpose: to equip the cochain complex with additional structure that produces the required cohomology invariants
    Newly defined operation introduced to generate the logical gates
  • copy-cup gate no independent evidence
    purpose: to realize a logical operator at the Λ-th Clifford level on Λ copies of a code
    Specific construction named in the abstract

pith-pipeline@v0.9.0 · 5703 in / 1612 out tokens · 41372 ms · 2026-05-23T18:27:53.544856+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.

  • IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes
    ?
    echoes

    ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

    Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates... We show that such invariants exist if the quantum code has a structure that relaxes certain properties of a differential graded algebra... construct a Λ-fold cup product...

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.

Forward citations

Cited by 5 Pith papers

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

  1. Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope

    quant-ph 2026-03 conditional novelty 8.0

    Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.

  2. Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes

    quant-ph 2025-08 conditional novelty 7.0

    Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at bloc...

  3. Parallel Logical Measurements via Quantum Code Surgery

    quant-ph 2025-03 unverdicted novelty 7.0

    A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.

  4. Spatial overhead reduction for 2D hypergraph product codes

    quant-ph 2026-05 unverdicted novelty 6.0

    A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and...

  5. Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes

    quant-ph 2026-02 unverdicted novelty 6.0

    A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.

Reference graph

Works this paper leans on

83 extracted references · 83 canonical work pages · cited by 5 Pith papers · 5 internal anchors

  1. [1]

    Bomb´ ın, H., Martin-Delgado, M.A.: Topological computation without braiding. Phys. Rev. Lett. 98, 160502 (2007) https://doi.org/10.1103/PhysRevLett.98.160502

    work page doi:10.1103/physrevlett.98.160502 2007

  2. [2]

    New Journal of Physics 17(8), 083002 (2015) https://doi.org/10.1088/ 1367-2630/17/8/083002

    Bomb´ ın, H.: Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes. New Journal of Physics 17(8), 083002 (2015) https://doi.org/10.1088/ 1367-2630/17/8/083002

    work page 2015

  3. [3]

    Kubica, A., Beverland, M.E.: Universal transversal gates with color codes: A simplified approach. Phys. Rev. A 91, 032330 (2015) https://doi.org/10.1103/PhysRevA.91.032330 34

    work page doi:10.1103/physreva.91.032330 2015

  4. [4]

    Vasmer, M., Browne, D.E.: Three-dimensional surface codes: Transversal gates and fault-tolerant architectures. Phys. Rev. A 100, 012312 (2019) https://doi.org/10.1103/ PhysRevA.100.012312

    work page 2019

  5. [5]

    Physical Review Letters 110(17) (2013) https://doi.org/10.1103/physrevlett.110

    Bravyi, S., K¨ onig, R.: Classification of topologically protected gates for local stabilizer codes. Physical Review Letters 110(17) (2013) https://doi.org/10.1103/physrevlett.110. 170503

    work page doi:10.1103/physrevlett.110 2013

  6. [6]

    https://arxiv.org/abs/2012.05842

    Burton, S., Browne, D.: Limitations on transversal gates for hypergraph product codes (2020). https://arxiv.org/abs/2012.05842

    work page arXiv 2020

  7. [7]

    Anderson, Guillaume Duclos-Cianci, and David Poulin

    Anderson, J.T., Duclos-Cianci, G., Poulin, D.: Fault-tolerant conversion between the steane and reed-muller quantum codes. Physical Review Letters 113(8) (2014) https: //doi.org/10.1103/physrevlett.113.080501

    work page doi:10.1103/physrevlett.113.080501 2014

  8. [8]

    Bomb´ ın, H.: Dimensional jump in quantum error correction. New J. Phys.18(4), 043038 (2016) https://doi.org/10.1088/1367-2630/18/4/043038

    work page doi:10.1088/1367-2630/18/4/043038 2016

  9. [9]

    New Journal of Physics 14(12), 123011 (2012)

    Horsman, D., Fowler, A.G., Devitt, S., Van Meter, R.: Surface code quantum computing by lattice surgery. New Journal of Physics 14(12), 123011 (2012)

    work page 2012

  10. [10]

    Science Advances 8(20) (2022) https://doi.org/ 10.1126/sciadv.abn1717

    Cohen, L.Z., Kim, I.H., Bartlett, S.D., Brown, B.J.: Low-overhead fault-tolerant quantum computing using long-range connectivity. Science Advances 8(20) (2022) https://doi.org/ 10.1126/sciadv.abn1717

    work page doi:10.1126/sciadv.abn1717 2022

  11. [11]

    Cowtan and S

    Cowtan, A., Burton, S.: CSS code surgery as a universal construction. Quantum 8, 1344 (2024) https://doi.org/10.22331/q-2024-05-14-1344

    work page doi:10.22331/q-2024-05-14-1344 2024

  12. [12]

    Yoder, T.J., Takagi, R., Chuang, I.L.: Universal fault-tolerant gates on concatenated stabilizer codes. Phys. Rev. X 6, 031039 (2016) https://doi.org/10.1103/PhysRevX.6. 031039

    work page doi:10.1103/physrevx.6 2016

  13. [13]

    Fault-Tolerant Postselected Quantum Computation: Schemes

    Knill, E.: Fault-Tolerant Postselected Quantum Computation: Schemes (2004). https:// arxiv.org/abs/quant-ph/0402171

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  14. [14]

    New Journal of Physics 25(10), 103018 (2023) https://doi.org/10

    Webster, M.A., Quintavalle, A.O., Bartlett, S.D.: Transversal diagonal logical operators for stabiliser codes. New Journal of Physics 25(10), 103018 (2023) https://doi.org/10. 1088/1367-2630/acfc5f

    work page 2023

  15. [15]

    PRX Quantum2(4) (2021) https://doi.org/10.1103/prxquantum.2.040101

    Breuckmann, N.P., Eberhardt, J.N.: Quantum low-density parity-check codes. PRX Quantum 2, 040101 (2021) https://doi.org/10.1103/PRXQuantum.2.040101

    work page doi:10.1103/prxquantum.2.040101 2021

  16. [16]

    IEEE Transactions on Information Theory 68(9), 5955–5974 (2022) https://doi.org/10.1109/tit.2022.3170846

    Vuillot, C., Breuckmann, N.P.: Quantum pin codes. IEEE Transactions on Information Theory 68(9), 5955–5974 (2022) https://doi.org/10.1109/tit.2022.3170846

    work page doi:10.1109/tit.2022.3170846 2022

  17. [17]

    arXiv preprint arXiv:2408.13130 (2024)

    Scruby, T.R., Pesah, A., Webster, M.: Quantum rainbow codes. arXiv preprint arXiv:2408.13130 (2024)

    work page arXiv 2024

  18. [18]

    Quan- tum 8, 1372 (2024) https://doi.org/10.22331/q-2024-06-13-1372

    Breuckmann, N.P., Burton, S.: Fold-transversal clifford gates for quantum codes. Quan- tum 8, 1372 (2024) https://doi.org/10.22331/q-2024-06-13-1372

    work page doi:10.22331/q-2024-06-13-1372 2024

  19. [19]

    Quantum 7, 1153 (2023) https://doi.org/10.22331/ q-2023-10-24-1153 35

    Quintavalle, A.O., Webster, P., Vasmer, M.: Partitioning qubits in hypergraph prod- uct codes to implement logical gates. Quantum 7, 1153 (2023) https://doi.org/10.22331/ q-2023-10-24-1153 35

    work page 2023

  20. [20]

    Fibre bundle framework for unitary quantum fault tolerance

    Gottesman, D., Zhang, L.L.: Fibre bundle framework for unitary quantum fault tolerance. arXiv preprint arXiv:1309.7062 (2013)

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  21. [21]

    IEEE Transactions on Information Theory 60(2), 1193–1202 (2014) https://doi.org/10.1109/tit.2013.2292061

    Tillich, J.-P., Zemor, G.: Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Transactions on Information Theory 60(2), 1193–1202 (2014) https://doi.org/10.1109/tit.2013.2292061

    work page doi:10.1109/tit.2013.2292061 2014

  22. [22]

    Magic-state distilla- tion with low overhead

    Bravyi, S., Haah, J.: Magic-state distillation with low overhead. Physical Review A 86(5) (2012) https://doi.org/10.1103/physreva.86.052329

    work page doi:10.1103/physreva.86.052329 2012

  23. [23]

    Forth- coming (2024)

    Lin, T.-C.: Transversal non-Clifford gates for quantum LDPC codes on sheaves. Forth- coming (2024)

    work page 2024

  24. [24]

    Forthcoming (2024)

    Golowich, L., Lin, T.-C.: Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes. Forthcoming (2024)

    work page 2024

  25. [25]

    Yoshida, B.: Topological phases with generalized global symmetries. Phys. Rev. B 93, 155131 (2016) https://doi.org/10.1103/PhysRevB.93.155131

    work page doi:10.1103/physrevb.93.155131 2016

  26. [26]

    Potter, A.C., Morimoto, T.: Dynamically enriched topological orders in driven two- dimensional systems. Phys. Rev. B95, 155126 (2017) https://doi.org/10.1103/PhysRevB. 95.155126

    work page doi:10.1103/physrevb 2017

  27. [27]

    SciPost Phys.14, 065 (2023) https: //doi.org/10.21468/SciPostPhys.14.4.065

    Barkeshli, M., Chen, Y.-A., Huang, S.-J., Kobayashi, R., Tantivasadakarn, N., Zhu, G.: Codimension-2 defects and higher symmetries in (3+1)D topological phases. SciPost Phys. 14, 065 (2023) https://doi.org/10.21468/SciPostPhys.14.4.065

    work page doi:10.21468/scipostphys.14.4.065 2023

  28. [28]

    Journal of Mathematical Physics 64(9) (2023) https://doi

    Chen, Y.-A., Tata, S.: Higher cup products on hypercubic lattices: application to lattice models of topological phases. Journal of Mathematical Physics 64(9) (2023) https://doi. org/10.1063/5.0095189

    work page doi:10.1063/5.0095189 2023

  29. [29]

    arXiv preprint arXiv:2312.09111 (2023)

    Wang, Y.-F., Wang, Y., Chen, Y.-A., Zhang, W., Zhang, T., Hu, J., Chen, W., Gu, Y., Liu, Z.-W.: Efficient fault-tolerant implementations of non-clifford gates with reconfigurable atom arrays. arXiv preprint arXiv:2312.09111 (2023)

    work page arXiv 2023

  30. [30]

    arXiv preprint arXiv:2310.16982 (2023)

    Zhu, G., Sikander, S., Portnoy, E., Cross, A.W., Brown, B.J.: Non-clifford and paral- lelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum ldpc codes via higher symmetries. arXiv preprint arXiv:2310.16982 (2023)

    work page arXiv 2023

  31. [31]

    Annals of Physics 377, 387–413 (2017) https://doi.org/10.1016/j.aop.2016.12.014

    Yoshida, B.: Gapped boundaries, group cohomology and fault-tolerant logical gates. Annals of Physics 377, 387–413 (2017) https://doi.org/10.1016/j.aop.2016.12.014

    work page doi:10.1016/j.aop.2016.12.014 2017

  32. [32]

    Webster, P., Bartlett, S.D.: Locality-preserving logical operators in topological stabilizer codes. Phys. Rev. A 97, 012330 (2018) https://doi.org/10.1103/PhysRevA.97.012330

    work page doi:10.1103/physreva.97.012330 2018

  33. [33]

    SciPost Phys.15, 028 (2023) https://doi.org/10.21468/SciPostPhys.15.1.028

    Kobayashi, R.: Fermionic defects of topological phases and logical gates. SciPost Phys. 15, 028 (2023) https://doi.org/10.21468/SciPostPhys.15.1.028

    work page doi:10.21468/scipostphys.15.1.028 2023

  34. [34]

    SciPost Phys.16, 122 (2024) https: //doi.org/10.21468/SciPostPhys.16.5.122

    Barkeshli, M., Hsin, P.-S., Kobayashi, R.: Higher-group symmetry of (3+1)D fermionic Z2 gauge theory: Logical CCZ, CS, and T gates from higher symmetry. SciPost Phys. 16, 122 (2024) https://doi.org/10.21468/SciPostPhys.16.5.122

    work page doi:10.21468/scipostphys.16.5.122 2024

  35. [35]

    Fidkowski, L., Hastings, M.B.: Pumping chirality in three dimensions. Phys. Rev. B 109, 235142 (2024) https://doi.org/10.1103/PhysRevB.109.235142 36

    work page doi:10.1103/physrevb.109.235142 2024

  36. [36]

    SciPost Phys

    Chen, X., Dua, A., Hsin, P.-S., Jian, C.-M., Shirley, W., Xu, C.: Loops in 4+1d topological phases. SciPost Phys. 15, 001 (2023) https://doi.org/10.21468/SciPostPhys.15.1.001

    work page doi:10.21468/scipostphys.15.1.001 2023

  37. [37]

    Journal of High Energy Physics 2015(2), 172 (2015) https://doi.org/10.1007/JHEP02(2015)172

    Gaiotto, D., Kapustin, A., Seiberg, N., Willett, B.: Generalized global symmetries. Journal of High Energy Physics 2015(2), 172 (2015) https://doi.org/10.1007/JHEP02(2015)172

    work page doi:10.1007/jhep02(2015)172 2015

  38. [38]

    In: Algebra, Geometry, and Physics in the 21st Century, pp

    Kapustin, A., Thorngren, R.: Higher symmetry and gapped phases of gauge theories. In: Algebra, Geometry, and Physics in the 21st Century, pp. 177–202. Springer, ??? (2017)

    work page 2017

  39. [39]

    Dijkgraaf, R., Witten, E.: Topological Gauge Theories and Group Cohomology. Commun. Math. Phys. 129, 393 (1990) https://doi.org/10.1007/BF02096988

    work page doi:10.1007/bf02096988 1990

  40. [40]

    Chen, X., Gu, Z.-C., Liu, Z.-X., Wen, X.-G.: Symmetry protected topological orders and the group cohomology of their symmetry group. Phys. Rev. B 87, 155114 (2013) https: //doi.org/10.1103/PhysRevB.87.155114

    work page doi:10.1103/physrevb.87.155114 2013

  41. [41]

    Yoshida, B.: Topological color code and symmetry-protected topological phases. Phys. Rev. B 91, 245131 (2015) https://doi.org/10.1103/PhysRevB.91.245131

    work page doi:10.1103/physrevb.91.245131 2015

  42. [42]

    PRX Quantum 3, 030338 (2022) https://doi.org/10

    Zhu, G., Jochym-O’Connor, T., Dua, A.: Topological order, quantum codes, and quantum computation on fractal geometries. PRX Quantum 3, 030338 (2022) https://doi.org/10. 1103/PRXQuantum.3.030338

    work page 2022

  43. [43]

    SciPost Phys.16, 089 (2024) https://doi.org/10.21468/ SciPostPhys.16.4.089

    Barkeshli, M., Chen, Y.-A., Hsin, P.-S., Kobayashi, R.: Higher-group symmetry in finite gauge theory and stabilizer codes. SciPost Phys.16, 089 (2024) https://doi.org/10.21468/ SciPostPhys.16.4.089

    work page 2024

  44. [44]

    arXiv preprint arXiv:2404.05033 (2024)

    Song, Z., Zhu, G.: Magic boundaries of 3d color codes. arXiv preprint arXiv:2404.05033 (2024)

    work page arXiv 2024

  45. [45]

    Aasen, D., Wang, Z., Hastings, M.B.: Adiabatic paths of hamiltonians, symmetries of topological order, and automorphism codes. Phys. Rev. B 106, 085122 (2022) https: //doi.org/10.1103/PhysRevB.106.085122

    work page doi:10.1103/physrevb.106.085122 2022

  46. [46]

    Else, D.V., Nayak, C.: Classification of topological phases in periodically driven interacting systems. Phys. Rev. B 93, 201103 (2016) https://doi.org/10.1103/PhysRevB.93.201103

    work page doi:10.1103/physrevb.93.201103 2016

  47. [47]

    Roy, R., Harper, F.: Floquet topological phases with symmetry in all dimensions. Phys. Rev. B 95, 195128 (2017) https://doi.org/10.1103/PhysRevB.95.195128

    work page doi:10.1103/physrevb.95.195128 2017

  48. [48]

    Tantivasadakarn, N., Vishwanath, A.: Symmetric finite-time preparation of cluster states via quantum pumps. Phys. Rev. Lett. 129, 090501 (2022) https://doi.org/10.1103/ PhysRevLett.129.090501

    work page 2022

  49. [49]

    Shiozaki, K.: Adiabatic cycles of quantum spin systems. Phys. Rev. B 106, 125108 (2022) https://doi.org/10.1103/PhysRevB.106.125108

    work page doi:10.1103/physrevb.106.125108 2022

  50. [50]

    Wen, X., Qi, M., Beaudry, A., Moreno, J., Pflaum, M.J., Spiegel, D., Vishwanath, A., Hermele, M.: Flow of higher berry curvature and bulk-boundary correspondence in parametrized quantum systems. Phys. Rev. B 108, 125147 (2023) https://doi.org/10. 1103/PhysRevB.108.125147

    work page 2023

  51. [51]

    arXiv preprint arXiv:2303.07431 37 (2023)

    Beaudry, A., Hermele, M., Moreno, J., Pflaum, M., Qi, M., Spiegel, D.: Homotopical foundations of parametrized quantum spin systems. arXiv preprint arXiv:2303.07431 37 (2023)

    work page arXiv 2023

  52. [52]

    arXiv preprint arXiv:2312.08462 (2023)

    Tan, Y., Roberts, B., Tantivasadakarn, N., Yoshida, B., Yao, N.Y.: Fracton models from product codes. arXiv preprint arXiv:2312.08462 (2023)

    work page arXiv 2023

  53. [53]

    gauging and dualities

    Rakovszky, T., Khemani, V.: The physics of (good) ldpc codes i. gauging and dualities. arXiv preprint arXiv:2310.16032 (2023)

    work page arXiv 2023

  54. [54]

    product constructions

    Rakovszky, T., Khemani, V.: The physics of (good) ldpc codes ii. product constructions. arXiv preprint arXiv:2402.16831 (2024)

    work page arXiv 2024

  55. [55]

    PRX Quantum 5, 010304 (2024) https://doi.org/10.1103/PRXQuantum.5.010304

    Stephen, D.T., Dua, A., Lavasani, A., Nandkishore, R.: Nonlocal finite-depth circuits for constructing symmetry-protected topological states and quantum cellular automata. PRX Quantum 5, 010304 (2024) https://doi.org/10.1103/PRXQuantum.5.010304

    work page doi:10.1103/prxquantum.5.010304 2024

  56. [56]

    arXiv preprint arXiv:2405.19412 (2024)

    Lavasani, A., Gullans, M.J., Albert, V.V., Barkeshli, M.: On stability of k-local quantum phases of matter. arXiv preprint arXiv:2405.19412 (2024)

    work page arXiv 2024

  57. [57]

    Ungauging quantum error-correcting codes

    Kubica, A., Yoshida, B.: Ungauging quantum error-correcting codes. arXiv preprint arXiv:1805.01836 (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  58. [58]

    Tantivasadakarn, N., Vijay, S.: Searching for fracton orders via symmetry defect con- densation. Phys. Rev. B 101, 165143 (2020) https://doi.org/10.1103/PhysRevB.101. 165143

    work page doi:10.1103/physrevb.101 2020

  59. [59]

    Journal of High Energy Physics 2023(11), 89 (2023) https://doi.org/10.1007/ JHEP11(2023)089

    Hsin, P.-S., Luo, Z.-X., Malladi, A.: Gapped interfaces in fracton models and foliated fields. Journal of High Energy Physics 2023(11), 89 (2023) https://doi.org/10.1007/ JHEP11(2023)089

    work page 2023

  60. [60]

    arXiv preprint arXiv:2407.03270 (2024)

    Conrad, J., Burchards, A.G., Flammia, S.T.: Lattices, gates, and curves: Gkp codes as a rosetta stone. arXiv preprint arXiv:2407.03270 (2024)

    work page arXiv 2024

  61. [61]

    Quantum 8, 1448 (2024) https://doi.org/10

    Davydova, M., Tantivasadakarn, N., Balasubramanian, S., Aasen, D.: Quantum compu- tation from dynamic automorphism codes. Quantum 8, 1448 (2024) https://doi.org/10. 22331/q-2024-08-27-1448

    work page 2024

  62. [62]

    Annals of Mathematics 48(2), 290–320 (1947)

    Steenrod, N.E.: Products of cocycles and extensions of mappings. Annals of Mathematics 48(2), 290–320 (1947)

    work page 1947

  63. [63]

    Homological Product Codes

    Bravyi, S., Hastings, M.B.: Homological Product Codes (2013). https://arxiv.org/abs/ 1311.0885

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  64. [64]

    Annals of Mathematics 39(2), 397–432 (1938)

    Whitney, H.: On products in a complex. Annals of Mathematics 39(2), 397–432 (1938)

    work page 1938

  65. [65]

    Springer, New York, USA (1984)

    James, I.M.: General Topology and Homotopy Theory, 1st edn. Springer, New York, USA (1984). https://doi.org/10.1007/978-1-4613-8283-6

    work page doi:10.1007/978-1-4613-8283-6 1984

  66. [66]

    EMS Press, Zurich, Switzerland (2008)

    Dieck, T.: Algebraic Topology. EMS Press, Zurich, Switzerland (2008). https://doi.org/ 10.4171/048

    work page doi:10.4171/048 2008

  67. [67]

    IEEE Transac- tions on Information Theory67(10), 6653–6674 (2021) https://doi.org/10.1109/TIT.2021

    Breuckmann, N.P., Eberhardt, J.N.: Balanced product quantum codes. IEEE Transac- tions on Information Theory67(10), 6653–6674 (2021) https://doi.org/10.1109/TIT.2021. 3097347 38

    work page doi:10.1109/tit.2021 2021

  68. [68]

    Kovalev, A.A., Pryadko, L.P.: Quantum kronecker sum-product low-density parity- check codes with finite rate. Phys. Rev. A 88, 012311 (2013) https://doi.org/10.1103/ PhysRevA.88.012311

    work page 2013

  69. [69]

    Cross, Jay M

    Bravyi, S., Cross, A.W., Gambetta, J.M., Maslov, D., Rall, P., Yoder, T.J.: High-threshold and low-overhead fault-tolerant quantum memory. Nature 627(8005), 778–782 (2024) https://doi.org/10.1038/s41586-024-07107-7

    work page doi:10.1038/s41586-024-07107-7 2024

  70. [70]

    arXiv preprint arXiv:2407.03973 (2024)

    Eberhardt, J.N., Steffan, V.: Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes (2024). https://arxiv.org/abs/2407.03973

    work page arXiv 2024

  71. [71]

    Lin, H.-K., Pryadko, L.P.: Quantum two-block group algebra codes. Phys. Rev. A 109, 022407 (2024) https://doi.org/10.1103/PhysRevA.109.022407

    work page doi:10.1103/physreva.109.022407 2024

  72. [72]

    IEEE transactions on Information Theory 42(6), 1710–1722 (1996)

    Sipser, M., Spielman, D.A.: Expander codes. IEEE transactions on Information Theory 42(6), 1710–1722 (1996)

    work page 1996

  73. [73]

    IEEE Transactions on information theory 27(5), 533–547 (1981)

    Tanner, R.: A recursive approach to low complexity codes. IEEE Transactions on information theory 27(5), 533–547 (1981)

    work page 1981

  74. [74]

    Problems Inform

    Margulis, G.A.: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems Inform. Transmission 24, 39 (1988)

    work page 1988

  75. [75]

    In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing

    Panteleev, P., Kalachev, G.: Asymptotically good quantum and locally testable classical ldpc codes. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2022, pp. 375–388. Association for Computing Machinery, New York, NY, USA (2022). https://doi.org/10.1145/3519935.3520017 . https://doi.org/10. 1145/3519935.3520017

    work page doi:10.1145/3519935.3520017 2022

  76. [76]

    Graph codes and local systems

    Meshulam, R.: Graph codes and local systems. arXiv preprint arXiv:1803.05643 (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  77. [77]

    Ars Math

    Macaj, M., Siran, J., Ipolyiov´ a, M.: Injectivity radius of representations of triangle groups and planar width of regular hypermaps. Ars Math. Contemp. 1(2), 223–241 (2008)

    work page 2008

  78. [78]

    IEEE Transactions on Information Theory 62(6), 3731–3744 (2016) https://doi

    Breuckmann, N.P., Terhal, B.M.: Constructions and noise threshold of hyperbolic surface codes. IEEE Transactions on Information Theory 62(6), 3731–3744 (2016) https://doi. org/10.1109/TIT.2016.2555700

    work page doi:10.1109/tit.2016.2555700 2016

  79. [79]

    Quantum Science and Technology 2(3), 035007 (2017) https://doi.org/10.1088/2058-9565/aa7d3b

    Breuckmann, N.P., Vuillot, C., Campbell, E., Krishna, A., Terhal, B.M.: Hyperbolic and semi-hyperbolic surface codes for quantum storage. Quantum Science and Technology 2(3), 035007 (2017) https://doi.org/10.1088/2058-9565/aa7d3b

    work page doi:10.1088/2058-9565/aa7d3b 2017

  80. [80]

    Zeng, W., Pryadko, L.P.: Minimal distances for certain quantum product codes and tensor products of chain complexes. Phys. Rev. A 102, 062402 (2020) https://doi.org/10.1103/ PhysRevA.102.062402

    work page 2020

Showing first 80 references.