Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Why large-scale quantum computing faces hard physical limits: a source-loss balance tested against measured data

Oleg Arnold

Published Nov 13, 2026• 0 citations
Publisher

Abstract

This note applies a single first-order source-loss balance, C dθ/dt = A − ρθ, to systems across many scales — from a planetary surface to a qubit register — and reports, with exact numbers, where the balance reproduces measured values and where it does not. The central quantitative result concerns quantum error correction. Using published surface-code and trapped-ion data (Google Quantum AI, Nature 638, 920 (2024); Quantinuum Helios colour-code results, 2026), the note shows that the logical error per cycle falls by a constant factor Λ only while errors are independent. Correlated bursts act as a common loss channel whose rate does not fall with code distance; the quoted floor is about 3×10⁻¹⁰ per cycle, reached at distance about 46 for Λ = 2.17. For factoring a 2048-bit integer (about 1.4×10³ logical qubits, 6.5×10⁹ Toffoli gates, 4.96 days at a 1 μs cycle), the permitted logical error is 1.7×10⁻¹⁵ per qubit per cycle. At measured suppression factors this requires code distances of about 78 (Λ = 2.17) or about 24 (Λ = 12), while the published design uses 25 — and the correlated-error floor is not removed by increasing distance. This is a quantitative statement about where the scaling of error suppression stops matching the requirements of large computations, not a claim that small-scale quantum devices cannot work. The note also lists, separately and with exact values, the tests the balance fails: quark mass-step prediction (T6), gas/solid classification (T8, p = 0.81), nuclear count with A = 3, 4, prediction SP1 (−11.8% against a 10% threshold), coupling versus number of doors (T10, p = 0.015), width-to-cosmological-scale mapping (q₀ = −0.528 ± 0.011 against 0), human loss-rate estimates (11.1 and 15.3 W/K), critical Q₁₀ = 3.03 against measured 2.0–2.3, Higgs width from the b-quark exit alone (13.7% residual), shell boundaries (13 of 18), and several time constants. Of nine tests where the balance gives a value different from the standard one, one agreed with measurement and eight did not; the rules and thresholds were written before the data were examined. Successful checks include: photosynthesis stage efficiencies (0.487 × 0.094 = 0.0458 against 0.046 reported), a three-stage 2.45 GHz rectenna chain (0.906³ = 0.744), closure of the lunar surface energy budget to a ratio of 1.005, mode quality factors Q = m/Γ for the τ lepton (7.84×10¹¹), the Z boson (36.5) and the Higgs boson (3.38×10⁴), the Higgs lifetime from its width (290.87 fs against 290.3 ± 0.5 fs, a consistency check of standard formulas), and the proton-decay bound ρ < 1.3×10⁻⁴² s⁻¹. The complete theory, tests, scripts and the list of open items are maintained at https://zenodo.org/records/23812417. This note is a standalone publication; readers are invited to report measured values that disagree.

DOI
10.5281/zenodo.24201564

Related papers

Quantum error correction below the surface code threshold

Google Quantum AI and Collaborators, Rajeev Acharya, Dmitry A. Abanin +97 more

Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $$\varLambda \mathrm{=2.14}\pm 0.02$$ when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of $$2.4\pm 0.3$$ . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or $$3$$ $$\times $$ $${10}^{9}$$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.

arXiv:2408.13687•Nature•Dec 9, 2024•1,314 citations

Suppressing quantum errors by scaling a surface code logical qubit

Google Quantum AI, Rajeev Acharya, I. L. Aleǐner +97 more

Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

arXiv:2207.06431•Nature•Feb 22, 2023•1,354 citations

The Quantum Error Floor: Fundamental Limits on Gate Fidelity from K-Functional Sector Balance

J. Rosa

We derive a fundamental lower bound on the gate error rate of any quantum computing platform from the K-functional framework. Two irreducible error sources compete: K_rec record back-action (the environment acquires information about which gate was applied, corrupting the qubit) and K_ent thermal decoherence (the qubit thermalizes during the gate operation). The K_rec error decreases with weaker qubit-control coupling while the K_ent error increases, producing a U-shaped curve with a minimum at the optimal coupling g/w = (8pi/Q)^(1/3), where Q is the qubit quality factor. The minimum error rate is e_floor = 0.512 Q^(-2/3). At this minimum, K_rec contributes exactly one-third of the total error and K_ent contributes two-thirds, a ratio fixed by the cubic optimization and not adjustable by engineering. The floor scales as Q^(-2/3), not Q^(-1) as standard decoherence theory would suggest. This sub-linear scaling is a testable prediction: on a log-log plot of error rate versus quality factor across platforms, the K-functional predicts slope -2/3 rather than -1. The same one-loop factor 1/(16pi^2) that governs the chiral anomaly (Paper 12) and the cosmological constant (Paper 13) sets the K_rec back-action rate, connecting quantum computing errors to fundamental physics. The Bekenstein bound limits the maximum quality factor to Q_max = S_Bek = 2piER/(hbar c), giving an absolute error floor of 0.512 S_Bek^(-2/3). At the Planck scale (the monopole of Paper 3), S_Bek = 2pi, giving a 15% per-operation error rate, above the fault-tolerance threshold. The gauge algebra SU(3) x SU(2) x U(1) survives the cosmological bounce because 2pi bits is just sufficient to encode the algebra, and the bounce attractor (Paper 11, gain 0.23) provides cross-cycle error correction. The algebra is selected in a single bounce: it is the only key that fits a 2pi-bit lock.

•Apr 2, 2026•0 citations

Reconstruction locality bounds charge-generated dynamics in quantum codes: an exact accuracy floor and a measurable certificate for it

Zongmin Liu

Rare correlated error bursts are the reported scaling limit of below-threshold surface-code memo- ries, and existing analyses treat them as events that elevate the error rate across an entire code patch. We show that this assumption fails in the regime every scaled code must enter, where the patch is larger than the burst. There the logical error rate is controlled not by the burst rate but by the tail of the burst footprint distribution: for Pr[Ω > r] ∼ r−α the burst contribution obeys εb(d) ∝ dD−α, so exponential suppression in code distance is replaced by a power law and fault-tolerance over- head becomes polynomial rather than polylogarithmic, with a critical exponent αc = D separating suppressible from unsuppressible environments. Circuit-level simulations over nine code distances, d = 5 to 21, confirm the scaling function and the exponent transfer. We then measure the footprint distribution itself, from 265 radiation bursts resolved on a 60-qubit gap-engineered array, using a forward model of the array that is calibrated against synthetic catalogues before use. The distribu- tion is lognormal, with σ = 0.23 [0.21, 0.26] and median radius 2.9 mm, and is preferred over the best power law by ∆AIC = 71; that comparison is itself calibrated, placing the observed value 9.4σ from the power-law expectation. A lognormal has no tail exponent, so the non-scalable regime α ≤ D is excluded by ten standard deviations and exponential suppression survives in present hardware — refuting a prediction we had made from radiation-transport scaling. The measurement also shows that gap engineering has acted on the shape of the footprint distribution rather than on the burst rate alone, which under the transfer law makes phonon management an asymptotic rather than a constant-factor intervention. Independently, no burst in 5.2 h is large enough to span a distance-7 patch, which accounts for the absence of burst excess in 28 public distance-7 datasets. The largest footprint sampled corresponds to R = 4.9 mm, leaving the distribution beyond that radius — and hence the asymptotics of larger arrays — open to the same measurement on a larger device.

•Aug 1, 2026•0 citations

Beyond Qubit Count: A Comparative Review of Quantum Chip Architectures, Error Correction, and the Path to Fault-Tolerant Computing

Mr. Sairaj Dalvi, Mr. Suyog Salvi, Mr. Tanmay Patil +1 more

Quantum processors are often compared by the number of physical qubits they contain. That number, however, does not by itself indicate whether a processor can execute a useful computation reliably. Qubit coherence, gate and measurement fidelity, connectivity, control infrastructure, fabrication yield, and the overhead of quantum error correction all influence practical capability. This paper presents a structured comparative review of six major quantum-computing modalities: superconducting circuits, trapped ions, photonic systems, silicon-spin qubits, neutral atoms, and topological approaches. It examines their physical implementations, operational strengths, engineering constraints, and prospects for scaling. Particular attention is given to surface-code error correction and the 105-qubit Willow processor result reported by Google Quantum AI, which demonstrated below-threshold surface-code memory and a logical-error suppression factor of 2.14 ± 0.02 when code distance increased by two. The paper also considers cryogenic control, wiring, modular interconnects, fabrication variability, real-time decoding, and the Indian National Quantum Mission. The review finds that progress towards fault tolerance is best assessed through logical performance and system-level engineering rather than physical-qubit count alone. No modality currently removes the need to address scaling overhead, reliable operations, and application-level advantage

International Journal for Research in Applied Science and Engineering Technology•Nov 11, 2026•0 citations

What Discretises a Continuum of Errors Is Not the Code but the Measurement ── Eight Real Parameters Fall to Four Outcomes ── A Distance-3 Code Covers 28 of 262144, That Is 1.07x10^-4 ── [Paper 287]

Yuuki Yamagishi

The errors that can enter a qubit form a continuum. Why can a code with finitely many correctable errors fix them? This paper asks who does the discretising──the answer is the measurement, not the code. No new mathematical theorem and no new law is claimed. Scope of this paper (scope note): No new mathematical theorem and no new law is claimed──error discretisation, the Pauli basis, stabiliser codes, surface codes, and the threshold theorem are all standard. We do not construct codes──all we count is numbers of parameters and numbers of errors. We do not prove the threshold theorem──the value p_thapprox 10^-2 is quoted as a number only. We do not derive the logical error rate──(p/p_th)^(d+1)/2 is an asymptotic estimate that drops constant factors. The values of Section 5 are orders, not predictions. We do not discuss surface-code implementation──lattice geometry, measurement circuits, and decoders are not treated at all. The count approx d^2 physical qubits is the simplest estimate. We do not treat correlated errors──the count of Section 4 assumes independent single-qubit errors. With correlations, errors leave the weight-1 bracket. We do not read 1.068x10^-4 pessimistically──it is a fraction of all Pauli operators, not a fraction of the errors that actually occur. If real errors concentrate at weight 1, then 28 suffices in practice. This paper does not assert which is the case. On the sibling paper: Paper 281 treats the same quantum error correction and counts that the syndrome tells 8 bits about the error and 0 bits about the state──the root is the same (measurement does not destroy the state) but the question differs. That paper asks what the measurement does not take; this one asks what the measurement makes discrete. Readers are advised to read them side by side. Relation to earlier papers: Paper 163 separated “a good code exists” from “here is a good code”──this paper counts what a constructed code actually covers. Paper 179 showed that “cannot be constructed” has distinct roots──the impossibility of d=4 here likewise has counting as its root. Paper 252 counted four quantities called “information”──this paper separates continuous parameters from discrete outcomes. Paper 269 showed that what a crystal forbids is periodicity──the discretisation here is likewise imposed by a structure. What is added is counting a one-qubit error as 8 real parameters falling to 4 outcomes after measurement, computing that distance 3 covers 28 of 4^9=262144, a fraction of 1.068x10^-4, confirming that 3.24 times in the surface code corresponds to one hundredth, and placing the difference from the classical case at “whether a projection is required”. First, we count the errors on one qubit. E=c_0I+c_1X+c_2Y+c_3Z has 8 real parameters and is a continuum (Section 2). Second, this is the core of the paper. The measurement projects that onto the 4 outcomes I,X,Y,Z──the discretising is done by the measurement, not the code (Section 2). Third, fixing X and Z fixes Y. Since Y=iXZ, only 2 kinds need independent correction (Section 3). Fourth, a code covers only a sliver. Of the 4^9=262144 Pauli operators on 9 qubits, distance 3 fixes 28, a fraction of 1.068x10^-4 (Section 4). Fifth, in the surface code, 3.24 times gives one hundredth. From d=5 to 9, physical qubits 25->81 and logical error rate 10^-3->10^-5 (Section 5). Sixth, the separator is whether a projection is needed. Classical codes need none──because their errors are discrete to begin with (Section 6). The familiar statement that “continuous errors get discretised” is right. But what discretises is the measurement, not the code. A one-qubit error has 8 real parameters and forms a continuum, yet the syndrome measurement projects it onto the 4 outcomes I,X,Y,Z──what remains is a single Pauli error, and undoing it suffices. Since Y=iXZ, only 2 kinds need independent correction. Meanwhile the reach of a code is narrow──of the 262144 Pauli errors on 9 qubits, distance 3 fixes 28, a mere 1.068x10^-4. It works because the assumption that errors are sparse is doing the work. And the price is polynomial──multiplying the physical qubits by 3.24 divides the logical error rate by 100. One thing separates them──whether the errors are discrete to begin with, or a projection is required. A classical code needs no projection. In a quantum code, measuring is a precondition of correcting, and the separate fact that measuring does not destroy the state is what makes it possible. On the making of this work: The ideas and content of this work stem from the author's own considerations. Assistance from an AI (a large language model) was used for structuring, English translation, and checking the algebra. Any remaining errors or misinterpretations are solely the author's. Feedback and corrections are sincerely appreciated. ----- 量子ビットに入る誤りは連続無限にある。それを有限個の符号で訂正できるのは、なぜか。本稿が問うのは、離散化しているのは誰かである──答は、符号ではなく測定である。新しい数学定理も新しい法則も主張しない。 本稿の射程(射程注記):新しい数学定理も新しい法則も主張しない──誤りの離散化、パウリ基底、安定符号、表面符号、閾値定理は、いずれも標準的である。符号を作らない──数えるのはパラメータの個数と、誤りの個数だけである。閾値定理を証明しない──p_thapprox 10^-2 という値は数値として引くのみである。論理誤り率の式を導出しない──(p/p_th)^(d+1)/2 は漸近形の目安であり、定数因子を無視している。第5節の値は「桁」であって予言値ではない。表面符号の実装を論じない──格子の形も、測定回路も、デコーダも一切扱わない。物理量子ビット数 approx d^2 は最も単純な見積りである。相関誤りを扱わない──第4節の数え上げは独立な単一量子ビット誤りを仮定している。相関があれば重み 1 の枠から外れる。1.068x10^-4 を悲観的に読まない──これは全パウリ演算子に対する割合であって、実際に起きる誤りに対する割合ではない。起きやすい誤りが重み 1 に集中していれば実用上は十分である。本稿はどちらが実際かを主張しない。兄弟編について:論文281 は同じ量子誤り訂正を扱い、シンドロームが誤りについて 8 ビット・状態について 0 ビット語ることを数えた──根は同じ(測定が状態を壊さない)だが、問いが違う。あちらは測定が何を取らないか、本稿は測定が何を離散にするかである。読者は両方を並べて読むことを勧める。既刊との関係:論文163 は「良い符号が在る」と「これが良い符号だ」を分けた──本稿は構成された符号が実際に何個の誤りを覆うかを数える。論文179 は「構成できない」に別根があると示した──本稿の d=4 不可も数え上げが根である。論文252 は「情報量」が四つあると数えた──本稿は連続なパラメータと離散な結果を分ける。論文269 は結晶が禁じるのが周期性だと示した──本稿の離散化も構造が課すものである。加えたのは一量子ビットの誤りが実パラメータ 8 つで、測定後に 4 通りになると数えたこと、4^9=262144 に対して距離 3 が覆うのが 28 個・1.068x10^-4 だと計算したこと、表面符号で 3.24 倍が 100 分の一に対応すると確かめたこと、古典との差を「射影が要るかどうか」に置いたことである。 第一に、一量子ビットの誤りを数える。 E=c_0I+c_1X+c_2Y+c_3Z には実パラメータが 8 つあり、連続無限である(第2節)。 第二に、これが本稿の芯である。測定がそれを I,X,Y,Z の 4 通りに射影する──離散にしているのは測定であって、符号ではない(第2節)。 第三に、X と Z を直せば Y も直る。 Y=iXZ だから、独立に直すべきは 2 種類だけである(第3節)。 第四に、符号が直せるのはごく一部である。9 量子ビットのパウリ演算子 4^9=262144 個のうち、距離 3 が直すのは 28 個、割合は 1.068x10^-4(第4節)。 第五に、表面符号では 3.24 倍で 100 分の一である。 d=5->9、物理量子ビット 25->81 で論理誤り率 10^-3->10^-5(第5節)。 第六に、分離子は「射影があるか」である。古典符号には射影が要らない──誤りが最初から離散だからである(第6節)。 量子誤り訂正でよく言われる「連続な誤りが離散化される」は正しい。ただし離散化しているのは符号ではなく、測定である。一量子ビットの誤りには実パラメータが 8 つあり、連続無限であるが、シンドローム測定が I,X,Y,Z の 4 通りに射影する──そのあとに残るのは一つのパウリ誤りであり、打ち消せばよい。 Y=iXZ なので、独立に直すべきは 2 種類である。一方で、符号が覆う範囲は狭い──9 量子ビットのパウリ誤り 262144 通りのうち、距離 3 が直せるのは 28 通り、1.068x10^-4 にすぎない。それでも動くのは誤りが疎だという仮定が効いているからである。そして代償は多項式で済む──物理量子ビットを 3.24 倍にすると、論理誤り率が 100 分の一になる。分けるものは一つ──誤りが最初から離散か、射影を要するか。古典符号に射影は要らない。量子符号では、測ることが訂正の前提であり、測ることが状態を壊さないという別の事実が、それを可能にしている。 作成にあたって:本稿の着想と内容は、著者自身の考察に基づくものです。文章の構成整理や英訳、数式の確認には AI(大規模言語モデル)の助力を得ました。最終的な内容の解釈や誤りがあれば、それらはすべて著者の責に帰します。お気づきの点があれば、ご教示いただければ幸いです。

•Aug 30, 2026•0 citations
This note applies a single first-order source-loss balance, C dθ/dt = A − ρθ, to systems across many scales — from a planetary surface to a qubit register — and reports, with exact numbers, where the balance reproduces measured values and where it does not. The central quantitative result concerns quantum error correction. Using published surface-code and trapped-ion data (Google Quantum AI, Nature 638, 920 (2024); Quantinuum Helios colour-code results, 2026), the note shows that the logical error per cycle falls by a constant factor Λ only while errors are independent. Correlated bursts act as a common loss channel whose rate does not fall with code distance; the quoted floor is about 3×10⁻¹⁰ per cycle, reached at distance about 46 for Λ = 2.17. For factoring a 2048-bit integer (about 1.4×10³ logical qubits, 6.5×10⁹ Toffoli gates, 4.96 days at a 1 μs cycle), the permitted logical error is 1.7×10⁻¹⁵ per qubit per cycle. At measured suppression factors this requires code distances of about 78 (Λ = 2.17) or about 24 (Λ = 12), while the published design uses 25 — and the correlated-error floor is not removed by increasing distance. This is a quantitative statement about where the scaling of error suppression stops matching the requirements of large computations, not a claim that small-scale quantum devices cannot work. The note also lists, separately and with exact values, the tests the balance fails: quark mass-step prediction (T6), gas/solid classification (T8, p = 0.81), nuclear count with A = 3, 4, prediction SP1 (−11.8% against a 10% threshold), coupling versus number of doors (T10, p = 0.015), width-to-cosmological-scale mapping (q₀ = −0.528 ± 0.011 against 0), human loss-rate estimates (11.1 and 15.3 W/K), critical Q₁₀ = 3.03 against measured 2.0–2.3, Higgs width from the b-quark exit alone (13.7% residual), shell boundaries (13 of 18), and several time constants. Of nine tests where the balance gives a value different from the standard one, one agreed with measurement and eight did not; the rules and thresholds were written before the data were examined. Successful checks include: photosynthesis stage efficiencies (0.487 × 0.094 = 0.0458 against 0.046 reported), a three-stage 2.45 GHz rectenna chain (0.906³ = 0.744), closure of the lunar surface energy budget to a ratio of 1.005, mode quality factors Q = m/Γ for the τ lepton (7.84×10¹¹), the Z boson (36.5) and the Higgs boson (3.38×10⁴), the Higgs lifetime from its width (290.87 fs against 290.3 ± 0.5 fs, a consistency check of standard formulas), and the proton-decay bound ρ < 1.3×10⁻⁴² s⁻¹. The complete theory, tests, scripts and the list of open items are maintained at https://zenodo.org/records/23812417. This note is a standalone publication; readers are invited to report measured values that disagree.
Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of Λ=2.14±0.02\varLambda \mathrm{=2.14}\pm 0.02Λ=2.14±0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of 2.4±0.32.4\pm 0.32.4±0.3 . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 333 ×\times × 109{10}^{9}109 cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.
We derive a fundamental lower bound on the gate error rate of any quantum computing platform from the K-functional framework. Two irreducible error sources compete: K_rec record back-action (the environment acquires information about which gate was applied, corrupting the qubit) and K_ent thermal decoherence (the qubit thermalizes during the gate operation). The K_rec error decreases with weaker qubit-control coupling while the K_ent error increases, producing a U-shaped curve with a minimum at the optimal coupling g/w = (8pi/Q)^(1/3), where Q is the qubit quality factor. The minimum error rate is e_floor = 0.512 Q^(-2/3). At this minimum, K_rec contributes exactly one-third of the total error and K_ent contributes two-thirds, a ratio fixed by the cubic optimization and not adjustable by engineering. The floor scales as Q^(-2/3), not Q^(-1) as standard decoherence theory would suggest. This sub-linear scaling is a testable prediction: on a log-log plot of error rate versus quality factor across platforms, the K-functional predicts slope -2/3 rather than -1. The same one-loop factor 1/(16pi^2) that governs the chiral anomaly (Paper 12) and the cosmological constant (Paper 13) sets the K_rec back-action rate, connecting quantum computing errors to fundamental physics. The Bekenstein bound limits the maximum quality factor to Q_max = S_Bek = 2piER/(hbar c), giving an absolute error floor of 0.512 S_Bek^(-2/3). At the Planck scale (the monopole of Paper 3), S_Bek = 2pi, giving a 15% per-operation error rate, above the fault-tolerance threshold. The gauge algebra SU(3) x SU(2) x U(1) survives the cosmological bounce because 2pi bits is just sufficient to encode the algebra, and the bounce attractor (Paper 11, gain 0.23) provides cross-cycle error correction. The algebra is selected in a single bounce: it is the only key that fits a 2pi-bit lock.
Rare correlated error bursts are the reported scaling limit of below-threshold surface-code memo- ries, and existing analyses treat them as events that elevate the error rate across an entire code patch. We show that this assumption fails in the regime every scaled code must enter, where the patch is larger than the burst. There the logical error rate is controlled not by the burst rate but by the tail of the burst footprint distribution: for Pr[Ω > r] ∼ r−α the burst contribution obeys εb(d) ∝ dD−α, so exponential suppression in code distance is replaced by a power law and fault-tolerance over- head becomes polynomial rather than polylogarithmic, with a critical exponent αc = D separating suppressible from unsuppressible environments. Circuit-level simulations over nine code distances, d = 5 to 21, confirm the scaling function and the exponent transfer. We then measure the footprint distribution itself, from 265 radiation bursts resolved on a 60-qubit gap-engineered array, using a forward model of the array that is calibrated against synthetic catalogues before use. The distribu- tion is lognormal, with σ = 0.23 [0.21, 0.26] and median radius 2.9 mm, and is preferred over the best power law by ∆AIC = 71; that comparison is itself calibrated, placing the observed value 9.4σ from the power-law expectation. A lognormal has no tail exponent, so the non-scalable regime α ≤ D is excluded by ten standard deviations and exponential suppression survives in present hardware — refuting a prediction we had made from radiation-transport scaling. The measurement also shows that gap engineering has acted on the shape of the footprint distribution rather than on the burst rate alone, which under the transfer law makes phonon management an asymptotic rather than a constant-factor intervention. Independently, no burst in 5.2 h is large enough to span a distance-7 patch, which accounts for the absence of burst excess in 28 public distance-7 datasets. The largest footprint sampled corresponds to R = 4.9 mm, leaving the distribution beyond that radius — and hence the asymptotics of larger arrays — open to the same measurement on a larger device.
Quantum processors are often compared by the number of physical qubits they contain. That number, however, does not by itself indicate whether a processor can execute a useful computation reliably. Qubit coherence, gate and measurement fidelity, connectivity, control infrastructure, fabrication yield, and the overhead of quantum error correction all influence practical capability. This paper presents a structured comparative review of six major quantum-computing modalities: superconducting circuits, trapped ions, photonic systems, silicon-spin qubits, neutral atoms, and topological approaches. It examines their physical implementations, operational strengths, engineering constraints, and prospects for scaling. Particular attention is given to surface-code error correction and the 105-qubit Willow processor result reported by Google Quantum AI, which demonstrated below-threshold surface-code memory and a logical-error suppression factor of 2.14 ± 0.02 when code distance increased by two. The paper also considers cryogenic control, wiring, modular interconnects, fabrication variability, real-time decoding, and the Indian National Quantum Mission. The review finds that progress towards fault tolerance is best assessed through logical performance and system-level engineering rather than physical-qubit count alone. No modality currently removes the need to address scaling overhead, reliable operations, and application-level advantage
The errors that can enter a qubit form a continuum. Why can a code with finitely many correctable errors fix them? This paper asks who does the discretising──the answer is the measurement, not the code. No new mathematical theorem and no new law is claimed. Scope of this paper (scope note): No new mathematical theorem and no new law is claimed──error discretisation, the Pauli basis, stabiliser codes, surface codes, and the threshold theorem are all standard. We do not construct codes──all we count is numbers of parameters and numbers of errors. We do not prove the threshold theorem──the value p_thapprox 10^-2 is quoted as a number only. We do not derive the logical error rate──(p/p_th)^(d+1)/2 is an asymptotic estimate that drops constant factors. The values of Section 5 are orders, not predictions. We do not discuss surface-code implementation──lattice geometry, measurement circuits, and decoders are not treated at all. The count approx d^2 physical qubits is the simplest estimate. We do not treat correlated errors──the count of Section 4 assumes independent single-qubit errors. With correlations, errors leave the weight-1 bracket. We do not read 1.068x10^-4 pessimistically──it is a fraction of all Pauli operators, not a fraction of the errors that actually occur. If real errors concentrate at weight 1, then 28 suffices in practice. This paper does not assert which is the case. On the sibling paper: Paper 281 treats the same quantum error correction and counts that the syndrome tells 8 bits about the error and 0 bits about the state──the root is the same (measurement does not destroy the state) but the question differs. That paper asks what the measurement does not take; this one asks what the measurement makes discrete. Readers are advised to read them side by side. Relation to earlier papers: Paper 163 separated “a good code exists” from “here is a good code”──this paper counts what a constructed code actually covers. Paper 179 showed that “cannot be constructed” has distinct roots──the impossibility of d=4 here likewise has counting as its root. Paper 252 counted four quantities called “information”──this paper separates continuous parameters from discrete outcomes. Paper 269 showed that what a crystal forbids is periodicity──the discretisation here is likewise imposed by a structure. What is added is counting a one-qubit error as 8 real parameters falling to 4 outcomes after measurement, computing that distance 3 covers 28 of 4^9=262144, a fraction of 1.068x10^-4, confirming that 3.24 times in the surface code corresponds to one hundredth, and placing the difference from the classical case at “whether a projection is required”. First, we count the errors on one qubit. E=c_0I+c_1X+c_2Y+c_3Z has 8 real parameters and is a continuum (Section 2). Second, this is the core of the paper. The measurement projects that onto the 4 outcomes I,X,Y,Z──the discretising is done by the measurement, not the code (Section 2). Third, fixing X and Z fixes Y. Since Y=iXZ, only 2 kinds need independent correction (Section 3). Fourth, a code covers only a sliver. Of the 4^9=262144 Pauli operators on 9 qubits, distance 3 fixes 28, a fraction of 1.068x10^-4 (Section 4). Fifth, in the surface code, 3.24 times gives one hundredth. From d=5 to 9, physical qubits 25->81 and logical error rate 10^-3->10^-5 (Section 5). Sixth, the separator is whether a projection is needed. Classical codes need none──because their errors are discrete to begin with (Section 6). The familiar statement that “continuous errors get discretised” is right. But what discretises is the measurement, not the code. A one-qubit error has 8 real parameters and forms a continuum, yet the syndrome measurement projects it onto the 4 outcomes I,X,Y,Z──what remains is a single Pauli error, and undoing it suffices. Since Y=iXZ, only 2 kinds need independent correction. Meanwhile the reach of a code is narrow──of the 262144 Pauli errors on 9 qubits, distance 3 fixes 28, a mere 1.068x10^-4. It works because the assumption that errors are sparse is doing the work. And the price is polynomial──multiplying the physical qubits by 3.24 divides the logical error rate by 100. One thing separates them──whether the errors are discrete to begin with, or a projection is required. A classical code needs no projection. In a quantum code, measuring is a precondition of correcting, and the separate fact that measuring does not destroy the state is what makes it possible. On the making of this work: The ideas and content of this work stem from the author's own considerations. Assistance from an AI (a large language model) was used for structuring, English translation, and checking the algebra. Any remaining errors or misinterpretations are solely the author's. Feedback and corrections are sincerely appreciated. ----- 量子ビットに入る誤りは連続無限にある。それを有限個の符号で訂正できるのは、なぜか。本稿が問うのは、離散化しているのは誰かである──答は、符号ではなく測定である。新しい数学定理も新しい法則も主張しない。 本稿の射程(射程注記):新しい数学定理も新しい法則も主張しない──誤りの離散化、パウリ基底、安定符号、表面符号、閾値定理は、いずれも標準的である。符号を作らない──数えるのはパラメータの個数と、誤りの個数だけである。閾値定理を証明しない──p_thapprox 10^-2 という値は数値として引くのみである。論理誤り率の式を導出しない──(p/p_th)^(d+1)/2 は漸近形の目安であり、定数因子を無視している。第5節の値は「桁」であって予言値ではない。表面符号の実装を論じない──格子の形も、測定回路も、デコーダも一切扱わない。物理量子ビット数 approx d^2 は最も単純な見積りである。相関誤りを扱わない──第4節の数え上げは独立な単一量子ビット誤りを仮定している。相関があれば重み 1 の枠から外れる。1.068x10^-4 を悲観的に読まない──これは全パウリ演算子に対する割合であって、実際に起きる誤りに対する割合ではない。起きやすい誤りが重み 1 に集中していれば実用上は十分である。本稿はどちらが実際かを主張しない。兄弟編について:論文281 は同じ量子誤り訂正を扱い、シンドロームが誤りについて 8 ビット・状態について 0 ビット語ることを数えた──根は同じ(測定が状態を壊さない)だが、問いが違う。あちらは測定が何を取らないか、本稿は測定が何を離散にするかである。読者は両方を並べて読むことを勧める。既刊との関係:論文163 は「良い符号が在る」と「これが良い符号だ」を分けた──本稿は構成された符号が実際に何個の誤りを覆うかを数える。論文179 は「構成できない」に別根があると示した──本稿の d=4 不可も数え上げが根である。論文252 は「情報量」が四つあると数えた──本稿は連続なパラメータと離散な結果を分ける。論文269 は結晶が禁じるのが周期性だと示した──本稿の離散化も構造が課すものである。加えたのは一量子ビットの誤りが実パラメータ 8 つで、測定後に 4 通りになると数えたこと、4^9=262144 に対して距離 3 が覆うのが 28 個・1.068x10^-4 だと計算したこと、表面符号で 3.24 倍が 100 分の一に対応すると確かめたこと、古典との差を「射影が要るかどうか」に置いたことである。 第一に、一量子ビットの誤りを数える。 E=c_0I+c_1X+c_2Y+c_3Z には実パラメータが 8 つあり、連続無限である(第2節)。 第二に、これが本稿の芯である。測定がそれを I,X,Y,Z の 4 通りに射影する──離散にしているのは測定であって、符号ではない(第2節)。 第三に、X と Z を直せば Y も直る。 Y=iXZ だから、独立に直すべきは 2 種類だけである(第3節)。 第四に、符号が直せるのはごく一部である。9 量子ビットのパウリ演算子 4^9=262144 個のうち、距離 3 が直すのは 28 個、割合は 1.068x10^-4(第4節)。 第五に、表面符号では 3.24 倍で 100 分の一である。 d=5->9、物理量子ビット 25->81 で論理誤り率 10^-3->10^-5(第5節)。 第六に、分離子は「射影があるか」である。古典符号には射影が要らない──誤りが最初から離散だからである(第6節)。 量子誤り訂正でよく言われる「連続な誤りが離散化される」は正しい。ただし離散化しているのは符号ではなく、測定である。一量子ビットの誤りには実パラメータが 8 つあり、連続無限であるが、シンドローム測定が I,X,Y,Z の 4 通りに射影する──そのあとに残るのは一つのパウリ誤りであり、打ち消せばよい。 Y=iXZ なので、独立に直すべきは 2 種類である。一方で、符号が覆う範囲は狭い──9 量子ビットのパウリ誤り 262144 通りのうち、距離 3 が直せるのは 28 通り、1.068x10^-4 にすぎない。それでも動くのは誤りが疎だという仮定が効いているからである。そして代償は多項式で済む──物理量子ビットを 3.24 倍にすると、論理誤り率が 100 分の一になる。分けるものは一つ──誤りが最初から離散か、射影を要するか。古典符号に射影は要らない。量子符号では、測ることが訂正の前提であり、測ることが状態を壊さないという別の事実が、それを可能にしている。 作成にあたって:本稿の着想と内容は、著者自身の考察に基づくものです。文章の構成整理や英訳、数式の確認には AI(大規模言語モデル)の助力を得ました。最終的な内容の解釈や誤りがあれば、それらはすべて著者の責に帰します。お気づきの点があれば、ご教示いただければ幸いです。