Pith. sign in

REVIEW 4 major objections 6 minor 49 references

Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code

T0 review · 4 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read Clique_L2 extends cryogenic local decoding so that two adjacent data-qubit errors can be corrected in the refrigerator, cutting room-temperature offload by up to 18.38x.

desk verdict Useful incremental extension of the Clique decoder, but the missing logical-error-rate validation leaves the central bandwidth claim unsupported. read the letter →

arxiv 2507.11481 v2 pith:H3QALUOG submitted 2025-07-15 quant-ph

Zikang Jia , Shravan Veerapaneni , Gokul Subramanian Ravi This is my paper · ORCID
classification quant-ph
keywords quantumerrorcorrectionsurfacecodelocaldecodercryogenicdecodinglength-2spaceerrorsbandwidthSingle-Fluxlogicpredecoding
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proposes Clique_L2, a near-term addition to the Clique family of local decoders that lets error correction happen inside the cryogenic refrigerator instead of sending every syndrome to a room-temperature machine. The key claim is that with a small amount of extra logic, a Clique-style decoder can also resolve length-2 space error chains, where two adjacent data qubits fail together, rather than only isolated length-1 errors. Under simulated data-qubit-only, uniform, Gaussian-clustered, and Dual-Error noise models, Clique_L2 reduces the fraction of decoding tasks that must be forwarded to a full decoder by up to 8.95x, 1.44x, 8.60x, and 18.38x, respectively, compared with the original Clique_L1. The payoff, if the claim holds, is a substantial reduction in the I/O bandwidth bottleneck that otherwise limits scalable fault-tolerant quantum computers.

What carries the argument

The central object is the 'clique': a local region of the surface code centered on one ancilla (parity) qubit plus its four nearest-neighbor ancillae, whose syndrome pattern the decoder inspects to decide whether a correction can be made locally. The mechanism that carries the argument is the relaxed activation rule — a clique may act either when its center is active with odd neighborhood parity (a length-1 error) or when its center is inactive with even neighborhood parity (a length-2 space chain) — combined with a four-stage sequential pipeline that first corrects length-1 errors, then length-2 chains, then edge and corner cases, and finally forwards any residual complex syndrome to the room-temperature decoder. Intersecting cliques are scheduled with a four-coloring of the grid so that all same-colored cliques execute in parallel, keeping the added latency constant in code distance.

What would settle it

Simulate the same noise models with and without Clique_L2's local corrections, feed both resulting syndrome streams to the same room-temperature decoder, and compare logical error rates per round; if Clique_L2's corrected stream has a higher logical error rate for the same physical error rates and code distances, the bandwidth savings come at a hidden cost.

Watch

Extended reading notes

Core claim

Clique_L2 is a cryogenic first-level decoder for the surface code that corrects both length-1 and length-2 space error chains locally, leaving only longer or intersecting error patterns to a room-temperature full decoder. It achieves this by relaxing the original Clique decoder's activation condition: local correction is allowed not only when the central syndrome is set with odd neighborhood parity (length-1), but also when the central syndrome is unset with even neighborhood parity (length-2). The decoder runs a fixed four-stage pipeline — length-1 decoding, length-2 decoding, edge and corner handling, then classification of complex cases as offloads — and uses a four-coloring of the 8-connected clique grid so that intersecting cliques can still be executed in parallel with at most four sequential steps. The paper's simulations report that at code distance 21 with 0.5% data-qubit-only error rate, Clique_L2 offloads about 1.52% of decodes versus 10.70% for Clique_L1, and that the benefit grows under correlated noise models, reaching an 18.38x improvement in the Dual-Error model.

Load-bearing premise

The load-bearing assumption is that each stage's local correction is the same correction the best global decoder would apply, so shortening the syndrome stream does not increase the logical error rate; the paper asserts this 'optimal' partial correction but never measures the end-to-end logical error rate.

Editorial extensions

If this is right

  • Under data-qubit-only noise, Clique_L2 handles 97–99% of decoding tasks locally across a wide range of physical error rates, improving on Clique_L1 by 3.10x to 8.95x at higher code distances.
  • Under uniformly random noise, the offload reduction ranges from 1.22x to 1.44x, with larger gains at larger code distances.
  • Under Gaussian clustered noise, Clique_L2 cuts offload by up to 8.60x, and under the Dual-Error model by up to 18.38x, because length-2 chains are exactly the patterns that clustering produces.
  • The added cryogenic hardware is modest: a few extra gates per decoding unit, plus pipelining for the four stages and a 4-step coloring schedule.
  • The same four-stage structure leaves open a natural generalization to length-k error chains, at the price of more logic per clique.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: the paper measures only the fraction of decodes forwarded, not the logical error rate after Clique_L2 corrections; the natural next experiment is to feed the corrected syndrome stream to a full-fledged decoder and count logical errors, since a wrong local correction could hide bandwidth savings behind a higher logical error rate.
  • Beyond the paper: because the 4-coloring schedule fixes the decoder latency at four steps regardless of code distance, the same design should scale to larger patches without extra sequential cost; this is a testable prediction beyond the paper's reported distances.
  • Beyond the paper: if local length-2 correction is safe, it could be paired with adaptive thresholds that switch between Clique_L1 and Clique_L2 depending on measured noise clustering, yielding additional bandwidth savings in mixed environments.
  • Beyond the paper: the Dual-Error model mimics CNOT-propagation and chip-defect clustering; a hardware-level validation with actual defect maps would show whether such correlated errors appear often enough in practice to make the 18x case realistic.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 6 minor

Summary. The paper proposes Clique_L2, an extension of the Clique_L1 local decoder for the surface code. Clique_L2 relaxes the activation condition of the original Clique design and uses a four-stage pipeline to correct isolated length-1 errors, length-2 space error chains, and edge/corner cases locally in the cryogenic domain, offloading only complex syndromes to a room-temperature decoder. The authors evaluate the fraction of decodes offloaded under four noise models—data-qubit-only errors, uniformly random noise, Gaussian clustered noise, and a Dual-Error model—for code distances 3–19, with logistic extrapolation to distances 21–25 or 15–31, and report bandwidth-reduction improvements up to 8.95x, 1.44x, 8.60x, and 18.38x over Clique_L1. The central claim is that a small amount of additional cryogenic logic substantially reduces I/O bandwidth without compromising error correction, but the paper measures only the fraction of decodes forwarded and never the logical error rate after correction.

Significance. If the claims hold, Clique_L2 would be a meaningful improvement to local predecoding: a few extra gates per qubit and a fixed four-step scheduling discipline could reduce cryogenic I/O by up to an order of magnitude in targeted regimes. The four-coloring scheme for parallelizing intersecting cliques is a clean and useful idea, and the comparison against the original Clique_L1 baseline across several noise models is a strength. The paper is also honest that the Dual-Error model is a tailored scenario for length-2 errors. However, the significance is currently limited by the absence of any measurement of logical error rate or threshold after local correction plus global decoding; without that, the reported bandwidth reductions are not yet evidence that end-to-end decoding performance is preserved. The paper does not provide code, raw data, or fit parameters for the extrapolations, which further weakens reproducibility of the headline numbers.

major comments (4)
  1. [Section VI (Figs. 11–14); Section IV-B; Section IV-E] The evaluation measures only the fraction of decodes forwarded to a room-temperature decoder; it never measures the logical error rate after the Clique_L2 corrections are applied and the residual syndrome is decoded by the full decoder. The paper's value proposition is that local corrections reduce bandwidth without harming logical fidelity, but Section IV-B's assertion that 'each stage's partial correction is optimal' and Section IV-E's claim that the correction 'aligns with' the most probable error configuration are not proved, and Fig. 6 shows that naive independent clique corrections can alter three data qubits when only one error chain is present. Because the local decoder sees only a clique, multiple error chains of comparable weight can produce the same local syndrome; a wrong local correction shortens the forwarded syndrome but changes the physical error, potentially into a logical error. I request an end-to-end comparison of logical error rate versus physical error rate for MWPM alone, Clique_L1+MWPM, and Clique_L2+MWPM for at least d=3, 5, and 7, or a rigorous proof of correction optimality under the stated noise models. Without this, the headline improvements (8.95x, 18.38x) do not establish that bandwidth can be reduced while preserving decoding accuracy.
  2. [Section VI, Figs. 11–14] All results for code distances 21–25 (Figs. 11–12) and 15–31 (Figs. 13–14) are logistic extrapolations, but the manuscript does not report the logistic model's functional form, fitted parameters, number of data points, goodness of fit, or confidence intervals. For example, the d=21 numbers 1.52% versus 10.70% in Section VI-A and the d=25 8.68x improvement are extrapolated values, not simulation output. Please provide the fit details and raw simulated values, or restrict the quantitative claims to simulated distances; otherwise the headline factors cannot be assessed.
  3. [Section V-D; Section VI-D] The Dual-Error model is constructed to place errors on pairs of adjacent data qubits, which is exactly the length-2 space error class that Clique_L2 is designed to correct. The up-to-18.38x improvement under this model is therefore partly a consequence of the noise model construction rather than a general clustered-noise result. The paper does acknowledge the modeling choice, but Section VI-D should explicitly state that this scenario is a best-case construction for Clique_L2 and should not be quoted on equal footing with the uniformly random results. Adding a circuit-level noise model or an independently motivated correlated-noise model would strengthen the claim that the improvement generalizes.
  4. [Section VII-A1; Sections VI-B to VI-D] The manuscript's own future-work paragraph concedes that the two-round measurement error mitigation 'may overlook complex error patterns, as not all errors remain clustered after multiple measurement rounds.' Since three of the four evaluation models include measurement errors (uniformly random, Gaussian, and Dual-Error), this conceded limitation applies directly to the reported improvements in Sections VI-B through VI-D. The authors should either quantify the fraction of overlooked patterns in the simulations or temper the conclusions for the measurement-error regimes; deferring the issue to future work is not sufficient for the configurations in which bandwidth savings are claimed.
minor comments (6)
  1. [Section I] In Section I, 'two data errors occur adjust to each other' should read 'adjacent to each other', and the sentence 'We we refer to this enhanced local decoder' contains a duplicated pronoun.
  2. [Fig. 3 caption (case b)] The text for case (b) says the 'horizontal data qubits x and z' are corrected, but the parity qubits q and s are in the same column; 'vertical data qubits' appears to be intended.
  3. [Fig. 4 caption] The Stage 4 description in the Fig. 4 caption says the algorithm 'recognizes the scenario as non-complex and terminates the decoding process,' which contradicts the definition of Stage 4 as identifying complex signatures; please rephrase.
  4. [Section V-C] The Gaussian model description does not specify how clusters are formed or the standard deviation/radius parameter values used in the simulations; adding these parameters is necessary for reproducibility, especially since the cluster parameters are free parameters.
  5. [Section VI-B] The statement that 'the current measurement error mitigation logic may diminish the occurrence of length-2 errors' should specify the mechanism or provide quantitative evidence; as written, it is too vague to interpret the 1.22x–1.44x improvement.
  6. [Section VI, Figs. 11–14] Figure legends distinguish simulated from extrapolated data, but the text in Sections VI-A through VI-D does not consistently flag which numbers are extrapolated; the d=21 and d=25 examples should be labeled as extrapolations in the prose.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: Clique_L2's bandwidth improvements are measured in simulation against its predecessor, not derived from its own equations; the only self-citation is to the published Clique_L1 design it extends.

full rationale

The paper's central claim is an empirical bandwidth comparison: it simulates Clique_L1 and Clique_L2 on randomly sampled syndromes and reports the fraction forwarded to room-temperature decoders. This quantity is measured, not derived from the decoder's local-correction equations, so there is no self-definitional or fitted-input prediction. The extension's design (relaxed activation, even-parity length-2 decoding, four-stage pipeline) is logically prior to the simulation and is not justified by citing the result being claimed. The self-citation to Ravi et al. [39] supplies the predecessor Clique_L1 decoder and its hardware context; that is a normal extension citation, not a load-bearing appeal to an unverified theorem. The Dual-Error model is constructed to produce adjacent-pair (length-2) errors, so the large improvement there is partly by construction, but the paper openly describes the model as an orchestrated scenario for correlated length-2 chains, making it a targeted benchmark rather than a disguised derivation of the result. The more serious concern, noted in Sections IV-B and VII-A1, is that the logical error rate after local correction is never reported, so the bandwidth savings are not tied to end-to-end correctness. That is a correctness and validation gap, not circularity, because nothing in the claimed improvement is assumed as its own conclusion.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claim rests on two hand-constructed noise models, an unreported logistic extrapolation, and an unverified assumption that local corrections are globally consistent. There are no invented physical entities; the contribution is entirely in decoding logic.

free parameters (3)
  • Logistic extrapolation model parameters for code distances 21-25 = not reported
    Section VI states a logistic model is applied to extrapolate from d=19 to d=25, but the parameters and fit quality are not given. Several headline improvement ratios use these extrapolated values.
  • Gaussian noise model cluster parameters = not specified
    Section V-A describes grouping errors into clusters with Gaussian probability near cluster centers, but the cluster width, placement rules, and number of clusters are not specified, making the model non-reproducible and its parameters free choices.
  • Dual-Error model edge selection rate = physical error rate p
    Section V-A says edges are randomly selected according to the physical qubit error rate; the mapping from p to per-edge probability is not explicitly defined, so the model has unspecified hand-chosen constants.
assumptions (4)
  • domain assumption The probability of an error chain spanning k qubits scales as O(p^k), so shorter chains are exponentially more likely and the most probable explanation of a local syndrome is the shortest chain.
    Invoked in Section III-A and IV-E to justify correcting length-1 and length-2 chains before considering longer configurations. This is a standard assumption for independent noise but not proven in the paper.
  • ad hoc to paper The local syndrome patterns used by Clique_L2 (e.g., two set parity qubits with unset center) uniquely identify the most probable error chain up to stabilizer equivalence.
    The correction rules in Fig 3 and Section IV-A assume the indicated data qubits are the errors. No proof or logical-error-rate simulation is provided that these choices are always consistent with global optimality.
  • domain assumption Measurement errors can be distinguished from data errors by taking two rounds of syndrome measurements and attributing persistent errors to data qubits.
    Section IV-F states this approach, inherited from Clique_L1, without analyzing the residual error rate; this is a standard engineering approximation.
  • ad hoc to paper The trend in the fraction of offloaded decodes continues smoothly beyond code distance 19, so a logistic fit can be extrapolated to d=25.
    Section VI: 'starting from code distance 19, we apply the logistic model to extrapolate the data up to code distance 25 since the trends persist.' The persistence is asserted, not demonstrated.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code." pith.science (2026). https://pith.science/paper/H3QALUOG

@misc{pith2026250711481,
  author       = {Pith},
  title        = {Pith review of: Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/H3QALUOG}},
  note         = {Machine review of arXiv:2507.11481}
}
read the original abstract

The growing demand for fault-tolerant quantum computing drives the need for efficient, scalable Quantum Error Correction (QEC) strategies. Conventional decoders designed for worst-case error scenarios incur significant overhead, prompting the development of local decoders, that leverage the sparse and often trivial nature of many quantum errors, to support the conventional decoders. The previously proposed Clique decoder addresses this by handling isolated, length-1 space and time errors within the cryogenic environment with minimal hardware costs, thereby mitigating I/O bandwidth constraints between cryogenic quantum systems and room-temperature processors. Building on this foundation, we propose Clique_L2 that extends the Clique-based approach by relaxing some original constraints and incorporating additional low-cost logic to also correct length-2 error chains in space, which become non-trivial occurrences at higher physical error rates and code distances. This enhanced capability not only further reduces out-of-the-fridge data transmission but also adapts more effectively to clustered errors observed under a variety of noise models. Specifically, under data-qubit-only errors and uniformly random noise, Clique_L2 achieves up to 8.95x decoding bandwidth reduction over the original Clique (or Clique_L1) decoder, especially beneficial at higher code distances. When clustered errors and longer error chains are more likely to occur, Clique_L2 achieves up to 18.3x decoding bandwidth reduction over Clique_L1, achieving substantial benefits across a wide range of physical qubit error rates.

Figures

Figures reproduced from arXiv: 2507.11481 by the authors.

Figure 2
Figure 2. Clique_L1 evaluates the syndromes within each local clique region and determines whether the error pattern is simple enough to be decoded locally. If yes, the corresponding correction can be applied to the neighboring data qubit. B. Design of Clique_L1 The functionality of the Clique_L1 decoder is realized by analyzing the parity syndromes from each local ‘Clique’ of ancilla qubits [PITH_FULL_IMAGE:figures/full_fig… view at source ↗
Figure 3
Figure 3. Scenarios with space error lengths k ≥ 2 that are detected and corrected with Clique_L2: (a) horizontal, (b) vertical, (c) diagonal, (d) mixed. 3) The special decoding and correction rules for edges and corners in the Clique_L1 decoder must be care￾fully adapted to avoid conflicts with the enhanced Clique_L2 strategy. By addressing and analyzing each challenge, we propose a four-stage sequence to execute the Clique_… view at source ↗
Figure 5
Figure 5. Decoding scenarios for Clique_L2 with non-intersecting Cliques: (a) error chains of length 1 and length 2; (b) error chains of length 2 and corner error. D. Decoding Intersecting Cliques The examples discussed in [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: An example of the sequential four-stage pipeline for [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 8
Figure 8. Figure 8: An error configuration example. (a) The initial error configuration [PITH_FULL_IMAGE:figures/full_fig_p007_8.png]
Figure 7
Figure 7. Figure 7: Example illustrating parallel execution of non-intersecting Cliques [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 9
Figure 9. Figure 9: Design of Gaussian model. select random edges shared-edge qubits flip [PITH_FULL_IMAGE:figures/full_fig_p008_9.png]
Figure 10
Figure 10. Figure 10: Design of Dual-Error model. A Gaussian noise model describes a scenario in which qubit errors tend to cluster in groups and additional errors are more likely to occur near an existing error. Such clustered errors can be caused by fabrication defects, mis-directed qubi…
Figure 11
Figure 11. Figure 11: Decodes handled by Cliques under no measurement error: (a) [PITH_FULL_IMAGE:figures/full_fig_p009_11.png]
Figure 13
Figure 13. Figure 13: Decodes handled by Cliques under measurement error and Gaussian [PITH_FULL_IMAGE:figures/full_fig_p010_13.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

49 extracted references · 43 canonical work pages

  1. [1]

    Quantinuum extends its significant lead in quantum computing, achiev- ing historic milestones for hardware fidelity and quantum volume,

    “Quantinuum extends its significant lead in quantum computing, achiev- ing historic milestones for hardware fidelity and quantum volume,” https://www.quantinuum.com/blog/quantinuum-extends-its-significant- lead-in-quantum-computing-achieving-historic-milestones-for-hardware -fidelity-and-quantum-volume

    work page

  2. [2]

    Technical perspective: By the end of the decade, we will deliver univer- sal, fully fault-tolerant quantum computing,

    “Technical perspective: By the end of the decade, we will deliver univer- sal, fully fault-tolerant quantum computing,” https://www.quantinuum. com/blog/technical-perspective-by-the-end-of-the-decade-we-will -deliver-universal-fault-tolerant-quantum-computing

    work page

  3. [3]

    Fault-tolerant quantum computation with constant error rate,

    D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error rate,” 1999. [Online]. Available: https://arxiv.org/ abs/quant-ph/9906129

    arXiv 1999

  4. [4]

    Pro- match: Extending the reach of real-time quantum error correction with adaptive predecoding,

    N. Alavisamani, S. Vittal, R. Ayanzadeh, P. Das, and M. Qureshi, “Pro- match: Extending the reach of real-time quantum error correction with adaptive predecoding,” in Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, V olume 3, 2024, pp. 818–833

    work page 2024

  5. [5]

    A real-time, scalable, fast and resource-efficient decoder for a quantum computer,

    B. Barber, K. M. Barnes, T. Bialas, O. Bu ˘gdaycı, E. T. Campbell, N. I. Gillespie, K. Johar, R. Rajan, A. W. Richardson, L. Skoric et al. , “A real-time, scalable, fast and resource-efficient decoder for a quantum computer,” Nature Electronics, pp. 1–8, 2025

    work page 2025

  6. [6]

    Design and characterization of a 28-nm bulk-cmos cryogenic quantum controller dissipating less than 2 mw at 3 k,

    J. C. Bardin, E. Jeffrey, E. Lucero, T. Huang, S. Das, D. T. Sank, O. Naaman, A. E. Megrant, R. Barends, T. White et al. , “Design and characterization of a 28-nm bulk-cmos cryogenic quantum controller dissipating less than 2 mw at 3 k,” IEEE Journal of Solid-State Circuits , vol. 54, no. 11, pp. 3043–3060, 2019

    work page 2019

  7. [7]

    29.1 a 28nm bulk-cmos 4-to-8ghz¡ 2mw cryogenic pulse modulator for scalable quantum computing,

    J. C. Bardin, E. Jeffrey, E. Lucero, T. Huang, O. Naaman, R. Barends, T. White, M. Giustina, D. Sank, P. Roushan et al. , “29.1 a 28nm bulk-cmos 4-to-8ghz¡ 2mw cryogenic pulse modulator for scalable quantum computing,” in 2019 IEEE International Solid-State Circuits Conference-(ISSCC). IEEE, 2019, pp. 456–458

    work page 2019

  8. [8]

    Quantum dots array on ultra-thin soi nanowires with ferromagnetic cobalt barrier gates for enhanced spin qubit control,

    F. Bersano, M. Aldeghi, E. Collette, M. Ghini, F. De Palma, F. Oppliger, P. Scarlino, F. Braakman, M. Poggio, H. Riel et al. , “Quantum dots array on ultra-thin soi nanowires with ferromagnetic cobalt barrier gates for enhanced spin qubit control,” in 2023 IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits) . IEEE, 2023, pp. 1–2

    work page 2023

Show all 49 references
  1. [9]

    Xqsim: modeling cross- technology control processors for 10+ k qubit quantum computers,

    I. Byun, J. Kim, D. Min, I. Nagaoka, K. Fukumitsu, I. Ishikawa, T. Tanimoto, M. Tanaka, K. Inoue, and J. Kim, “Xqsim: modeling cross- technology control processors for 10+ k qubit quantum computers,” in Proceedings of the 49th Annual International Symposium on Computer Archite...

    2022

  2. [10]

    Averting multi-qubit burst errors in surface code magic state factories,

    J. D. Chadwick, C. Kang, J. Viszlai, S. F. Lin, and F. T. Chong, “Averting multi-qubit burst errors in surface code magic state factories,” in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) , vol. 1. IEEE, 2024, pp. 1089–1101

    2024

  3. [11]

    A cryo-cmos low-power semi-autonomous transmon qubit state controller in 14-nm finfet technology,

    S. Chakraborty, D. J. Frank, K. Tien, P. Rosno, M. Yeck, J. A. Glick, R. Robertazzi, R. Richetta, J. F. Bulzacchelli, D. Underwood et al. , “A cryo-cmos low-power semi-autonomous transmon qubit state controller in 14-nm finfet technology,” IEEE Journal of Solid-State Circuits ...

    2022

  4. [12]

    Techniques for combining fast local decoders with global de- coders under circuit-level noise,

    C. Chamberland, L. Goncalves, P. Sivarajah, E. Peterson, and S. Grim- berg, “Techniques for combining fast local decoders with global de- coders under circuit-level noise,” Quantum Science and Technology , vol. 8, no. 4, p. 045011, 2023

    2023

  5. [13]

    Supercore: An ultra-fast superconducting proces- sor for cryogenic applications,

    J. Choi, I. Byun, J. Hong, D. Min, J. Kim, J. Cho, H. Jeong, M. Tanaka, K. Inoue, and J. Kim, “Supercore: An ultra-fast superconducting proces- sor for cryogenic applications,” in 2024 57th IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2024, pp. 1532– 1547

    2024

  6. [14]

    Prescription for experimental deter- mination of the dynamics of a quantum black box,

    I. L. Chuang and M. A. Nielsen, “Prescription for experimental deter- mination of the dynamics of a quantum black box,” Journal of Modern Optics, vol. 44, no. 11-12, pp. 2455–2467, 1997

    1997

  7. [15]

    Lilliput: a lightweight low-latency lookup-table decoder for near-term quantum error correction,

    P. Das, A. Locharla, and C. Jones, “Lilliput: a lightweight low-latency lookup-table decoder for near-term quantum error correction,” in Pro- ceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 2022, pp. 541–553

    2022

  8. [16]

    Afs: Accurate, fast, and scalable error- decoding for fault-tolerant quantum computers,

    P. Das, C. A. Pattison, S. Manne, D. M. Carmean, K. M. Svore, M. Qureshi, and N. Delfosse, “Afs: Accurate, fast, and scalable error- decoding for fault-tolerant quantum computers,” in 2022 IEEE Interna- tional Symposium on High-Performance Computer Architecture (HPCA), 2022, p...

    2022

  9. [17]

    Hierarchical decoding to reduce hardware requirements for quantum computing,

    N. Delfosse, “Hierarchical decoding to reduce hardware requirements for quantum computing,” arXiv preprint arXiv:2001.11427 , 2020

    2001 arXiv

  10. [18]

    Almost-linear time decoding algo- rithm for topological codes,

    N. Delfosse and N. H. Nickerson, “Almost-linear time decoding algo- rithm for topological codes,” Quantum, vol. 5, p. 595, 2021

    2021

  11. [19]

    Topological quantum memory,

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4452–4505, sep 2002. [Online]. Available: https://doi.org/10.1063 \ %2F1.1499754

    2002

  12. [20]

    Surface codes: Towards practical large-scale quantum computation,

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, no. 3, sep 2012. [Online]. Available: https://doi.org/10.1103%2Fphysreva.86.032324

    2012

  13. [21]

    Low power cryogenic rf asics for quantum computing,

    D. J. Frank, S. Chakraborty, K. Tien, P. Rosno, M. Yeck, J. A. Glick, R. Robertazzi, R. Richetta, J. F. Bulzacchelli, D. Ramirez et al. , “Low power cryogenic rf asics for quantum computing,” in 2023 IEEE Custom Integrated Circuits Conference (CICC) . IEEE, 2023, pp. 1–8

    2023

  14. [22]

    Codesign of quantum error-correcting codes and modular chiplets in the presence of defects,

    S. Fuhui Lin, J. Viszlai, K. N. Smith, G. Subramanian Ravi, C. Yuan, F. T. Chong, and B. J. Brown, “Codesign of quantum error-correcting codes and modular chiplets in the presence of defects,” arXiv e-prints , pp. arXiv–2305, 2023

    2023

  15. [23]

    A fast quantum mechanical algorithm for database search,

    L. K. Grover, “A fast quantum mechanical algorithm for database search,” in ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUT- ING. ACM, 1996, pp. 212–219

    1996

  16. [24]

    Sparse blossom: correcting a million errors per core second with minimum-weight matching,

    O. Higgott and C. Gidney, “Sparse blossom: correcting a million errors per core second with minimum-weight matching,” Quantum, vol. 9, p. 1600, 2025

    2025

  17. [25]

    Flip- chip-based fast inductive parity readout of a planar superconducting island,

    M. Hinderling, S. t. Kate, D. Z. Haxell, M. Coraiola, S. Paredes, E. Cheah, F. Krizek, R. Schott, W. Wegscheider, D. Saboniset al., “Flip- chip-based fast inductive parity readout of a planar superconducting island,” PRX Quantum , vol. 5, no. 3, p. 030337, 2024

    2024

  18. [26]

    Nisq+: Boosting quantum computing power by approximating quantum error correction,

    A. Holmes, M. R. Jokar, G. Pasandi, Y . Ding, M. Pedram, and F. T. Chong, “Nisq+: Boosting quantum computing power by approximating quantum error correction,” in 2020 ACM/IEEE 47th annual international symposium on computer architecture (ISCA) . IEEE, 2020, pp. 556–569

    2020

  19. [27]

    Supernpu: An extremely fast neural processing unit using superconducting logic devices,

    K. Ishida, I. Byun, I. Nagaoka, K. Fukumitsu, M. Tanaka, S. Kawakami, T. Tanimoto, T. Ono, J. Kim, and K. Inoue, “Supernpu: An extremely fast neural processing unit using superconducting logic devices,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture ...

    2020

  20. [28]

    Digiq: A scalable digital controller for quantum computers using sfq logic,

    M. R. Jokar, R. Rines, G. Pasandi, H. Cong, A. Holmes, Y . Shi, M. Pe- dram, and F. T. Chong, “Digiq: A scalable digital controller for quantum computers using sfq logic,” in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) . IEEE, 2022, pp. 400–414

    2022

  21. [29]

    64-ghz datapath demonstration for bit-parallel sfq microprocessors based on a gate-level-pipeline structure,

    R. Kashima, I. Nagaoka, M. Tanaka, T. Yamashita, and A. Fujimaki, “64-ghz datapath demonstration for bit-parallel sfq microprocessors based on a gate-level-pipeline structure,” IEEE Transactions on Applied Superconductivity, vol. 31, no. 5, pp. 1–6, 2021

    2021

  22. [30]

    A fault-tolerant million qubit-scale distributed quantum computer,

    J. Kim, D. Min, J. Cho, H. Jeong, I. Byun, J. Choi, J. Hong, and J. Kim, “A fault-tolerant million qubit-scale distributed quantum computer,” in Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, V olu...

    2024

  23. [31]

    Ersfq-zero static power dissipation single flux quantum logic,

    A. Kirichenko, S. Sarwana, and I. Vernik, “Ersfq-zero static power dissipation single flux quantum logic,” 03 2012

    2012

  24. [32]

    A 40 gs/s 8b-dac sst-tx in 7 nm finfet cmos for cryogenic quantum applications with 32kb srambased rf-dds awg,

    M. Kossel, M. Br ¨andli, M. Prathapan, T. Morf, P. A. Francese, C. Zota, A. Ruffino, P. S. Almagro, M. V . Oropallo, D. Heim et al. , “A 40 gs/s 8b-dac sst-tx in 7 nm finfet cmos for cryogenic quantum applications with 32kb srambased rf-dds awg,” in 2024 IEEE European Solid-St...

    2024

  25. [33]

    Snakes and ladders: Adapting the surface code to defects,

    C. Leroux, S. F. Lin, P. Bienias, K. R. Sankar, A. Benhemou, A. Kubica, and J. K. Iverson, “Snakes and ladders: Adapting the surface code to defects,” arXiv preprint arXiv:2412.11504 , 2024

    2024

  26. [34]

    Scalable quantum error correction for surface codes using fpga,

    N. Liyanage, Y . Wu, A. Deters, and L. Zhong, “Scalable quantum error correction for surface codes using fpga,” in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) , vol. 1. IEEE, 2023, pp. 916–927

    2023

  27. [35]

    Cryowire: wire-driven microarchitecture designs for cryogenic computing,

    D. Min, Y . Chung, I. Byun, J. Kim, and J. Kim, “Cryowire: wire-driven microarchitecture designs for cryogenic computing,” in Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 2022, pp. 903–917

    2022

  28. [36]

    Qisim: Architecting 10+ k qubit qc interfaces toward quantum supremacy,

    D. Min, J. Kim, J. Choi, I. Byun, M. Tanaka, K. Inoue, and J. Kim, “Qisim: Architecting 10+ k qubit qc interfaces toward quantum supremacy,” in Proceedings of the 50th Annual International Symposium on Computer Architecture , 2023, pp. 1–16

    2023

  29. [37]

    A fully integrated cryo-cmos soc for state manipulation, readout, and high-speed gate pulsing of spin qubits,

    J. Park, S. Subramanian, L. Lampert, T. Mladenov, I. Klotchkov, D. J. Kurian, E. Juarez-Hernandez, B. P. Esparza, S. R. Kale, A. B. KT et al., “A fully integrated cryo-cmos soc for state manipulation, readout, and high-speed gate pulsing of spin qubits,” IEEE Journal of Solid-...

    2021

  30. [38]

    Quantum computing in the nisq era and beyond,

    J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, p. 79, 2018

    2018

  31. [39]

    Better than worst-case decoding for quantum error correction,

    G. S. Ravi, J. M. Baker, A. Fayyazi, S. F. Lin, A. Javadi-Abhari, M. Pedram, and F. T. Chong, “Better than worst-case decoding for quantum error correction,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operatin...

    2023

  32. [40]

    Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,

    P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, p. 1484–1509, Oct 1997. [Online]. Available: http://dx.doi.org/10.1137/S0097539795293172

    1997 doi

  33. [41]

    Scaling superconducting quantum computers with chiplet architectures,

    K. N. Smith, G. S. Ravi, J. M. Baker, and F. T. Chong, “Scaling superconducting quantum computers with chiplet architectures,” 2022. [Online]. Available: https://arxiv.org/abs/2210.10921

    2022 arXiv

  34. [42]

    Local predecoder to reduce the bandwidth and latency of quantum error correction,

    S. C. Smith, B. J. Brown, and S. D. Bartlett, “Local predecoder to reduce the bandwidth and latency of quantum error correction,” Physical Review Applied, vol. 19, no. 3, p. 034050, 2023

    2023

  35. [43]

    Quantum error correction for quantum memories,

    B. M. Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics , vol. 87, no. 2, pp. 307–346, 2015

    2015

  36. [44]

    Qecool: On-line quantum error correction with a superconducting decoder for surface code,

    Y . Ueno, M. Kondo, M. Tanaka, Y . Suzuki, and Y . Tabuchi, “Qecool: On-line quantum error correction with a superconducting decoder for surface code,” in 2021 58th ACM/IEEE Design Automation Conference (DAC), 2021, pp. 451–456

    2021

  37. [45]

    Using cryogenic cmos control electronics to enable a two-qubit cross- resonance gate,

    D. Underwood, J. A. Glick, K. Inoue, D. J. Frank, J. Timmerwilke, E. Pritchett, S. Chakraborty, K. Tien, M. Yeck, J. F. Bulzacchelli et al. , “Using cryogenic cmos control electronics to enable a two-qubit cross- resonance gate,” PRX Quantum , vol. 5, no. 1, p. 010326, 2024

    2024

  38. [46]

    A scalable cryo-cmos controller for the wideband frequency- multiplexed control of spin qubits and transmons,

    J. P. G. Van Dijk, B. Patra, S. Subramanian, X. Xue, N. Samkharadze, A. Corna, C. Jeon, F. Sheikh, E. Juarez-Hernandez, B. P. Esparza et al. , “A scalable cryo-cmos controller for the wideband frequency- multiplexed control of spin qubits and transmons,” IEEE Journal of Solid-...

    2020

  39. [47]

    Astrea: Accurate quantum error- decoding via practical minimum-weight perfect-matching,

    S. Vittal, P. Das, and M. Qureshi, “Astrea: Accurate quantum error- decoding via practical minimum-weight perfect-matching,” in Proceed- ings of the 50th Annual International Symposium on Computer Archi- tecture, 2023, pp. 1–16

    2023

  40. [48]

    Fusion blossom: Fast mwpm decoders for qec,

    Y . Wu and L. Zhong, “Fusion blossom: Fast mwpm decoders for qec,” in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) , vol. 1. IEEE, 2023, pp. 928–938

    2023

  41. [49]

    A frequency and bandwidth reconfigurable 3–6 ghz cryogenic sige bicmos lna with a power consumption of 2.9 mw,

    Z. Zou, M. Hosseini, R. Kwende, S. Raman, and J. C. Bardin, “A frequency and bandwidth reconfigurable 3–6 ghz cryogenic sige bicmos lna with a power consumption of 2.9 mw,” in 2021 IEEE MTT-S International Microwave Symposium (IMS) . IEEE, 2021, pp. 653–656

    2021

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.