Pith. sign in

REVIEW 4 major objections 3 minor 50 references

The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures

T0 review · 4 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read Strongly dephasing-biased noise and two-qubit register grids cut magic-state cultivation and distillation volumes by 3x, reaching $|T\rangle$ fidelities near $10^{-9}$.

desk verdict Serious QEC paper with a genuinely new cultivation protocol and credible threshold simulations, but the headline 3x gains rest on a remote-CZ noise channel the authors admit is ungrounded; treat the numbers as conditional. read the letter →

arxiv 2608.09018 v1 pith:P3TW7CYY submitted 2026-08-10 quant-ph

Ian D. Thorvaldson , Jeffrey Marshall , Jack R. Craig , Samuel K. Gorman , Charles D. Hill , Michelle Y. Simmons This is my paper · ORCID
classification quant-ph MSC 81P6881P70 PACS 03.67.Lx03.67.Pp
keywords magicstatecultivationbiasednoisecolourcodesbilayersurfacefoldedregisterarchitectureshookerrorsdistillation
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

This paper sets out to prove that two features of certain quantum hardware — multi-qubit registers (several data qubits sharing one ancilla) and noise that is almost purely dephasing rather than bit-flip — can be exploited to make fault-tolerant quantum computation cheaper. It shows that a square grid of one- and two-qubit registers hosts the 6.6.6 and 4.8.8 colour codes (topological codes whose stabiliser faces carry both X and Z checks) at thresholds near 0.55% and a bilayer surface code near 0.7%, on par with the best previously reported results, because fully Z-biased noise makes stabiliser measurement immune to hook errors at first order while time-domain walls equalise X and Z protection. The new 'Magic Scroll' procedure combines these two code families: it cultivates a $|T\rangle$ magic state — the non-Clifford resource state that a fault-tolerant machine consumes to run gates beyond classical simulation — in a 4.8.8 colour code with full postselection, merges it with a partially folded surface code, and measures the colour section out, leaving the magic state in an ordinary matchable surface code. The paper reports that this cuts cultivation volume by up to 3x for a given state error, reaches $|T\rangle$ fidelities as low as $10^{-9}$, and, when the Scrolls feed distillation, cuts distillation volume by another 3x at $\sim 10^{-15}$ error rates. If these numbers hold, magic state production — historically the dominant cost of running a fault-tolerant quantum algorithm — becomes roughly three times cheaper on register-based biased-noise hardware.

What carries the argument

The load-bearing machinery is the time-domain-wall stabilisation cycle running under the biased noise model. In each single-cycle the Z stabilisers are measured through a chain of CZ gates, and in the penultimate tick a Hadamard is applied to every data qubit, so the next single-cycle measures the X stabilisers with the same circuit; over a double-cycle both are measured, and any error occurring in the CZ chain is a Z error that commutes with the gates and cannot create a hook error — the analogue, in time, of the spatial domain walls of the XZZX code. The second ingredient is the register grid: alternating one-qubit ancilla registers and two-qubit data registers give every register the same weight-four connectivity, so the 6.6.6 and 4.8.8 colour codes and the two-layer bilayer surface code (a cubic lattice capped at height two) all fit on a square grid, and most Bell-pair growth circuits act locally within one register. The third ingredient is the escape: the cultivated colour code is merged with a partially folded bilayer surface code while every colour-code and joint stabiliser is still fully postselected, the colour section is then measured out in the X basis, and the complementary gap — the difference in decoder weight between the solutions with and without a logical error — decides whether the resulting magic state is kept. Each piece does a specific job: biased noise kills hook errors, registers supply connectivity with few qubits, colour codes supply the transversal Clifford machinery for cultivation checks, and the folded surface code restores matchable decoding.

What would settle it

Measure the actual error channel of an electron-mediated remote CZ gate on a 14|15-style silicon register device, for example by randomised benchmarking or gate-set tomography on the full two-qubit channel, and compare the $ZI$, $IZ$ and $ZZ$ weights and the X/Y leakage to the 1:1:1 no-bit-flip channel assumed in Table 1. If the combined X/Y probability of a remote CZ or of one full idling cycle is more than a few percent of the total error budget, the first-order hook-error suppression that produces the $\sim 0.55\%$ and $\sim 0.7\%$ thresholds and the 3x Magic Scroll volume gains would be expected to break down; re-running the Fig. 1 simulations with even a 5–10% depolarising admixture on the CZ or idling channels would settle the question directly. A secondary check is to complete the full distance-7 cultivation simulations, which the paper currently extrapolates, to confirm that the reported $10^{-9}$ fidelity points are anchored rather than extrapolated.

Watch

Extended reading notes

Core claim

The discovery, on the paper's own terms, is that a maximally dephasing-biased error model changes the arithmetic of fault tolerance for colour codes. In the model, idling qubits and CZ gates suffer only products of Pauli-Z errors, measurement and reset suffer X errors, and single-qubit gates are depolarising; because Z errors commute with the CZ gates used in stabiliser measurement, an error in the middle of a stabiliser circuit can no longer spread from the ancilla to two data qubits, and the colour code's historic weakness to hook errors vanishes at first order. To stop the bias from leaving logical X much weaker than logical Z, the paper adds time-domain walls — one transversal Hadamard per data qubit per single-cycle — which exactly equalises X and Z protection, and this is what lifts the 6.6.6 and 4.8.8 colour codes to crossing thresholds of $\sim 0.55\%$ and the bilayer surface code (two surface-code layers stacked in the same register patch) to $\sim 0.7\%$, matching single-layer surface code performance. On top of these codes the Magic Scroll cultivates a $|T\rangle$ state in a 4.8.8 colour code (grow, stabilise, double-check, all fully postselected), grows the code into a partially folded surface code, and measures the colour region out in the X basis so the final magic state sits in a plain folded surface code whose errors are matchable; acceptance is decided by complementary-gap postselection. The paper reports cultivation volumes up to 3x lower for a fixed state error, $|T\rangle$ fidelities down to $\sim 10^{-9}$, and — using the Scrolls as inputs to 15-to-1 and 8-to-CCZ distillation with asymmetric gapped bilayer patches — distillation volumes reduced by about 3x at $\sim 10^{-15}$ error rates.

Load-bearing premise

The whole performance gain rests on the assumption that the noise on idling qubits and during CZ gates is almost perfectly dephasing-biased (Z errors only), and in particular that the remote, inter-register CZ gate has an error channel with equally weighted $ZI$, $IZ$ and $ZZ$ terms and no X or Y components — an assumption the paper's Appendix B itself describes as not founded on any particular physical reasoning and chosen as a worst case, so if real registers show appreciable bit-flip weight during gates or idling, hook errors return and the claimed thresholds and 3x volume gains can deteriorate substantially.

Editorial extensions

If this is right

  • Producing magic $|T\rangle$ states at error rates around $10^{-5}$ to $10^{-8}$ costs up to 3x less expected volume than the leading cultivation protocol of Ref. [12], and near $10^4$ qubit-rounds the achievable state error improves by up to two orders of magnitude.
  • Colour codes on square register grids without flag qubits match the best decoder-assisted thresholds ($\sim 0.55\%$), so colour-code magic state factories do not require non-planar connectivity or extra flag-qubit overhead.
  • Bilayer surface codes keep a threshold near $\sim 0.7\%$ while giving each logical qubit nine lattice-surgery neighbours and transversal $H$, $S$ and CNOT gates, which the paper uses to replace the auto-$T$ correction of conventional distillation with a transversal $S$ gate.
  • Halving the physical gate error from 0.1% to 0.05% improves Magic Scroll volumes by almost 20x and magic state errors by almost 100x, so the Scroll's advantage compounds as hardware improves.
  • Using Scrolls as distillation inputs with complementary gapping reaches $\sim 10^{-15}$ magic state errors, suitable for algorithms requiring more than $10^9$ $T$ gates, at volumes about 3x below distillation-only baselines.

Reading between the lines

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

  • The time-domain-wall construction suppresses hook errors by making mid-circuit noise commute with the entangling gates; the same trick should transfer to other stabiliser codes (XZZX-type codes, LDPC codes, qudit grids) whose stabiliser circuits can be arranged so that the dominant error channel commutes through the entangling layer, potentially raising their thresholds under biased noise as well.
  • The paper's remote-CZ channel is explicitly a place-holder worst case; its own alternative decomposition ($ZI(4p/9)$, $IZ(4p/9)$, $ZZ(p/9)$) suggests real inter-register gates may carry fewer correlated $ZZ$ errors, in which case the reported 3x gains would be conservative rather than optimistic once experimental characterisation arrives.
  • The cultivation settings (more double-checks, fewer stabiliser rounds) were chosen by trial and error; an analytical or systematically searched rule for the grow-stabilise-double-check sequence under biased noise would likely find further volume reductions beyond the reported 3x.
  • The complementary-gap mechanism delivered a large share of the distillation improvement and, as the paper notes, is not tied to biased noise or registers, so the same gapping model should transfer to single-layer surface-code architectures — with the caveat that the empirical $\epsilon \sim p^2/P(r)$ heuristic has only been validated at distances $\gtrsim 7$ and should be re-benchmarked there rath
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 3 minor

Summary. The paper proposes a register-based architecture of one- and two-qubit qubit registers with biased dephasing noise, motivated by the 14|15 silicon platform, and shows how to implement 6.6.6 and 4.8.8 colour codes and bilayer/folded surface codes on this architecture. It reports simulated crossing thresholds of about 0.55% for the colour codes and 0.7% for the bilayer code. The central contribution is the 'Magic Scroll', a cultivation and escape protocol that produces |T> magic states with lower expected volume than previous work by up to about 3x, and a distillation procedure claimed to improve distillation volumes by about 3x. The technical core is simulation with Stim and decoding with pymatching/Chromobius, plus an extrapolated model for large-distance distillation.

Significance. If the results hold, the paper demonstrates a practical route to leveraging noise bias and high connectivity to reduce magic state production costs, which is directly relevant to fault-tolerant quantum computing on spin-register platforms. The threshold simulations are internally consistent, use public decoders, and are a useful contribution in their own right. However, the headline volume improvements rest on three assumptions that are either explicitly admitted as ungrounded or only partially validated: the remote CZ error channel, the |Y>-state proxy for |T> cultivation, and the extrapolation of the complementary-gapping model to large code distances. These assumptions are load-bearing for the central claims, so the paper currently requires revision rather than acceptance.

major comments (4)
  1. [Section 2.2 and Appendix B] The remote CZ error channel in Table 1, with equally weighted ZI, IZ and ZZ errors, is load-bearing for the claimed suppression of hook errors in Section 3 and for the Magic Scroll gains. Appendix B states this channel is 'not founded on any particular physical reasoning' and is chosen as 'likely the worst case', but the worst case is only among Z-only channels and does not bound X or Y error components. An X or Y error during a CZ chain propagates to weight-2 or weight-3 data errors, reintroducing the hook errors the biased design is meant to eliminate. I ask for a sensitivity analysis that adds a small X/Y admixture (e.g., a few percent of the total error) to the remote CZ channel and shows the resulting thresholds and volume gains, or for a physical argument that such components cannot arise in the 14|15 electron-mediated remote CZ operation.
  2. [Section 5.3 and Appendix A] The d=7 cultivation results shown in Fig. 1 support the abstract's claim of |T> state fidelities as low as 10^-9, but the paper states these results are 'partially extrapolated' and 'could feasibly be off by a factor of 2'. The extrapolation is a power-law fit based on tractable data, and it is used to draw the dashed curves in Fig. 1. Since the abstract states this as a headline result, the extrapolated nature must be more than a parenthetical remark. I ask for a clear statement in the abstract and main text that the sub-10^-9 points are extrapolated estimates, a bound on the sensitivity of the reported volume improvement to the fit, or additional simulation data for d=7 at intermediate error rates.
  3. [Section 5.3] The cultivation simulations use a |Y> state as a proxy for |T> and assume the |T> error can be estimated by doubling the |Y> error. This assumption is inherited from Gidney et al., but the Magic Scroll adds distinct postselection and escape steps, so the validity of the doubling is not obvious. The paper does not provide evidence that the proxy holds for the final escaped state, which is the quantity used for the volume comparison in Fig. 1. I ask for a direct simulation of |T> for at least one non-extrapolated setting (e.g., d=5) or a systematic comparison of |Y> and |T> errors in the relevant circuit.
  4. [Section 6 and Appendix L] The claimed 3x improvement in distillation volumes relies on the complementary-gapping model epsilon ~ p^2/P(r), calibrated on bilayer code simulations at distances up to about 9 and then extrapolated to the much larger distances used in Table 2 (e.g., output patches of width 15-19). The text acknowledges this is 'an approximate fit' and that 'the exact performance will depend on details of the actual implementation'. Because the volume numbers in Table 2 are computed from this model, the extrapolation is load-bearing. I ask for simulation data at intermediate distances (e.g., d=11, d=13) to validate the scaling, or a sensitivity analysis showing how the reported volumes change under reasonable variation of the model parameters.
minor comments (3)
  1. [Fig. 1 caption] The caption lists multiple simulation settings and arrows but does not define the meaning of the different marker shapes and colours; a short legend or pointer to the optimization details would improve readability.
  2. [Table 2] The column for complementary gap parameters lists values like '500; 50' and '20,000; 3' without a space after the semicolon, which is consistent but easy to misread; please add a space or use a slash for clarity.
  3. [Appendix B, Eq. (3)] The matrix for the parity-Z gate is displayed with several ellipses and diagonal entries that are not aligned with the row/column labels; a simpler notation such as diag(1,1,1,1,1,e^{i δ}, e^{i δ}, 1) would be clearer.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: code thresholds and cultivation curves come from direct Stim simulations, and the extrapolated distillation/gapping heuristics are explicitly labeled approximate.

full rationale

The paper's central claims are not circular in the sense of a prediction being equivalent to its inputs by construction. The colour-code thresholds (~0.55%) and bilayer surface-code threshold (~0.7%) are obtained from explicit circuit-level Stim simulations with Chromobius and pymatching, and the Magic Scroll cultivation curves in Fig. 1 are likewise direct simulation results, with only the d=7 points extrapolated in Appendix A from the authors' own tractable data. The distillation analysis is the closest thing to a self-consistency loop: Table 2 volumes are computed using the complementary-gapping heuristic of Appendix L, which the paper explicitly describes as an empirical model "based on lower distances for which simulation is tractable, and extrapolate this model when dealing with larger distances," and it is stated to be a pessimistic approximation. That is an acknowledged extrapolation and a model-validity caveat, not a definitional reduction: the distillation error rates are not used to fit the gap model, and the comparison to Litinski is against an external baseline. Similarly, Appendix B's admission that the remote-CZ equally-weighted channel is "not founded on any particular physical reasoning" is a correctness/robustness weakness of the noise model, but it is not circularity. Self-citations to Refs. [7,8] provide experimental platform parameters; they are not invoked as an unverified load-bearing theorem, and the local-CZ error model is separately derived from dephasing in Appendix B. No equation in the paper reduces to its own input by construction, and the claimed 3x volume improvements are presented as simulation/model comparisons to external published results rather than as fits to those results.

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

The paper's central claims depend on a small set of hand-chosen protocol parameters and on an assumed physical noise model. The most important free parameters are the cultivation schedule and the complementary gapping strengths; the reported 3x figures are outcomes of those choices. The axioms include standard QEC/decoding assumptions plus several domain-specific assumptions about biased noise, the remote CZ error channel, the |Y>-to-|T> error mapping, and the gapping heuristic. No new physical entities are introduced.

free parameters (3)
  • Cultivation schedule parameters (colour-code distance d, surface width w, escape height h', final height h, joint… = e.g. d=5: g-s-dc-g-s-dc -> 13x(7)11 r=3
    Authors report these were found empirically by trial-and-error, and they directly set the reported volume/error tradeoff in Fig. 1.
  • Complementary gap threshold t for Magic Scroll = e.g. 7.0, 12.0, 13.0, 16.0
    Chosen empirically to move along the volume/error curve; the highest-error point has no gap threshold.
  • Distillation gapping factors f_o and f_a = e.g. 20,000; 3 up to 100,000; 20
    Hand-selected to keep the retry probability near 10 to 20 percent; they control the error and volume columns in Table 2.
assumptions (7)
  • standard math Pauli twirling approximation converts coherent dephasing error channels into Pauli error channels.
    Used in Appendix B to turn dephasing processes into the discrete Pauli channel in Table 1.
  • domain assumption Idling and CZ noise is perfectly dephasing-biased: only Z-type errors occur on data qubits during idling and CZ operations.
    Table 1 and Sec. 2.2; motivated by 14|15 spin lifetimes but assumed exact for all simulations.
  • ad hoc to paper Remote CZ gate error channel is equally weighted ZI, IZ, ZZ because the electron-electron CZ is the dominant error source.
    Appendix B states this assumption is 'not founded on any particular physical reasoning' and is a worst-case choice.
  • domain assumption The |Y> magic state error, doubled, estimates the |T> magic state error.
    Sec. 5.3, inherited from Gidney et al.; used for cultivation performance estimates.
  • ad hoc to paper Complementary gapping performance follows epsilon ~ p^2 / P(r) and extrapolates pessimistically to large code distances.
    Appendix L fits this heuristic to bilayer simulations and uses it to compute distillation volumes in Table 2.
  • domain assumption Decoder results for the complementary gap arrive within one double-cycle, estimated at about 10 microseconds.
    Sec. 5.2 footnote; affects resource counts for the Magic Scroll escape.
  • domain assumption Time-domain walls equalise logical X and Z protection under biased noise.
    Sec. 3 and Appendices C and D; supported only by the authors' own simulations.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures." pith.science (2026). https://pith.science/paper/P3TW7CYY

@misc{pith2026260809018,
  author       = {Pith},
  title        = {Pith review of: The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/P3TW7CYY}},
  note         = {Machine review of arXiv:2608.09018}
}
abstract

Multiple quantum computing platforms across neutral atoms [1], nitrogen vacancy centres [2, 3], gate-defined dots [4-6] and 14|15 phosphorus atom qubits [7, 8] in silicon are experimentally exploring the use of high connectivity qubits, beyond that of nearest-neighbour planar lattices. Theoretical works consider modifications to fault-tolerant codes to leverage this higher qubit connectivity, such as non-local LDPC codes [9], inspiring superconducting [10] and photonic [11] platforms to also seek non-planar connectivity. In addition, separate theoretical works consider biased noise, where bit- and phase-flip errors are not equally likely. In this work, we present efficient methods for implementing 6.6.6 and 4.8.8 colour codes, as well as bilayer and folded surface codes, using two-qubit registers. We also leverage noise bias to avoid hook errors, demonstrating comparable performance to the surface code. By combining colour and bilayer codes, we show how magic state cultivation procedures [12-14] can be improved, in a procedure we refer to as the Magic Scroll. Not only does the Magic Scroll escape to a standard surface code, it also improves cultivation volumes by 3x and supports magic $|T\rangle$ state fidelities as low as $10^{-9}$. We show that this technique can be further leveraged to improve distillation performance, showing a 3x improvement to distillation volumes for error rates of $\sim 10^{-15}$. Through these constructions, we demonstrate techniques to leverage noise bias and high qubit connectivity, showing how register-based architectures can improve error rates and reduce quantum volumes in fault-tolerant quantum computing.

Figures

Figures reproduced from arXiv: 2608.09018 by the authors.

Figure 1
Figure 1. Comparison of simulated magic |T⟩ state production using the Magic Scroll and Magic Scroll distillation. Here, we plot the magic state error as a function of expected volume of the Magic Scroll cultivation and distillation techniques explored in this work, over different cultivation sequences, final code distances and escape repetitions. For cultivation, each set of same-coloured, same-shape points represents a seri… view at source ↗
Figure 3
Figure 3. Overview of inter-register gates available in a two-qubit register architecture. Based off the capabilities of multi-nuclear spin registers in silicon, we show some exam￾ples of operations that are possible between two-qubit reg￾isters. For all examples shown here, it is possible to choose anti-controls wherever a control is present, or to freely change which qubit(s) are being operated on, without incurring any ext… view at source ↗
Figure 4
Figure 4. Implementation and performance of 6.6.6 and 4.8.8 colour codes using one- and two-qubit registers under biased noise. (a) Layout of alternating two-qubit and one-qubit registers with square connectivity capable of implementing a 6.6.6 colour code. The register outlines have been omitted for the single-qubit registers. Open circles represent 6.6.6 code ancilla qubits, while filled circuits represent 6.6.6 code data q… view at source ↗
Figures from the paper (6 more)
Figure 5
Figure 5. Figure 5: Implementation and performance of bilayer surface codes using 1- and 2-qubit registers under biased noise. (a) Layout of alternating grid of 2-qubit and 1-qubit registers used for implementing a bilayer surface code, as in Fig. 4a and d. Register outlines have been omi…
Figure 6
Figure 6. Figure 6: Method used to grow a 4.8.8 colour code from distance-3 to distance-7 using Bell pairs. (a) Initial stabilisers of the distance-3 colour code. (b) Bell pairs are created between pairs of data qubits (marked in grey), which in the absence of errors creates deterministic…
Figure 7
Figure 7. Figure 7: Detector-slice diagram of method used to double-check a magic state encoded in a distance-3 colour code. In tick 2, two ancillas are initialised, which will serve as flag qubits at the end of the double-check. In tick 3, single-qubit gates are applied such that the ori…
Figure 8
Figure 8. Figure 8: Detector-slice diagram of method used to double-check a magic state encoded in a distance-5 colour code. The procedure is implemented in a similar way to [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]
Figure 9
Figure 9. Figure 9: Summary of steps used to transfer the cultivated magic state from the colour code to a folded surface code. Here, we escape the magic state held in the 4.8.8 colour code (cultivated as per Figs. 6-8) into a partially folded surface code, constructed utilising the bilay…
Figure 10
Figure 10. Figure 10: Layout of logical qubits when performing 15- to-1 distillation and 8-to-CCZ synthillation protocols. a) Layout of Magic Scrolls (red representing colour code and green representing the folded surface the Scroll escapes to), output surface code patch (blue), and ancill…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

50 extracted references · 13 canonical work pages

  1. [1]

    Evered, Alexan- dra A

    Dolev Bluvstein, Simon J. Evered, Alexan- dra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, MarcinKalinowski, DominikHangleiter, J.Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gul- lans, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin...

    work page doi:10.1038/s41586-023-0692 2024

  2. [2]

    Waldherr, Y

    G. Waldherr, Y. Wang, S. Zaiser, M. Jamali, T. Schulte-Herbrüggen, H. Abe, T. Ohshima, J. Isoya, J. F. Du, P. Neumann, and J. Wrachtrup. Quantum error correction in a solid-state hybrid spin register.Nature, 506 (7487):204–207, Feb 2014. ISSN 1476-4687. DOI: 10.1038/nature12919. URLhttps://doi.org/ 10.1038/nature12919

    doi:10.1038/nature12919 2014

  3. [4]

    Ha, Edwin Acuna, Kate Raach, Zach- ery T

    Sieu D. Ha, Edwin Acuna, Kate Raach, Zach- ery T. Bloom, Teresa L. Brecht, James M. Chap- pell, Maxwell D. Choi, Justin E. Christensen, Ian T. Counts, Dominic Daprano, J.P. Dod- son, Kevin Eng, David J. Fialkow, Christina A. C. Garcia, Wonill Ha, Thomas R. B. Har- ris, nathan holman, Isaac Khalaf, Justine W. Matten, Christi A. Peterson, Clifford E. Ple- s...

    work page 2025

  4. [5]

    Vertically Coupled Double Quantum Dots Connected In Parallel

    Shinichi Amaha, Tsuyoshi Hatano, Takashi Nakajima, and Seigo Tarucha. Vertically coupled double quantum dots connected in parallel, 2025. URLhttps://arxiv.org/abs/2507.09598

    work page Pith review arXiv 2025

  5. [6]

    Oosterhout, Lucas Stehouwer, Gior- dano Scappucci, and Menno Veldhorst

    Hanifa Tidjani, Dario Denora, Michael Chan, Jann Hinnerk Ungerer, Barnaby van Straaten, Stefan D. Oosterhout, Lucas Stehouwer, Gior- dano Scappucci, and Menno Veldhorst. A three- dimensional array of quantum dots, 2025. URL https://arxiv.org/abs/2512.01634

    arXiv 2025

  6. [7]

    Thorvaldson, D

    I. Thorvaldson, D. Poulos, C. M. Moehle, S. H. Misha, H. Edlbauer, J. Reiner, H. Geng, B. Voisin, M. T. Jones, M. B. Donnelly, L. F. Peña, C. D. Hill, C. R. Myers, J. G. Keizer, Y. Chung, S. K. Gorman, L. Kranz, and M. Y. Simmons. Grover’s algorithm in a four-qubit sil- icon processor above the fault-tolerant thresh- old.Nature Nanotechnology, 20(4):472–477, Apr

    work page

  7. [8]

    Hermann Edlbauer, Junliang Wang, A. M. Saffat-Ee Huq, Ian Thorvaldson, Michael T. Jones, Saiful Haque Misha, William J. Pap- pas, Christian M. Moehle, Yu-Ling Hsueh, Hen- ric Bornemann, Samuel K. Gorman, Yousun Chung, Joris G. Keizer, Ludwik Kranz, and 18 Michelle Y. Simmons. An 11-qubit atom pro- cessor in silicon.Nature, 648(8094):569–575, Dec

    work page

  8. [9]

    Cross, Jay M

    Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder. High-threshold and low-overhead fault-tolerant quan- tum memory.Nature, 627(8005):778– 782, Mar 2024. ISSN 1476-4687. DOI: 10.1038/s41586-024-07107-7. URLhttps: //doi.org/10.1038/s41586-024-07107-7

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

Show all 50 references
  1. [10]

    DOI: 10.1038/s41586- 025-09827-w

    ISSN 1476-4687. DOI: 10.1038/s41586- 025-09827-w. URLhttps://doi.org/10.1038/ s41586-025-09827-w

    doi

  2. [11]

    Active vol- ume: An architecture for efficient fault-tolerant quantum computers with limited non-local con- nections, 2022

    Daniel Litinski and Naomi Nickerson. Active vol- ume: An architecture for efficient fault-tolerant quantum computers with limited non-local con- nections, 2022. URLhttps://arxiv.org/abs/ 2211.15465

    2022 arXiv

  3. [12]

    Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M

    Theodore J. Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M. Gambetta, Andrew W. Cross, Malcolm Carroll, and Michael E. Bev- erland. Tour de gross: A modular quantum computer based on bivariate bicycle codes, 2025. URLhttps://arxiv.org/abs/2506.03094

    2025 arXiv

  4. [13]

    Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits.npj Quantum Information, 6(1):91, Oct 2020

    Christopher Chamberland and Kyungjoo Noh. Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits.npj Quantum Information, 6(1):91, Oct 2020. ISSN 2056-6387. DOI: 10.1038/s41534-020-00319-5. URLhttps:// doi.org/10.1038/s41534-0...

    2020 doi

  5. [14]

    Magic state cultivation: growing T states as cheap as CNOT gates, 2024

    Craig Gidney, Noah Shutty, and Cody Jones. Magic state cultivation: growing T states as cheap as CNOT gates, 2024. URLhttps:// arxiv.org/abs/2409.17595

    2024 arXiv

  6. [15]

    Valentini, M

    M. Valentini, M. W. van Mourik, F. Butt, J. Wahl, M. Dietl, M. Pfeifer, F. Anmasser, Y. Colombe, C. Rössler, P. C. Holz, R. Blatt, A. Bermudez, M. Müller, T. Monz, and P. Schindler. Demonstration of two-dimensional connectivity for a scalable error-corrected ion- trap quantum ...

    2025 doi

  7. [18]

    Scalable fault-tolerant quantum technologies with silicon colour cen- tres, 2023

    Stephanie Simmons. Scalable fault-tolerant quantum technologies with silicon colour cen- tres, 2023. URLhttps://arxiv.org/abs/ 2311.04858

    2023 arXiv

  8. [20]

    Fusion-based quantum computation.Na- ture Communications, 14(1):912, Feb 2023

    Sara Bartolucci, Patrick Birchall, Hector Bom- bín, Hugo Cable, Chris Dawson, Mercedes Gimeno-Segovia, Eric Johnston, Konrad Kiel- ing, Naomi Nickerson, Mihir Pant, Fernando Pastawski, Terry Rudolph, and Chris Spar- row. Fusion-based quantum computation.Na- ture Communications...

    2023 doi

  9. [22]

    Magic state distillation: Not as costly as you think.Quantum, 3:205, Decem- ber 2019

    Daniel Litinski. Magic state distillation: Not as costly as you think.Quantum, 3:205, Decem- ber 2019. ISSN 2521-327X. DOI: 10.22331/q- 2019-12-02-205. URLhttp://dx.doi.org/10. 22331/q-2019-12-02-205

    2019 doi

  10. [23]

    Watson, Bent Weber, Yu-Ling Hsueh, Lloyd C

    Thomas F. Watson, Bent Weber, Yu-Ling Hsueh, Lloyd C. L. Hollenberg, Rajib Rah- man, and Michelle Y. Simmons. Atom- ically engineered electron spin lifetimes of 30 s in silicon.Science Advances, 3(3): e1602811, 2017. DOI: 10.1126/sciadv.1602811. URLhttps://www.science.org/doi/...

    2017 doi

  11. [24]

    Zache, Liang Jiang, Rick van Bi- jnen, and Peter Zoller

    Andreas Kruckenhauser, Ming Yuan, Han Zheng, Mikhail Mamaev, Pei Zeng, Xuanhui Mao, Qian Xu, Torsten V. Zache, Liang Jiang, Rick van Bi- jnen, and Peter Zoller. Dark spin-cats as bi- ased qubits, 2025. URLhttps://arxiv.org/ abs/2408.04421

    2025 arXiv

  12. [26]

    Pablo Bonilla Ataides, David K

    J. Pablo Bonilla Ataides, David K. Tuck- ett, Stephen D. Bartlett, Steven T. Flammia, and Benjamin J. Brown. The XZZX surface code.Nature Communications, 12(1):2172, Apr

  13. [27]

    Brown, and Shruti Puri

    Kaavya Sahay, Yingjia Lin, Shilin Huang, Ken- neth R. Brown, and Shruti Puri. Error cor- rection of transversal CNOT gates for scalable surface-code computation.PRX Quantum, 6: 020326, May 2025. DOI: 10.1103/PRXQuan- tum.6.020326. URLhttps://link.aps.org/ doi/10.1103/PRXQuantu...

    2025 doi

  14. [28]

    Cultivating t states on the sur- face code with only two-qubit gates, 2025

    Jahan Claes. Cultivating t states on the sur- face code with only two-qubit gates, 2025. URL https://arxiv.org/abs/2509.05232

    2025

  15. [29]

    New circuits and an open source decoder for the color code, 2023

    Craig Gidney and Cody Jones. New circuits and an open source decoder for the color code, 2023. URLhttps://arxiv.org/abs/2312.08813

    2023 arXiv

  16. [30]

    Efficient magic state culti- vation with lattice surgery, 2025

    Yutaka Hirano, Riki Toshio, Tomohiro Itogawa, and Keisuke Fujii. Efficient magic state culti- vation with lattice surgery, 2025. URLhttps: //arxiv.org/abs/2510.24615

    2025

  17. [31]

    Yoked surface codes.Na- ture Communications, 16(1):4498, May 2025

    Craig Gidney, Michael Newman, Peter Brooks, and Cody Jones. Yoked surface codes.Na- ture Communications, 16(1):4498, May 2025. ISSN 2041-1723. DOI: 10.1038/s41467-025- 59714-1. URLhttps://doi.org/10.1038/ s41467-025-59714-1

    2025 doi

  18. [32]

    Efficient magic state culti- vation on the surface code, 2025

    Yotam Vaknin, Shoham Jacoby, Arne Grimsmo, and Alex Retzker. Efficient magic state culti- vation on the surface code, 2025. URLhttps: //arxiv.org/abs/2502.01743

    2025

  19. [33]

    Unfoldeddistillation: very low-cost magic state preparation for biased- noise qubits, 2025

    Diego Ruiz, Jérémie Guillaud, Christophe Vuil- lot, andMazyarMirrahimi. Unfoldeddistillation: very low-cost magic state preparation for biased- noise qubits, 2025. URLhttps://arxiv.org/ abs/2507.12511

    2025 arXiv

  20. [34]

    Fowler, Matteo Mariantoni, John M

    Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards practical large-scale quantum compu- tation.Physical Review A, 86(3), September

  21. [35]

    Muhonen, Juan P

    Juha T. Muhonen, Juan P. Dehollain, Arne Laucht, Fay E. Hudson, Rachpon Kalra, Take- haru Sekiguchi, Kohei M. Itoh, David N. Jamieson, Jeffrey C. McCallum, Andrew S. Dzurak, and Andrea Morello. Storing quan- tum information for 30 seconds in a nanoelec- tronic device.Nature Na...

    2014 doi

  22. [36]

    Pymatching: A python pack- age for decoding quantum codes with minimum- weight perfect matching, 2021

    Oscar Higgott. Pymatching: A python pack- age for decoding quantum codes with minimum- weight perfect matching, 2021. URLhttps: //arxiv.org/abs/2105.13082

    2021 arXiv

  23. [37]

    Bohdanowicz, Alek- sander Kubica, Steven T

    Oscar Higgott, Thomas C. Bohdanowicz, Alek- sander Kubica, Steven T. Flammia, and Earl T. Campbell. Improved decoding of circuit noise and fragile boundaries of tai- lored surface codes.Phys. Rev. X, 13: 031007, Jul 2023. DOI: 10.1103/Phys- RevX.13.031007. URLhttps://link.aps....

    2023 doi

  24. [38]

    Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I

    Rajeev Acharya, Dmitry A. Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I. An- dersen, Markus Ansmann, Frank Arute, Ku- nal Arya, Abraham Asfaw, Nikita Astrakhant- sev, Juan Atalaya, Ryan Babbush, Dave Ba- con, Brian Ballard, Joseph C. Bardin, Jo- hannes Bausch, Andreas B...

  25. [39]

    Surface code quantum computing by lattice surgery.New Journal of Physics, 14(12):123011, December

    Dominic Horsman, Austin G Fowler, Simon De- vitt, and Rodney Van Meter. Surface code quantum computing by lattice surgery.New Journal of Physics, 14(12):123011, December

  26. [41]

    Colour codes reach surface code performance us- ing vibe decoding, 2025

    Stergios Koutsioumpas, Tamas Noszko, Hasan Sayginel, Mark Webster, and Joschka Roffe. Colour codes reach surface code performance us- ing vibe decoding, 2025. URLhttps://arxiv. org/abs/2508.15743

    2025 arXiv

  27. [42]

    D. S. Wang, A. G. Fowler, C. D. Hill, and L. C. L. Hollenberg. Graphical algorithms and threshold error rates for the 2d colour code, 2009. URL https://arxiv.org/abs/0907.1708

    2009 arXiv

  28. [43]

    A game of surface codes: Large- scale quantum computing with lattice surgery

    Daniel Litinski. A game of surface codes: Large- scale quantum computing with lattice surgery. Quantum, 3:128, March 2019. ISSN 2521-327X. DOI: 10.22331/q-2019-03-05-128. URLhttp: //dx.doi.org/10.22331/q-2019-03-05-128

    2019 doi

  29. [44]

    Landahl, Jonas T

    Andrew J. Landahl, Jonas T. Anderson, and Patrick R. Rice. Fault-tolerant quantum com- puting with color codes, 2011. URLhttps: //arxiv.org/abs/1108.5738

    2011 arXiv

  30. [45]

    Facilitating practical fault- tolerant quantum computing based on color codes.Phys

    Jiaxuan Zhang, Yu-Chun Wu, and Guo- Ping Guo. Facilitating practical fault- tolerant quantum computing based on color codes.Phys. Rev. Res., 6:033086, Jul 2024. DOI: 10.1103/PhysRevResearch.6.033086. URLhttps://link.aps.org/doi/10.1103/ PhysRevResearch.6.033086

    2024 doi

  31. [46]

    Contextuality supplies the ‘magic’ for quantum computation.Nature, 510 (7505):351–355, June 2014

    Mark Howard, Joel Wallman, Victor Veitch, and Joseph Emerson. Contextuality supplies the ‘magic’ for quantum computation.Nature, 510 (7505):351–355, June 2014. ISSN 1476-4687. DOI: 10.1038/nature13460. URLhttp://dx. doi.org/10.1038/nature13460

    2014 doi

  32. [47]

    Restric- tions on transversal encoded quantum gate sets.Phys

    Bryan Eastin and Emanuel Knill. Restric- tions on transversal encoded quantum gate sets.Phys. Rev. Lett., 102:110502, Mar

  33. [48]

    Unfolding the color code.New Journal of Physics, 17(8):083026, aug 2015

    Aleksander Kubica, Beni Yoshida, and Fernando Pastawski. Unfolding the color code.New Journal of Physics, 17(8):083026, aug 2015. DOI: 10.1088/1367-2630/17/8/083026. URL https://dx.doi.org/10.1088/1367-2630/17/ 8/083026

    2015 doi

  34. [49]

    Im- proved simulation of stabilizer circuits.Phys- ical Review A, 70(5), November 2004

    Scott Aaronson and Daniel Gottesman. Im- proved simulation of stabilizer circuits.Phys- ical Review A, 70(5), November 2004. ISSN 1094-1622. DOI: 10.1103/physreva.70.052328. URLhttp://dx.doi.org/10.1103/PhysRevA. 70.052328

    2004 doi

  35. [50]

    Stim: a fast stabilizer cir- cuit simulator.Quantum, 5:497, July 2021

    Craig Gidney. Stim: a fast stabilizer cir- cuit simulator.Quantum, 5:497, July 2021. ISSN 2521-327X. DOI: 10.22331/q-2021-07- 06-497. URLhttp://dx.doi.org/10.22331/ q-2021-07-06-497

    2021 doi

  36. [51]

    Shaw, and Barbara M

    Marc Serra-Peralta, Mackenzie H. Shaw, and Barbara M. Terhal. Decoding across transver- sal clifford gates in the surface code, 2025. URL https://arxiv.org/abs/2505.13599

    2025 arXiv

  37. [52]

    Qubit movement

    Christophe Vuillot, Lingling Lao, Ben Criger, Carmen García Almudéver, Koen Bertels, and Barbara M Terhal. Code deformation and lattice surgery are gauge fixing.New Journal of Physics, 21(3):033028, mar 2019. DOI: 10.1088/1367- 2630/ab0199. URLhttps://dx.doi.org/10. 1088/1367-...

    2019 doi

  38. [55]

    Cory, and Raymond Laflamme

    Joseph Emerson, Marcus Silva, Osama Moussa, Colm Ryan, Martin Laforest, Jonathan Baugh, David G. Cory, and Raymond Laflamme. Sym- metrized characterization of noisy quantum pro- cesses.Science, 317(5846):1893–1896, Septem- ber 2007. ISSN 1095-9203. DOI: 10.1126/sci- 21 ence.11...

    2007 doi

  39. [56]

    A dynamical interpretation of the pauli twirling approximation and quantum error correction, 2017

    Amara Katabarwa. A dynamical interpretation of the pauli twirling approximation and quantum error correction, 2017. URLhttps://arxiv. org/abs/1701.03708

    2017 arXiv

  40. [2009]

    URLhttps://link.aps.org/doi/10.1103/ PhysRevLett.102.110502

    DOI: 10.1103/PhysRevLett.102.110502. URLhttps://link.aps.org/doi/10.1103/ PhysRevLett.102.110502

    doi

  41. [2021]

    DOI: 10.1038/s41467- 021-22274-1

    ISSN 2041-1723. DOI: 10.1038/s41467- 021-22274-1. URLhttps://doi.org/10.1038/ s41467-021-22274-1

    doi

  42. [2025]

    DOI: 10.1038/s41565- 024-01853-5

    ISSN 1748-3395. DOI: 10.1038/s41565- 024-01853-5. URLhttps://doi.org/10.1038/ s41565-024-01853-5

    doi

Pith tools

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