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), including new results on the energy cost of continuous-variable computation, classical simulation of Clifford+T circuits, invariance under quantum permutations, real-valued quantum theory, and the arithmetic structure of gate synthesis. A review of the practitioner-oriented contributions at QPL 2026 follows, and five challenges raised at the conference are answered. The paper closes with the observation that the quantity which survives every boundary examined is energy per solution. Why a reader should care: this paper turns every quantum-computing innovation and practical-application claim into a conditional truth with an explicit locale, then pairs each claim with the exact QPL 2026 paper that documents where it breaks. The seams catalog T1-T8 replaces a year of vendor roadmaps: claims are conditional truths, the seams are public, and the energy exchange rate between paradigms is the currency. Premise-depth: the framework's primitives 'locale' and 'interface' are imported (UMP.011); OSR is a named input; the energy theorems are imported external results; the catalog is retrodictive; no dynamical theory of seams is claimed.
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), including new results on the energy cost of continuous-variable computation, classical simulation of Clifford+T circuits, invariance under quantum permutations, real-valued quantum theory, and the arithmetic structure of gate synthesis. A review of the practitioner-oriented contributions at QPL 2026 follows, and five challenges raised at the conference are answered. The paper closes with the observation that the quantity which survives every boundary examined is energy per solution. Why a reader should care: this paper turns every quantum-computing innovation and practical-application claim into a conditional truth with an explicit locale, then pairs each claim with the exact QPL 2026 paper that documents where it breaks. The seams catalog T1-T8 replaces a year of vendor roadmaps: claims are conditional truths, the seams are public, and the energy exchange rate between paradigms is the currency. Premise-depth: the framework's primitives 'locale' and 'interface' are imported (UMP.011); OSR is a named input; the energy theorems are imported external results; the catalog is retrodictive; no dynamical theory of seams is claimed.
This note explains how quantum logic gates work, which gate sets are universal, and why non-Clifford (T) gates dominate the cost of fault-tolerant computation. Comparing public results across six platforms with evidence up to 7 October 2026: in the peer-reviewed literature, single-qubit error on a single ion reaches 1.5×10⁻⁷ and best single-pair two-qubit errors lie in the 10⁻³–10⁻⁴ range, while about 8.4×10⁻⁵ on a two-ion prototype remains a preprint; system-wide averages can be about an order of magnitude worse than best single-pair values (for example, 7.9×10⁻⁴ on the 98-qubit Helios, and 0.33% CZ error with all gates running simultaneously on Willow's error-correction chip according to Google's specification). Because reporting conventions differ, cross-platform comparisons are indicative only. The note then reviews the move from physical to logical gates — lattice surgery, logical non-Clifford gates and magic-state preparation — most of which remain at small code distance, some with postselection, and many still in preprints. It is a structured evidence synthesis and technical guide based on public literature and reports no new experiments or measurements.
Abstract This guide is based on the IBM Quantum course Quantum Algorithmic Foundations and addresses a central question in quantum computation: Do quantum algorithms offer provable advantages beyond the oracle (black-box) query model, in more standard computational settings where inputs are given explicitly? Answering this question requires building a rigorous theoretical foundation. The course begins with a detailed discussion of computational cost in both classical and quantum models, focusing on how complexity scales with input size rather than on absolute execution time. The emphasis is placed on algorithmic efficiency, independent of hardware improvements. To ground the discussion, the material draws heavily from computational number theory, including problems such as: Integer arithmetic Greatest common divisor (GCD) computation Integer factorization Although number theory represents a specific application domain, it provides a clear and powerful framework for analyzing computational complexity and illustrating the principles underlying quantum speedups. A key theme of the lesson is the distinction between algorithmic scalability and hardware performance. The primary concern is how the cost of an algorithm grows as problem instances become larger — a perspective that remains valid across technological generations. The course concludes by addressing a critically important concept: implementing classical computations on quantum computers. The significance of this idea is not to replace classical machines, but to use classical algorithms as subroutines within quantum procedures. This hybrid approach leverages decades of classical algorithmic research while opening new pathways toward quantum computational advantage. Through practical experimentation on IBM Q, this work connects theoretical foundations with hands-on quantum programming, reinforcing the structural principles that underlie advanced quantum algorithm design.
Quantum computing is often described as evaluating many answers simultaneously. That metaphor confuses a large mathematical state space with accessible classical output and encourages a second mistake: treating an asymptotic speedup as an engineered or economic result. This commentary revisits Wright (2025) against experimental and resource-estimation evidence through 2026. The central criticism survives, but two claims require revision. Fault tolerance is no longer merely hypothetical after below-threshold logical-memory experiments and cryptanalytic resource estimates have fallen substantially under specified hardware assumptions. The defensible position therefore rests on four distinctions: computability, algorithmic complexity, fault-tolerant execution and practical value. A credible claim of quantum advantage must identify the task, compare against the strongest current classical method, include the complete system cost and explain verification. This framework supports continued research and post-quantum migration while rejecting claims that outrun demonstrated performance.
Fault-tolerant ∣T⟩ state preparation and injection for more efficient fine-grained quantum circuit synthesis
Magic-state injection is a standard route to realize universal fault-tolerant quantum computation. Whereas the set of Clifford gates in combination with the non-Clifford T gate is a widely used universal gate set, extending the available set of non-Clifford primitives can reduce compilation overhead, provided that the additional primitives can be prepared fault-tolerantly with competitive resource costs and at sufficiently low logical noise rates. In this work, we introduce flag fault-tolerant protocols for preparing logical $|\sqrt{\mathrm{T}} \rangle $ magic states on the 3D tetrahedral color code and its smaller morphed variant. Our simulations under circuit-level noise verify fault tolerance, quantify acceptance and logical error rates, and we reconstruct the effective logical channels of the corresponding circuits for gate injection via logical process tomography. We find that access to T reduces the average space-time cost of synthesizing Haar-random single-qubit unitaries by approximately 20-30% relative to the Clifford+T gate set across practically relevant approximation regimes. These results demonstrate how expanding the set of fault-tolerant non-Clifford primitives can improve computational efficiency and broaden the design space for universal quantum computation in the early fault-tolerant era.
PRELIMINARY DRAFT — Version 1 (v1), posted 30 August 2026. This version is circulated as a working resource, not as a finished manuscript, and is not offered as being of publication quality. Please cite this Article by section rather than by page since the pagination may change between versions. Fault-tolerant quantum computers---machines whose processors access thousands of error-corrected logical qubits built from roughly a million physical qubits, projected by vendor roadmaps within five to ten years---will disrupt not only cybersecurity, medicine, communications, manufacturing, and logistics, but also the law that governs them. This Article surveys that emerging legal landscape for the working attorney, organized by a single lens drawn from computational complexity theory: legal impact tracks the shape of quantum advantage. Where quantum machines merely accelerate classical computation, existing doctrine adapts parametrically. Where they solve problems classically believed intractable (the regime of problems inside BQP but outside P, exemplified by cryptanalysis and quantum simulation), doctrine that silently premises classical intractability may fail categorically. The Article maps this two-tier taxonomy across six legal domains: electronic discovery, the quintessential Tier I case, where the cost terms of Rule 26 are revalued without a word of the Rule changing; data protection and the "harvest now, decrypt later" threat; intellectual property, including the risk that commercially available quantum simulation will cause trade-secret rights in some simulable formulations to lapse; government policy and administrative law, where federal policy remains promotional rather than regulatory; international trade, where the 2026 precedent of export controls on deployed frontier AI models supplies a template for controls on quantum capability; and civil litigation, from Article III standing for harvested-data plaintiffs to Daubert reliability for computations no classical machine can check. Drawing on the regulatory arc of artificial intelligence as a predictive model---and identifying the crucial difference that quantum's flagship harm is discrete, foreseeable, and approximately datable---the Article closes by outlining five narrow, capability-triggered reforms: statutory migration deadlines with safe harbors; a decryption-capability trigger for notification, accrual, and limitations; verification standards for quantum-derived evidence; trade-secret clarification for simulation-discoverable information; and an ex ante plurilateral framework for capability-level export controls.
This position paper is a reference pointer and wayfinder for the project record of "The Type III Dimension Postulate" (Reid 2026, Rev 3). It is not a substitute for engagement with Rev 3 or its companion documents; its function is to state where the project stands at the close of the post-publication synthesis chapter, summarize the framework's claims and non-claims at the level appropriate to wayfinding, identify which companion documents carry which registers of the work, and direct readers to the artifacts that articulate the framework's content in full. The framework was first submitted to the International Journal of Quantum Foundations / Quantum Speculations in April 2026 under the title "Observation as Emergent Dimension: The Reid Postulate." Following peer review, acceptance, and publication of Revision 1 in May 2026, the framework's consolidated articulation (Rev 3) is filed under the descriptive title "The Type III Dimension Postulate" in recognition that the framework's load-bearing content lies in the typeness separation rather than in any process of emergence. Both titles are preserved in the project record: the IJQF submission remains the journal artifact of record under its original title; the consolidated articulation and forward-going record carry the new title. The position paper summarizes what the framework claims (the fiber bundle structure, binary Ω, identical four-dimensional content, typeness separation, composability, conditional applicability, Born measure placement, the no-go boundary in two registers) and what it does not claim (a dynamics for definiteness, a derivation of the Born rule, a positive theory of definiteness, a unification of general relativity and quantum mechanics, a categorical no-go theorem, an algebraic derivation of joint describability). It identifies the work the framework does on its existing content, names the open problems and their structural location, summarizes the no-go theorem's scope and underlying claim, and describes the framework's posture toward the literature. The project record consists of seven companion deposits. Reid 2026 (Rev 1) is the journal submission of record. Reid 2026b is the no-go theorem. Reid 2026c is the Rev 2 minimal-structure analysis. Reid 2026 (Rev 3) is the consolidated post-review articulation. Reid 2026d is the structure-fact fence synthesis. Reid 2026e is the Gleason compatibility synthesis. Reid 2026f articulates the scope-conditional posture. Reid 2026g is the baseline synthesis on algebraic conditions for conditional indexability. Readers seeking to engage the framework's claims at full articulation should consult Rev 3; readers seeking specific clarifications or applications should consult the companion documents named in this position paper. Revision 2 of this position paper supersedes Revision 1 editorially. It incorporates Reid 2026f and Reid 2026g into the companion record, updates Rev 3's archive status, carries the corrected descriptive title for the forward-going record, and adjusts the closing register from forward-leaning to custodial in recognition of the project's transition from active construction to maintained record. The framework's structural commitments are unchanged. Submitted for technical scrutiny, not belief