Paper Citation Record · LEDGER

Finding diagonal logical gates in CSS codes and circuits

As of 22 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2607.26477.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.26477 v1

Coverage vector

measured 53 of 53 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T15:11:09.158880Z

measured 54 of 54 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T01:03:22.326338Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-08T01:03:23.578873Z

Reference resolution

53 of 53 outbound references displayed

verified exact0
verified fuzzy0
unresolved53
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7eeb7508-48c4-4ae9-ada5-79aa45eb1999 · outbound

This paper cites Universal Quantum Computation with ideal Clifford gates and noisy ancillas.

Finding diagonal logical gates in CSS codes and circuits Universal Quantum Computation with ideal Clifford gates and noisy ancillas

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:06.197196Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afc7df0b-8559-4784-b31e-69412dceb8b4 · outbound

This paper cites Magic state distillation with low overhead.

Finding diagonal logical gates in CSS codes and circuits Magic state distillation with low overhead

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:06.324657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78c9fc3a-eeb5-4fb3-898d-5f58f3419b09 · outbound

This paper cites Magic State Distillation: Not as Costly as You Think.

Finding diagonal logical gates in CSS codes and circuits Magic State Distillation: Not as Costly as You Think

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:06.549619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b30b973-8e6e-4c64-a37e-a3bb71ad7b80 · outbound

This paper cites Constant-Overhead Magic State Distillation.

Finding diagonal logical gates in CSS codes and circuits Constant-Overhead Magic State Distillation

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:06.730542Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4df4670d-efc3-4479-9fce-e22a7875e7d2 · outbound

This paper cites Restrictions on Transversal Encoded Quantum Gate Sets.

Finding diagonal logical gates in CSS codes and circuits Restrictions on Transversal Encoded Quantum Gate Sets

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:06.898636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a710234-9051-4901-9417-a8a61c78b16c · outbound

This paper cites Dimensional Jump in Quantum Error Correction.

Finding diagonal logical gates in CSS codes and circuits Dimensional Jump in Quantum Error Correction

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.110668Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c25522a5-1000-475a-9352-cdf84ed9f95b · outbound

This paper cites Universal fault-tolerant quantum computation with only transversal gates and error correction.

Finding diagonal logical gates in CSS codes and circuits Universal fault-tolerant quantum computation with only transversal gates and error correction

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.281214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebfddeaf-f8cf-4f06-88bd-362c14f37f44 · outbound

This paper cites Universal transversal gates with color codes - a simplified approach.

Finding diagonal logical gates in CSS codes and circuits Universal transversal gates with color codes - a simplified approach

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.425359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa72f486-cacf-41b8-9208-e4ad69a74f29 · outbound

This paper cites The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes.

Finding diagonal logical gates in CSS codes and circuits The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.518129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c2fff03-50bd-43d6-94db-984f632843de · outbound

This paper cites Non- clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate ho- mological quantum ldpc codes via higher sym- metries.

Finding diagonal logical gates in CSS codes and circuits Non- clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate ho- mological quantum ldpc codes via higher sym- metries

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.664318Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d1bd14e-29fc-4f3b-8dd4-697ae3b3afb0 · outbound

This paper cites Transversal dimension jump for product qldpc codes.

Finding diagonal logical gates in CSS codes and circuits Transversal dimension jump for product qldpc codes

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.814177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84d077f1-39cf-49b7-909c-b9ccc3f40155 · outbound

This paper cites Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits.

Finding diagonal logical gates in CSS codes and circuits Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:07.972749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bd6690f-46ae-4207-b663-8c6bcae4826b · outbound

This paper cites Fault-tolerant Post-Selection for Low Overhead Magic State Preparation.

Finding diagonal logical gates in CSS codes and circuits Fault-tolerant Post-Selection for Low Overhead Magic State Preparation

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.142283Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f8c4ffd-3a1c-4ddb-a9de-165a6e850194 · outbound

This paper cites Magic state cultivation: growing T states as cheap as CNOT gates.

Finding diagonal logical gates in CSS codes and circuits Magic state cultivation: growing T states as cheap as CNOT gates

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.278232Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 563d12a7-719f-4567-affc-44165e5f1141 · outbound

This paper cites Magic state cultivation on a superconducting quantum processor.

Finding diagonal logical gates in CSS codes and circuits Magic state cultivation on a superconducting quantum processor

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.366837Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1116bf41-0731-46f5-8fdb-20162ab534d8 · outbound

This paper cites 2D quantum computation with 3D topological codes.

Finding diagonal logical gates in CSS codes and circuits 2D quantum computation with 3D topological codes

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.486653Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be68bd5c-2039-4fb7-ab9b-024dc5484a69 · outbound

This paper cites A fault-tolerant non-Clifford gate for the surface code in two dimensions.

Finding diagonal logical gates in CSS codes and circuits A fault-tolerant non-Clifford gate for the surface code in two dimensions

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.644980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5767a3be-b338-44b4-9a37-e2e785115404 · outbound

This paper cites Universal fault tolerant quantum computation in 2D without getting tied in knots.

Finding diagonal logical gates in CSS codes and circuits Universal fault tolerant quantum computation in 2D without getting tied in knots

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.775040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ccad375d-325d-4c07-b00e-5134a1156308 · outbound

This paper cites Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases.

Finding diagonal logical gates in CSS codes and circuits Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:08.942978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a78ed6cb-8928-4bab-9141-5a5ba3e6f020 · outbound

This paper cites Planar fault-tolerant circuits for non-Clifford gates on the 2D color code.

Finding diagonal logical gates in CSS codes and circuits Planar fault-tolerant circuits for non-Clifford gates on the 2D color code

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.005420Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8bebee5a-a1f3-4130-bfc1-f690127bcc56 · outbound

This paper cites High-threshold decoding of non-pauli codes for 2d universal- ity.

Finding diagonal logical gates in CSS codes and circuits High-threshold decoding of non-pauli codes for 2d universal- ity

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.009719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c93ab87-adc2-4952-8001-d38d7c2fa2e2 · outbound

This paper cites Non-abelian qldpc: Tqft formalism, ad- dressable gauging measurement and application to magic state fountain on 2d product codes.

Finding diagonal logical gates in CSS codes and circuits Non-abelian qldpc: Tqft formalism, ad- dressable gauging measurement and application to magic state fountain on 2d product codes

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.014057Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f91f297f-d26d-4a5b-9d52-de7614ca9d3b · outbound

This paper cites Fast magic state prepa- ration by gauging higher-form transversal gates in parallel.

Finding diagonal logical gates in CSS codes and circuits Fast magic state prepa- ration by gauging higher-form transversal gates in parallel

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.018156Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4505dfc-e0ec-4109-a2f1-11c69b89b1b8 · outbound

This paper cites Non-abelian quantum low-density parity check codes and non-clifford op- erations from gauging logical gates via measure- ments.

Finding diagonal logical gates in CSS codes and circuits Non-abelian quantum low-density parity check codes and non-clifford op- erations from gauging logical gates via measure- ments

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.022137Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c88a1792-35f6-443c-a7ac-e643809a4574 · outbound

This paper cites Cups and Gates I: Cohomology invariants and logical quantum operations.

Finding diagonal logical gates in CSS codes and circuits Cups and Gates I: Cohomology invariants and logical quantum operations

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.026353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d164a4fa-cfb9-4d9a-9287-3f66e2c84e23 · outbound

This paper cites Transversal non-Clifford gates for quantum LDPC codes on sheaves.

Finding diagonal logical gates in CSS codes and circuits Transversal non-Clifford gates for quantum LDPC codes on sheaves

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.030960Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 332506af-3094-4f04-9a4d-cadd9d5e4c44 · outbound

This paper cites Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes.

Finding diagonal logical gates in CSS codes and circuits Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.035190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5358a8e0-a0bf-43db-be3f-2222355e78b0 · outbound

This paper cites Unfolding the color code.

Finding diagonal logical gates in CSS codes and circuits Unfolding the color code

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.039520Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1412c022-4456-4375-8781-34ef1c2cf6c6 · outbound

This paper cites url:https://github.com/ andibau13/diagonal-gate-finder.

Finding diagonal logical gates in CSS codes and circuits url:https://github.com/ andibau13/diagonal-gate-finder

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.044142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f44a883-fb47-4ec9-8a8d-1a7853745c81 · outbound

This paper cites Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates.

Finding diagonal logical gates in CSS codes and circuits Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.048696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97c7cb19-3750-426b-a56a-5325252ba9d5 · outbound

This paper cites Transversal Diagonal Logical Operators for Stabiliser Codes.

Finding diagonal logical gates in CSS codes and circuits Transversal Diagonal Logical Operators for Stabiliser Codes

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.053225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 198dea95-a273-44b6-ab71-965d5707122e · outbound

This paper cites Logical Clifford Synthesis for Stabilizer Codes.

Finding diagonal logical gates in CSS codes and circuits Logical Clifford Synthesis for Stabilizer Codes

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.058951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f6ba2e6-b1aa-4368-8720-a4cfff498c3d · outbound

This paper cites Fault-Tolerant Logical Clifford Gates from Code Automorphisms.

Finding diagonal logical gates in CSS codes and circuits Fault-Tolerant Logical Clifford Gates from Code Automorphisms

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.063964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 110e4f72-3998-47c6-ae91-6360d0e831bb · outbound

This paper cites Automated logical Clifford gadgets for heterogeneous architectures via chain maps.

Finding diagonal logical gates in CSS codes and circuits Automated logical Clifford gadgets for heterogeneous architectures via chain maps

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.068979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b320b0b-5865-46ce-8ff7-f340ddb12d55 · outbound

This paper cites Quantum Teleportation is a Universal Computational Primitive.

Finding diagonal logical gates in CSS codes and circuits Quantum Teleportation is a Universal Computational Primitive

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.073187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adce76ec-ed95-4fbd-b9b2-7c4acfc2ae2c · outbound

This paper cites Diagonal gates in the Clifford hierarchy.

Finding diagonal logical gates in CSS codes and circuits Diagonal gates in the Clifford hierarchy

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.077573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67c5fdcf-3465-43d2-94c0-9992b0762eab · outbound

This paper cites Solving linear equations over finitely generated abelian groups.

Finding diagonal logical gates in CSS codes and circuits Solving linear equations over finitely generated abelian groups

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.082466Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 856924ee-44a0-412d-91a4-0332404ccc11 · outbound

This paper cites Exact solution of linear equations using p-adic expansions.

Finding diagonal logical gates in CSS codes and circuits Exact solution of linear equations using p-adic expansions

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.087464Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eea632a4-1a38-4e72-a9e8-878d368847c1 · outbound

This paper cites url:https://github.com/ andibau13/twogroup-linalg.

Finding diagonal logical gates in CSS codes and circuits url:https://github.com/ andibau13/twogroup-linalg

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.092331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b3fa3c3-f981-4bac-b26a-cbc55af0ddec · outbound

This paper cites url:https://github.com/ akissinger/bitgauss.

Finding diagonal logical gates in CSS codes and circuits url:https://github.com/ akissinger/bitgauss

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.096672Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 766f3175-ed9b-4927-9367-74c2434eef4f · outbound

This paper cites High-threshold and low-overhead fault-tolerant quantum memory.

Finding diagonal logical gates in CSS codes and circuits High-threshold and low-overhead fault-tolerant quantum memory

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.101518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b75326d-626a-4a74-b0e0-3781977fc278 · outbound

This paper cites Picturing quan- tum processes: A first course in quantum theory and diagrammatic reasoning.

Finding diagonal logical gates in CSS codes and circuits Picturing quan- tum processes: A first course in quantum theory and diagrammatic reasoning

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.106399Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9b2712f-4fee-4f27-ba6a-dc1648a5a306 · outbound

This paper cites ZX-calculus for the working quantum computer scientist.

Finding diagonal logical gates in CSS codes and circuits ZX-calculus for the working quantum computer scientist

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.110582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0aa20231-ec09-41d4-a3be-bdea7a56e2f5 · outbound

This paper cites Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code).

Finding diagonal logical gates in CSS codes and circuits Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.115879Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 848e8bf1-810f-4cf0-a2b0-347e8bfc3538 · outbound

This paper cites Topological error correcting processes from fixed-point path integrals.

Finding diagonal logical gates in CSS codes and circuits Topological error correcting processes from fixed-point path integrals

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.120553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e7df78e-119d-4998-9873-fff9262dd009 · outbound

This paper cites Unifying flavors of fault tolerance with the ZX calculus.

Finding diagonal logical gates in CSS codes and circuits Unifying flavors of fault tolerance with the ZX calculus

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.125339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64d84881-1388-4225-9cc8-bc59dc6dce5e · outbound

This paper cites The x+y Floquet code: A simple example for topological quantum computation in the path integral approach.

Finding diagonal logical gates in CSS codes and circuits The x+y Floquet code: A simple example for topological quantum computation in the path integral approach

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.130646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2971d9a-1a77-4870-aa55-8cae1864de77 · outbound

This paper cites Classification of topologically protected gates for local stabilizer codes.

Finding diagonal logical gates in CSS codes and circuits Classification of topologically protected gates for local stabilizer codes

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.135010Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77778f2a-a4ea-4251-9d87-e3dcdef32daf · outbound

This paper cites Classification of transversal gates in qubit stabilizer codes.

Finding diagonal logical gates in CSS codes and circuits Classification of transversal gates in qubit stabilizer codes

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.139506Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1238e6e2-a894-414d-bbf5-13802d174ddb · outbound

This paper cites The disjointness of stabilizer codes and limitations on fault-tolerant logical gates.

Finding diagonal logical gates in CSS codes and circuits The disjointness of stabilizer codes and limitations on fault-tolerant logical gates

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.144842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbc847ba-f3b4-46d7-b01d-35e0addfc9e2 · outbound

This paper cites Quadratic ten- sors as a unification of clifford, gaussian, and free- fermion physics.

Finding diagonal logical gates in CSS codes and circuits Quadratic ten- sors as a unification of clifford, gaussian, and free- fermion physics

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.149154Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7aad8442-01df-45ba-a6b0-410ed6e1fec9 · outbound

This paper cites Solving sparse linear equations over finite fields.

Finding diagonal logical gates in CSS codes and circuits Solving sparse linear equations over finite fields

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.154592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d4dca4b-37da-4ebb-a419-dcfe38066c8f · outbound

This paper cites Commuting Pauli Hamiltonians as maps between free modules.

Finding diagonal logical gates in CSS codes and circuits Commuting Pauli Hamiltonians as maps between free modules

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T15:11:09.158880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation b6ae1dcf-c20c-4cbc-bc2c-0c32d87413fe · inbound

Beyond transversality: structure of Clifford circuits for CSS codes cites this paper.

Beyond transversality: structure of Clifford circuits for CSS codes Finding diagonal logical gates in CSS codes and circuits

Reference 51

Resolution: verified exact; local_arxiv, observed 2026-08-08T01:03:23.582492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.