Locale Framework Applied to Quantum Computing Innovations & Practical Applications

In the paper's words

Quantum computing is often presented through a small set of recurring claims: continuous-variable systems are naturally advantaged, more modes means more power, quantum advantage has been demonstrated at device level, statistics could in principle be non-standard, complex amplitudes are essential, approximation-based gate synthesis is the only approach, a transmon is a qubit, and fault tolerance is a matter of years. This paper argues that each of these claims is true only within a restricted domain of applicability, and that the boundaries at which they fail are not defects of the claims but the places where the physics relevant to practitioners actually lives. Drawing on the locale framework introduced in a companion record, the paper states eight of the most widely repeated claims, makes the domain of each explicit, and pairs each boundary with work presented at the 23rd International Conference on Quantum Physics and Logic (QPL 2026).

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Drawing on the locale framework introduced in a companion record [1], the paper states eight of the most widely repeated claims, makes the domain of each explicit, and pairs each boundary with work presented at the 23rd International Conference on Quantum Physics and Logic (QPL 2026) — together with one independent arXiv result — including new results on the energy cost of continuous-variable computation [2], a closely related independent result on trading modes against energy [3], classical simulation of Clifford+T circuits [4], invariance under quantum permutations [5], real-valued quantum theory [6,7], and the arithmetic structure of gate synthesis [8].

   from Abstract

2. The territory that survives is the cost of producing a solution, measured end to end: computation, cooling, control, decoding, and the classical baseline it competes against [10,11].

   from 4. Why the boundaries matter: maps, territory, and the interface

3. The $CV\leftrightarrow DV$ equivalence of Maltesson et al. [2] says that a continuous-variable computation of n modes with energy budget E* is simulable by qudits with error at most $1286 \cdot K \cdot n^{2}$·E*²/√d.

   from 5. What survives: counts, ratios, and energy

How it is done

1. Quantum computing is often presented through a small set of recurring claims: continuous-variable systems are naturally advantaged, more modes means more power, quantum advantage has been demonstrated at device level, statistics could in principle be non-standard, complex amplitudes are essential, approximation-based gate synthesis is the only approach, a transmon is a qubit, and fault tolerance is a matter of years.

   from Abstract

2. Maps are not wrong — they are locale-bound.

   from 4. Why the boundaries matter: maps, territory, and the interface

3. This is consistent with the pre-registered negative result of the author's earlier work on the statistics distinction [12]: statistics is a locale effect of permutation invariance, not a theorem of any single formalism.

   from 7. Responses to five challenges

4. The Joules-per-Solution Metric: Definition, Measurement Protocol, and Anti-Gaming Provisions for Honest Computational Benchmarking . the QNFO archive, https://papers.qnfo.org/papers/joules-per-solution-metric/. [12] Quni-Gudzinas, R.

   from References

What would falsify it

1. This is an external result, produced by researchers working in the exact-synthesis tradition; its significance for the locale framework is that it is exactly the kind of structure leak the framework predicts [1,8].

   from 4. Why the boundaries matter: maps, territory, and the interface

2. Hoffreumon and Woods show that real-valued quantum theory reproduces all finite network correlations once independence is imposed operationally, and that it cannot be experimentally falsified [6,7].

   from 7. Responses to five challenges

3. What this paper does not claim: no dynamical theory of boundaries is proposed; the table is a catalog, not a prediction; and nothing here decides whether the substrate of quantum computing is Archimedean or ultrametric — only that the question is real, and that the answer will leak through the rendering before it is decided from inside it.

   from 8. Conclusions

Where the claim stops

1. What this paper does not claim: no dynamical theory of boundaries is proposed; the table is a catalog, not a prediction; and nothing here decides whether the substrate of quantum computing is Archimedean or ultrametric — only that the question is real, and that the answer will leak through the rendering before it is decided from inside it.

   from 8. Conclusions

2. Quantum computing is often presented through a small set of recurring claims: continuous-variable systems are naturally advantaged, more modes means more power, quantum advantage has been demonstrated at device level, statistics could in principle be non-standard, complex amplitudes are essential, approximation-based gate synthesis is the only approach, a transmon is a qubit, and fault tolerance is a matter of years.

   from Abstract

3. This paper argues that each of these claims is true only within a restricted domain of applicability, and that the boundaries at which they fail are not defects of the claims but the places where the physics relevant to practitioners actually lives.

   from Abstract

Where to read

1. Abstract247 words · 1 min
2. 1. Introduction267 words · 1 min
3. 2. The locale framework in brief196 words · 1 min
4. 3. Eight claims and their boundaries480 words · 2 min
5. 4. Why the boundaries matter: maps, territory, and the interface345 words · 2 min
6. 5. What survives: counts, ratios, and energy186 words · 1 min
7. 6. Practitioner-oriented work at QPL 2026347 words · 2 min
8. 7. Responses to five challenges441 words · 2 min
9. 8. Conclusions294 words · 1 min