Pith. sign in

Paper Citation Record · LEDGER

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

As of 23 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 5 inbound Pith citation observations for arXiv:2509.00850.

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

pith.paper-citation-record.v1
2509.00850 v1

Coverage vector

measured 73 of 73 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T13:17:02.072542Z

measured 78 of 78 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-08T21:33:05.730954Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-08T21:35:37.679578Z

Reference resolution

73 of 73 outbound references displayed

  • verified exact1
  • verified fuzzy59
  • unresolved13
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3f9d5fab-6c6b-4f9c-9aac-617f27423c31 · outbound

This paper cites For example, this is the case when in the middle of a normal surface code measurement circuit.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes For example, this is the case when in the middle of a normal surface code measurement circuit

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.160873Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.690564Z digest=sha256:2f07cbec7d435d3c761b286e1cb383f7009f23f25857f2c44745768a7edc6b57

Observation 90a44cc0-9fde-48a9-bcaa-ffff53b09415 · outbound

This paper cites three-quarters LR circuit.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes three-quarters LR circuit

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.141560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.696641Z digest=sha256:20505c503c9589d93d7ddf82d3c28b3be9b3a3c3e337ce2400247fc5319f750f

Observation 1bd46529-4157-48f8-8379-ebaf17ebe855 · outbound

This paper cites Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.703460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.703460Z digest=sha256:feb8491b3ec18f98a3c19a9ec307b97d345e31a657b3ea13375573bad13b576f

Observation aa4c9b7f-be45-4912-845c-3eab7f09b4c5 · outbound

This paper cites Fault-tolerant quantum computation by anyons.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Fault-tolerant quantum computation by anyons

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.121581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.710162Z digest=sha256:c14494188b7a7ca8a654b04dc3f260edf15a8868ae3f0da8e0027948d6e9fea1

Observation 7dc40ec7-5e81-4273-af81-67bcd1ecfb55 · outbound

This paper cites Quantum codes on a lattice with boundary.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quantum codes on a lattice with boundary

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.716979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.716979Z digest=sha256:6a1684c523196fb8ae54f5d509d115d124ef45697b2896a7fce574378b2d2556

Observation 19e37a2b-231a-47ba-a9c1-37872907edb2 · outbound

This paper cites Quan- tum error correction below the surface code threshold.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quan- tum error correction below the surface code threshold

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.104400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.723525Z digest=sha256:f4abb25c4d9d29ead9599003df69c39b74a76b43ca80c9955e99b4834d57d31e

Observation d64d97dd-801e-429b-a641-dbe6a5b68077 · outbound

This paper cites Z2-systolic freedom and quantum codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Z2-systolic freedom and quantum codes

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.085480Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.729726Z digest=sha256:3b3fe0eaf2420fd2c7163e69802680e7160f81b38e7e587634d61d07a62a3048

Observation 6bd90bd2-66fb-46fc-9ee4-4e0e9f7c8208 · outbound

This paper cites Decodable quan- tum ldpc codes beyond the √n distance barrier using high-dimensional expanders.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Decodable quan- tum ldpc codes beyond the √n distance barrier using high-dimensional expanders

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.067065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.734936Z digest=sha256:43d23780fa3b752f6be852baa7bc0e3186f83e33f74bcfaee72bda56ff6351ec

Observation 2dac1f67-eb58-4960-9aa8-6a0947d558b0 · outbound

This paper cites New cosystolic expanders from tensors imply explicit quantum ldpc codes with ω(√n log kn) distance.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes New cosystolic expanders from tensors imply explicit quantum ldpc codes with ω(√n log kn) distance

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.048113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.740565Z digest=sha256:ca2a77f72d1d1b3475cfff7bbc89017627ececc587e9fb39c7b8ab98750044ea

Observation 13cda3d2-00e7-4bb4-97e9-4ab2af764d99 · outbound

This paper cites Fiber bun- dle codes: breaking the n1/2 polylog(n) barrier for quan- tum ldpc codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Fiber bun- dle codes: breaking the n1/2 polylog(n) barrier for quan- tum ldpc codes

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.029272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.746183Z digest=sha256:28ad488899bd4c5fdc879cef33f9544d6370884ce8b4d292e03e92fb19d3e32a

Observation 161f3565-8c41-4467-b8bb-25c16ea31b64 · outbound

This paper cites Quantum ldpc codes with almost linear minimum distance.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quantum ldpc codes with almost linear minimum distance

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:04.007432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.752141Z digest=sha256:7f7e1009dc0713c4ce9484fcf8dea80a2da2256150f1fd9606505beae1a7a96d

Observation bfd938dc-10b2-46cf-91e1-e4a8618f0c6c · outbound

This paper cites Balanced prod- uct quantum codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Balanced prod- uct quantum codes

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.979681Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.758031Z digest=sha256:9e1ec265c9ca7045091c271169326d7cdcc384441d0f66cb4911999362efb852

Observation 3abda84f-cd55-4e18-81c7-d464f17d8622 · outbound

This paper cites Asymptotically good quantum and locally testable classical ldpc codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Asymptotically good quantum and locally testable classical ldpc codes

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.933471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.763073Z digest=sha256:6ea835f7614dfa0c5a169915f5788cd4136d7f724d001512828421e1e55d6cff

Observation 0c9ded1d-abc4-4eda-9bb9-6399ec53a938 · outbound

This paper cites Quantum tanner codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quantum tanner codes

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.883195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.768656Z digest=sha256:35860d0fce3a33e6a161d7993d8da6c003b88724a887aa53ddcff57bc86b1923

Observation 16f96cb6-3360-40a8-8a59-56635825aeaf · outbound

This paper cites Good quantum ldpc codes with linear time decoders.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Good quantum ldpc codes with linear time decoders

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.838581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.774141Z digest=sha256:e6a2a12a09ed2a565eb327d84dc20d18245e9531cbf59b41676e8d5b69ef5c19

Observation c04b9e7a-6502-4a26-9886-9367940fa5d9 · outbound

This paper cites Constant-overhead quantum error correction with thin planar connectivity.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Constant-overhead quantum error correction with thin planar connectivity

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.807232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.779713Z digest=sha256:e5618ea9e80025d5791c7534b6750b7a2825517df9f2b94a2ea1c2f32134edf4

Observation d54e8ebf-e2d0-44d0-b877-40448b53b010 · outbound

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

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes High-threshold and low- overhead fault-tolerant quantum memory

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.787350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.784887Z digest=sha256:1266c471cbab1b3c27b17f87f155dfee7328568abc11ccabffce662cd1dbcfee

Observation 59671d4a-d20e-4077-bd6f-9fe05fa9bd2b · outbound

This paper cites Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.789575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.789575Z digest=sha256:e28502b8bcc29f4fd2324cde915d18c1c2c82048e638b86e6afd1e2e5488dadd

Observation deaeb51e-4db2-4ad4-a21e-1d52b196ebe5 · outbound

This paper cites Pla- nar quantum low-density parity-check codes with open boundaries.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Pla- nar quantum low-density parity-check codes with open boundaries

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.766624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.795683Z digest=sha256:55984f774a102b518c84c7c77885dc69ba74c8eeea4b2cd3581cc0c9a5a2fca5

Observation 819a5b86-ef5b-438a-8aae-cfeef0420b2b · outbound

This paper cites Tile Codes: High- Efficiency Quantum Codes on a Lattice with Boundary.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Tile Codes: High- Efficiency Quantum Codes on a Lattice with Boundary

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.745366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.800825Z digest=sha256:cc606118306fd0614d996f59d1c1bb3309be52cd1c8d95690db8d1a8a69d1e6c

Observation 31c2a7a4-7e8f-4429-8f3c-da87b7f14088 · outbound

This paper cites Lowering connectivity requirements for bivariate bicycle codes using morphing circuits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Lowering connectivity requirements for bivariate bicycle codes using morphing circuits

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.726283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.806098Z digest=sha256:caef9b16f153055abf6c1d8b43193b972b7d2b7e57e43587b350102aad4f7c57

Observation 9b42bf68-2c88-43c4-ac70-7003fc91fa20 · outbound

This paper cites Direc- tional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Direc- tional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.705669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.811329Z digest=sha256:2a1d51732d358eb9534de72f41d6cfbbc1194de34f9da4972893e37e368434e7

Observation c6df79d0-163a-4dea-b390-b117b12e3e78 · outbound

This paper cites Demonstration of low-overhead quantum error correction codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Demonstration of low-overhead quantum error correction codes

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.817229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.817229Z digest=sha256:5e4efe6b8f8ca42a58b3d695746e4cdd99846a41e4e2670a3fc12bd7ec4068e4

Observation b8128c59-34da-49ee-91c4-831914d15f9b · outbound

This paper cites Realization of High-Fidelity Perfect Entanglers between Remote Superconducting Quantum Processors.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Realization of High-Fidelity Perfect Entanglers between Remote Superconducting Quantum Processors

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.682751Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.823217Z digest=sha256:4929cd09840a740e036f6e92091e348e3419f758c10cc1445c666ee3280c3b3c

Observation 1fd39909-bb0e-44b3-b780-4248903cb407 · outbound

This paper cites Microwave Quantum Link between Superconducting Circuits Housed in Spatially Sepa- rated Cryogenic Systems.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Microwave Quantum Link between Superconducting Circuits Housed in Spatially Sepa- rated Cryogenic Systems

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.665048Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.828267Z digest=sha256:953718fe01f81a693dbf039e01c158f316493e0eeccb5251a7a420ce07fa7f1a

Observation 3af8bdca-4f5f-4cfa-a879-b43218f656f5 · outbound

This paper cites Determin- istic Remote Entanglement of Superconducting Circuits through Microwave Two-Photon Transitions.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Determin- istic Remote Entanglement of Superconducting Circuits through Microwave Two-Photon Transitions

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.648492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.832868Z digest=sha256:f307eb69d43f00203a88df619c09dbe1b805eea1c40c06070cec9f4daa73189b

Observation 0069ef5a-f3f4-4032-ba57-f28cbf4b0c31 · outbound

This paper cites Entanglement Purification and Protec- tion in a Superconducting Quantum Network.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Entanglement Purification and Protec- tion in a Superconducting Quantum Network

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.623322Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.837367Z digest=sha256:7f62b51d1564143d2ace4e62d79da15d54339ca9f941749f352901254ecb1a86

Observation 588dd186-a957-4d85-b66b-aecd5b617424 · outbound

This paper cites A Superconduct- ing Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes A Superconduct- ing Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.599184Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.842475Z digest=sha256:5bd60fba0203411f4851ed0ae62e41f32669b5d7b41b747e4478d3e37774bbc7

Observation 2c52d73c-2982-4849-b629-15d76937fc65 · outbound

This paper cites Placing and Routing Non-Local Quantum Error Correcting Codes in Multi- Layer Superconducting Qubit Hardware.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Placing and Routing Non-Local Quantum Error Correcting Codes in Multi- Layer Superconducting Qubit Hardware

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.580502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.847420Z digest=sha256:c28fda896846a6177cf4e1ead2b4476a2d4a1f5418a13e33bd2e8bb10f971df5

Observation 21106ed6-e748-4fd7-b9a7-a5d2d2c38861 · outbound

This paper cites Stim: a fast stabilizer circuit simulator.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Stim: a fast stabilizer circuit simulator

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.556732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.852383Z digest=sha256:53ec214b895d29731e7f069fce8d633feb33cdb9773512506b017e9b66d88243

Observation c7c897f4-c28c-441a-a1c3-bfcc0cbd2eaf · outbound

This paper cites Sparse Blossom: correcting a million errors per core second with minimum-weight matching.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Sparse Blossom: correcting a million errors per core second with minimum-weight matching

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.531878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.856838Z digest=sha256:97b6c78f6c84e01aa589816a10178cf06c619078931b07eefa853fb4a9b6771e

Observation c5f39999-47b7-4a98-8556-72f220bc2e10 · outbound

This paper cites an unresolved cited work.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Unresolved cited work

Reference 32

Resolution
unresolved
raw_fallback, observed 2026-08-05T13:17:03.509728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.861551Z digest=sha256:3ac8d81ad31fb5ea8c1285a10b03bd6e10cdf45ff484cb344807de8f62802cf5

Observation 38e6e047-5016-4eaf-8645-9035b195f74b · outbound

This paper cites Projective plane and planar quantum codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Projective plane and planar quantum codes

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.484573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.866400Z digest=sha256:dd0e7378117c900a75a663cc281bbab4df3bcb76951df78aefa9f48ab0eecbf9

Observation f19e07a7-8918-4aeb-bc14-80eb15a6b08c · outbound

This paper cites Suppressing quantum errors by scaling a surface code logical qubit.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Suppressing quantum errors by scaling a surface code logical qubit

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.464331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.872005Z digest=sha256:2ff08153788ead1e738fb868129afdeabb0c53c1e5e4ea88c6a21c3c02afb485

Observation f66c64b1-1525-4605-a2fb-bb2c11254d03 · outbound

This paper cites Tradeoffs for Re- liable Quantum Information Storage in 2D Systems.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Tradeoffs for Re- liable Quantum Information Storage in 2D Systems

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.442592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.876892Z digest=sha256:cffd1c338b3babf53b69de22f621a4ee96ffd609c091f7348102f8e97aedc46a

Observation 0c838b26-5e6c-4d2a-ad1f-7f329d3c96a5 · outbound

This paper cites Realizing repeated quantum error cor- rection in a distance-three surface code.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Realizing repeated quantum error cor- rection in a distance-three surface code

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.421458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.882155Z digest=sha256:ea9405a0a02d9029ce0797892a7f849b62d7152ee093f0b5c621846e1a6fc30c

Observation ab97782b-034f-47fe-ad62-ebf6471c7426 · outbound

This paper cites Realization of an Error-Correcting Surface Code with Superconducting Qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Realization of an Error-Correcting Surface Code with Superconducting Qubits

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.399995Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.887354Z digest=sha256:00bdeedb5c554e62d02fc861611d21aee761c85371e79bdb3c66a6760d11f657

Observation e64e51a5-d67b-4a4a-8ed7-92a2bf616e89 · outbound

This paper cites Architectural mechanisms of a universal fault-tolerant quantum computer.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Architectural mechanisms of a universal fault-tolerant quantum computer

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.892706Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.892706Z digest=sha256:5a02f13b02c4acad2fdc0a6d423940a31ee72b48789168c74ca419a972f645c2

Observation 653cb6bd-258b-4ddd-b821-df449cde5658 · outbound

This paper cites Topological quantum memory.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Topological quantum memory

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.379527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.897987Z digest=sha256:0612ce4da3a9d1e232ec5142af7b514557e9043a153837ef899d74f4d638f827

Observation 79166acf-b51f-4ccd-a430-830ece42e016 · outbound

This paper cites Optimal complexity correction of correlated errors in the surface code.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Optimal complexity correction of correlated errors in the surface code

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.903181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.903181Z digest=sha256:53d0d433b49cbdeb7ac4998fba6496510e70d7d38b5402cbfe3c01519ae29169

Observation 1bdaf46c-b51c-4fda-bd6b-9914a6832538 · outbound

This paper cites Pymatching: A python package for decod- ing quantum codes with minimum-weight perfect match- ing.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Pymatching: A python package for decod- ing quantum codes with minimum-weight perfect match- ing

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.908208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.908208Z digest=sha256:d52347adb2e592f439e4778cef9c0177f4e309f21d7dd8abe8d40b018b7476cf

Observation ac063420-c095-46cd-b204-59971e597eff · outbound

This paper cites Generalized toric codes on twisted tori for quantum error correction.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Generalized toric codes on twisted tori for quantum error correction

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.914425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.914425Z digest=sha256:b6fd793f1af90a74a4deb958cd62ac2601368327cd881d2ef24d27ce796df1b8

Observation 3ee2ee8a-e540-4ce1-af20-fbf05a9b695b · outbound

This paper cites Error correcting codes in quantum the- ory.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Error correcting codes in quantum the- ory

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.357897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.919994Z digest=sha256:ad12b68ab1ee74fed35233af01619320cb29d9af4fd69834b589b72b985ad6b0

Observation 68700aa5-0d28-4f9d-88dd-1b097a5c54af · outbound

This paper cites Good quantum error- correcting codes exist.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Good quantum error- correcting codes exist

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.338109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.926058Z digest=sha256:46dcc054765b69e82a7b60d9843db979e819b9cb24d857956b651a9a3b78a0c6

Observation c3b88a23-be0b-4cc7-912f-87fffdf47688 · outbound

This paper cites Stabilizer Codes and Quantum Error Correction.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Stabilizer Codes and Quantum Error Correction

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.930888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.930888Z digest=sha256:480a9dd8d65b1a800fddefd4fa159851457e33b622c7aeb5b301d785737bf07c

Observation d934bfa6-9f39-484f-9be1-7a8ead29ab76 · outbound

This paper cites Quantum kronecker sum-product low-density parity-check codes with finite rate.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quantum kronecker sum-product low-density parity-check codes with finite rate

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.314865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.936237Z digest=sha256:312292a228a184d8e2b4c22394c5f15d657a19f91543b9bbeabb05a1dc8ef40f

Observation 2dc1d07d-7527-4146-9469-a22a2d5511e6 · outbound

This paper cites Sparse- graph codes for quantum error correction.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Sparse- graph codes for quantum error correction

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.290404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.941045Z digest=sha256:c13ecb8d70d0ccb92104b4b412a8dca435089181c2a0eb2f934960d8faa942ec

Observation 19d53488-0e37-42a4-915b-608286e6cd35 · outbound

This paper cites Commuting pauli hamiltonians as maps be- tween free modules.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Commuting pauli hamiltonians as maps be- tween free modules

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.263388Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.945771Z digest=sha256:a04898de3aa8240a3602753005bf0bfd962f21637d93f6622ed9b14493dfb685

Observation cfb4d4c3-2bb9-4e37-8a09-e809abbda675 · outbound

This paper cites Extract- ing topological orders of generalized pauli stabilizer codes in two dimensions.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Extract- ing topological orders of generalized pauli stabilizer codes in two dimensions

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.240835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.950717Z digest=sha256:ceb61405ee1b646cddf70f8f1070baed3c1188d6672147168147e7264e9af6b9

Observation 00d89220-19b3-4c9f-a4bb-836de2521efe · outbound

This paper cites Optimal Quantum Circuits for Nearest-Neighbor Architectures.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Optimal Quantum Circuits for Nearest-Neighbor Architectures

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.217202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.955423Z digest=sha256:1398f84815a17a1016d20c42f8a8095df024d8f77b4df91c0fa62c0604361858

Observation 7ae0e082-c414-431f-b7a5-708b036c048b · outbound

This paper cites Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.196274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.960236Z digest=sha256:a87edffe88ee388d5b6a28cf3a986ad2e969019916fb453635c4f4fd8abf3346

Observation a773ef16-f6a8-4a24-a3b5-eed5505e4e7b · outbound

This paper cites Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.176428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.965914Z digest=sha256:aa2e8e9a23efd236cfb754fdbce74993deed5becd02572c0401aefef1c7dcb93

Observation 2608b10b-ee28-4b5f-b694-b09150798c95 · outbound

This paper cites QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architec- tures.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architec- tures

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.156125Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.970722Z digest=sha256:9a41f148a51fd2ca876a4d70e0544f110dd655f27ba3026289dcd8100adb6cdc

Observation 57e6cbbf-0795-4dfe-b963-d227baa89991 · outbound

This paper cites To- ward a 2d local implementation of quantum low-density parity-check codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes To- ward a 2d local implementation of quantum low-density parity-check codes

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.136458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.975227Z digest=sha256:3eae3f233ed65fd24af752634f540985121af35cf981728114e0a569475a89ac

Observation 8551199c-234e-458b-892e-856b22388828 · outbound

This paper cites Fault-tolerance thresholds for the surface code with fabrication errors.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Fault-tolerance thresholds for the surface code with fabrication errors

Reference 55

Resolution
verified exact
local_arxiv, observed 2026-08-05T13:17:02.555703Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.980096Z digest=sha256:ed16cbe5fe8842370113f36ebce907a6c63d086926491dac9300b16a32116acd

Observation 912d400f-98e3-4685-b91f-d239feeaa470 · outbound

This paper cites LUCI in the Surface Code with Dropouts.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes LUCI in the Surface Code with Dropouts

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:01.985361Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:01.985361Z digest=sha256:65321d2f2ce53385dee0e83f10873e8add4455238db415d42e238a0bf5fd62fc

Observation 5c53629e-6cd0-40a6-aed0-e6ddc968bc2d · outbound

This paper cites Topological and subsystem codes on low-degree graphs with flag qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Topological and subsystem codes on low-degree graphs with flag qubits

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.113138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.990182Z digest=sha256:d16b960e047684e16b15ed5e683fdd04e78a90602bc87df21a8875674f6d5b29

Observation 207316a0-cfd2-4fcc-a0e8-fb365fb7a7ff · outbound

This paper cites Dynamically Generated Logical Qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Dynamically Generated Logical Qubits

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.091366Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:01.995422Z digest=sha256:dba8dd46eebe13cb0acc77a5c3be637eef675d22923e2ee1086774248ca687f1

Observation aabb367b-3471-4b1b-b5f4-a7d485667725 · outbound

This paper cites Broshuis, The Small Stellated Dodecahedron Code - Finding Interleaved Measurement Schedules, Bachelor’s thesis, TU Delft, Delft, Netherland (2024).

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Broshuis, The Small Stellated Dodecahedron Code - Finding Interleaved Measurement Schedules, Bachelor’s thesis, TU Delft, Delft, Netherland (2024)

Reference 59

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.072208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.000226Z digest=sha256:79b8ab4a27988a9986867024b84079eef2398edb5cb472df49bd4c1b88db005f

Observation 28d71401-f1e3-4b60-92ab-b8ec8b99c7f3 · outbound

This paper cites Quantum Error Cor- rection with Only Two Extra Qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Quantum Error Cor- rection with Only Two Extra Qubits

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.053604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.006327Z digest=sha256:f33118fbd1e7d4c0a201e98e3bb2e454692062668d6a18716b4a4975cf4787c9

Observation 55718596-3c5e-4493-ab3a-1a489b223c80 · outbound

This paper cites Low-distance surface codes under realistic quantum noise.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Low-distance surface codes under realistic quantum noise

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.032895Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.011550Z digest=sha256:bad1860ddb50a94d35726b4146ba840ffc36945ba9e1563d1a64e8bbe4c04554

Observation 621f1c1b-2fa6-42a4-b97a-5f60055e354b · outbound

This paper cites The surface code with a twist.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes The surface code with a twist

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:03.011534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.016647Z digest=sha256:3035b118eecbfbc3985c0d8c67297ffd4d28919f259c450996e007bdf53ebfa6

Observation 6eda8170-eb65-45ef-af49-1fc643370e14 · outbound

This paper cites Bench- marking the Planar Honeycomb Code.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Bench- marking the Planar Honeycomb Code

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.993262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.021664Z digest=sha256:4267d149d28e4ce353f11391bfb92ed2ca15047ad0089c4e8844efe5bd266a9e

Observation a9874a6a-6d1d-43c0-9425-87ded20aa9b1 · outbound

This paper cites Degenerate Quantum LDPC Codes With Good Finite Length Performance.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Degenerate Quantum LDPC Codes With Good Finite Length Performance

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.972219Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.026503Z digest=sha256:d91e9bf987f1ee5c0d87b3079de2d9c26a38edee5e82d0c51653ce5a160100bb

Observation 323e8a2c-04d8-4308-bd59-77419ae0a31e · outbound

This paper cites Decoding across the quantum low-density parity-check code landscape.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Decoding across the quantum low-density parity-check code landscape

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:02.031681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:02.031681Z digest=sha256:f96864f2f9bb99f186762f367236e986c23870d080917e068dca2b88eb20234d

Observation 4ab4c49a-0879-4ba7-9d99-fab6ddf399b0 · outbound

This paper cites LDPC: Python tools for low density parity check codes.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes LDPC: Python tools for low density parity check codes

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.950585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.036373Z digest=sha256:d1234875a1949e7035de8d5ec1e52bec38c55d159b2b26d8641e5137f071375e

Observation 6e7f0dd3-10be-4db3-a1ca-981344dca104 · outbound

This paper cites Superconduct- ing processor design optimization for quantum error cor- rection performance.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Superconduct- ing processor design optimization for quantum error cor- rection performance

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.929905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.041066Z digest=sha256:eb799bdaa79a8f92b27a7c1fc39cdfaf0b4411e846298febaf071127acffd87e

Observation 9a0e251b-f75d-46ef-9d62-9cdf71ec9d62 · outbound

This paper cites Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.907246Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.046213Z digest=sha256:d5239cafa3d537f0a4c8bc12d01baf2bf02d643bd35bff0a2c10298fd29dda3c

Observation 3e1ead99-ab4a-4759-b037-9fa9a6832894 · outbound

This paper cites Spectator Errors in Tun- able Coupling Architectures.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Spectator Errors in Tun- able Coupling Architectures

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.886693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.050998Z digest=sha256:7942977bc1b7396cfd7951c54d2cbc6c4e2234363b05f1fef99b6f2525fe57ee

Observation bf50a09b-6aa2-41a6-9725-e4e842614782 · outbound

This paper cites Learning Correlated Noise in a 39-Qubit Quantum Processor.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Learning Correlated Noise in a 39-Qubit Quantum Processor

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.868354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.056286Z digest=sha256:24097e564f1044d276cc7de0f69b895cca75e99cbcd2f43a691066328ab7c55d

Observation b92b8f5c-e7e1-41cb-870d-c53110d5db52 · outbound

This paper cites Optimizing quantum gates towards the scale of logical qubits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Optimizing quantum gates towards the scale of logical qubits

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.850964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.061331Z digest=sha256:c89dcc504c79f11676bf42a7bdf62d653f47bf3afa68a21f2595ddc012dd7c61

Observation c3c23f70-e4f1-42b3-8257-ed4de68dc97c · outbound

This paper cites Low-density parity-check representation of fault- tolerant quantum circuits.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Low-density parity-check representation of fault- tolerant quantum circuits

Reference 72

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T13:17:02.832308Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T13:17:02.067787Z digest=sha256:1d5d3acd82829b6ff19b183ee3404e52329e7a32a37c6616b15f01018555bc7d

Observation 7e3da303-d43f-49ae-b565-e0bc8729fbb9 · outbound

This paper cites Designing fault-tolerant circuits using de- tector error models.

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes Designing fault-tolerant circuits using de- tector error models

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-05T13:17:02.072542Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:17:02.072542Z digest=sha256:6e1525e3f91ee23a97da372adcdf26c1da7c4b1b4e88a071e89a74d46c6d9f92

Pith citing papers

Observation e57178d8-717c-4a6a-b4a3-c8aeffdd05d9 · inbound

Placing and routing quantum LDPC codes in multilayer superconducting hardware cites this paper.

Placing and routing quantum LDPC codes in multilayer superconducting hardware A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Reference 61

Resolution
verified exact
arxiv_id, observed 2026-05-19T02:11:59.384632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-19T02:09:15.662431Z digest=sha256:52332bcc1dda6941f2e66f4cb8304bd507c5aaff04d799ed8e209944acc456b5

Observation e0bb406a-57ce-42d9-bb97-569f4022249d · inbound

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures cites this paper.

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Reference 43

Resolution
verified exact
arxiv_id, observed 2026-05-10T11:40:19.712723Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-10T04:46:26.589764Z digest=sha256:69c0bc3daaa2b7feeb0213f8317426bb7136d8297d638cec398a8c42c1c3168c

Observation 5df0a29d-3df4-40ae-9e58-d782021c4fa8 · inbound

Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture cites this paper.

Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-11T17:16:10.055517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-08T17:42:30.745093Z digest=sha256:7f266e6a37a202fa33e8d96a7965afcd2f601850e340a4dab8f13e98d239dbde

Observation 5c57d0a4-88a5-4fa0-b6bf-2501b1f8b778 · inbound

Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware cites this paper.

Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Reference 14

Resolution
metadata mismatch
arxiv_id, observed 2026-07-02T14:07:03.470400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=arxiv_source observed=2026-06-28T00:41:15.817095Z digest=sha256:6220b0ae0d92f0d139999a7028f83b7379338ef68a48b1c8255655b5faf40747

Observation 4ee7fe6f-2a2b-40b0-bb3f-60f1bbfe561d · inbound

Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices cites this paper.

Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-07-08T21:35:37.680840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-07-08T21:33:05.730954Z digest=sha256:4ca0d6e7b4adf69ac15005f91ce6b3c899e27fb406a89a866046242211abc085