Operational Circularity of Qubit Ontology: Excitations Defined by Their Own Readout

In the paper's words

Is the qubit a pre-existing object that control pulses and readout merely probe, or a two-level subsystem constituted by the very operations that define it? We formalize this question as a self-referential calibration problem: an ontology map Φ assigns Hilbert-space identifications to operational data, and calibration seeks a fixed point of the composite loop T = Γ ∘ Φ, in which states are defined by measurements that are themselves defined by states. We distinguish two regimes.

The abstract, verbatim; every line below is quoted from the text.

What it claims

The circularity of qubit ontology is benign exactly when the calibration operator T is a contraction (unique fixed point, convergence in a small number of rounds in the illustrative model), and problematic exactly to the extent that multiplicity or an equivariant symmetry survives.

Numbers it reports

1. If $T$ is a contraction with Lipschitz constant $L \lt 1$, $$d_{\mathcal{D}}\big(T(x), T(x')\big) \leq L\, d_{\mathcal{D}}(x, x') \quad \text{for all } x, x' \in \mathcal{D},$$ then by the Banach fixed-point theorem $T$ has a unique fixed point $x^{*}$, and iteration from any initial guess $x_0$ converges to it, with $$d_{\mathcal{D}}(x_n, x^{*}) \leq L^{n}\, d_{\mathcal{D}}(x_0, x^{*}).$$ Convergence to tolerance $\varepsilon$ requires $$n \geq \frac{\ln\!\big(\varepsilon / d_{\mathcal{D}}(x_0, x^{*})\big)}{\ln L}.$$ Since $0 \lt L \lt 1$, $\ln L \lt 0$; with $\varepsilon \lt d_{\mathcal{D}}(x_0, x^{*})$ the numerator is negative and $n$ is positive, as required.

   from 3.2 Benign circularity: the contraction condition

2. Model a single-parameter calibration loop as the linear contraction $T(x) = x^{*} + L(x - x^{*})$ with labeled illustrative inputs $L = 0.6$, initial discrepancy $d_0 = d_{\mathcal{D}}(x_0, x^{*}) = 1$ in normalized units, and target tolerance $\varepsilon = 10^{-3}$.

   from 4.2 Statistical floor and the contraction regime

3. Solving $x = T_A(x)$: $x = 0.5x + 0.5a \Rightarrow 0.5x = 0.5a \Rightarrow x_A^{*} = a$; similarly $x_B^{*} = b$.

   from 4.4 A two-ontology toy model with two fixed points

4. Using the single-shot readout fidelity of $99.991\%$ reported for trapped-ion optical qubits, we compute the shot budget required to resolve ontology-discriminating discrepancies: $N \approx 2.65 \times 10^{6}$ shots for a discrepancy $\delta = 10^{-3}$ at $1\%$ failure probability.

   from Abstract

5. Experimental anchor. [4] demonstrates single-shot qubit readout with fidelity sufficient for fault-tolerant quantum computation, for two types of qubit stored in single trapped calcium ions; for an optical qubit stored in the $(4S_{1/2}, 3D_{5/2})$ levels of $^{40}\mathrm{Ca}^{+}$, an average readout fidelity of $99.991(1)\%$ over one million trials is achieved using time-resolved photon counting, with an adaptive technique allowing $99.99\%$ fidelity.

   from 2. Background and Related Work

6. We use this figure as the empirical input for our shot-budget computation (Section 4.3): it fixes the per-shot noise floor against which ontology-discriminating signals must compete.

   from 2. Background and Related Work

How it is done

1. When $T$ is a contraction with Lipschitz constant $L \lt 1$, Banach's fixed-point theorem guarantees a unique self-consistent identification and the circularity is benign, in the same sense that ordinary instrument calibration is benign.

   from Abstract

2. This is the regime of ordinary instrument calibration, and it is formally a contraction fixed-point iteration.

   from 1. Introduction

3. Ontology matching—the problem of finding correspondences between entities in different ontologies so that they can be aligned or merged—is addressed by [3], which presents GraphMatcher, an ontology matching system using a graph attention approach.

   from 2. Background and Related Work

4. Calibration is the search for a self-consistent datum $x^{*} \in \mathcal{D}$ satisfying $$x^{*} = \Gamma\big(\Phi(x^{*})\big),$$ where $\Gamma : \mathcal{O} \to \mathcal{D}$ is the realization map : given an identification, it produces the operational data that the identified system would generate under the calibrated protocol.

   from 3.1 Operational ontology maps

What would falsify it

1. We conclude that uniqueness is a property of the calibration dynamics, not of the qubit, and state falsifiable conditions for both outcomes.

   from Abstract

2. Section 6 discusses limitations and what would falsify each claim.

   from 1. Introduction

3. The methodological stance—falsifiability as a pledge rather than a slogan—is adopted from [11]: every quantitative claim below is either derived with shown arithmetic or explicitly labeled a projection with stated assumptions.

   from 1. Introduction

Where the claim stops

1. The shot-budget result (R4) assumes the discriminating observable is readout-accessible with the fidelity of [4] and that the only noise is readout noise; additional decoherence during the discriminating sequence would inflate $N$ beyond the computed values.

   from 6. Discussion

2. The dimension count behind R6 assumes perfect equivariance; any real platform has stray asymmetries (bias fields, crosstalk) that partially break $SO(3)$, and Derivation 4.5 quantifies the sensitivity only under the assumed shot counts and an idealized noise model—independent, stationary shots.

   from 6. Discussion

3. The framework fails if calibration maps are chaotic rather than contractive—then no fixed point exists and "the qubit" has no self-consistent definition at all, a stronger conclusion than we claim.

   from 6. Discussion

Where to read

1. Abstract228 words · 1 min
2. 1. Introduction410 words · 2 min
3. 2. Background and Related Work798 words · 3 min
4. 3. Methods547 words · 2 min
5. 4. Analysis987 words · 4 min
6. 5. Results478 words · 2 min
7. 6. Discussion433 words · 2 min
8. 7. Conclusion279 words · 1 min
9. Appendix A. Divergence report101 words · 1 min
10. Appendix B. Claim attribution234 words · 1 min