Technical Companion: Detector Interfaces and Retained Outputs
Symmetric-family calibration with explicit confidence and drift
Symmetric-family calibration with explicit confidence and drift
Source, trusted assays and all nulls
Use = span
vac
. The qubit marginal block is
, with
Searchable transcription
ρ = (I + tX + vY + uZ)/2, u2 + t2 + v2 ≤1, p = (1 + u)/2.
For hypothesis, apply the stipulated qubit
phase flip to the
= + preparation, reversing the transverse components. The source/controller relation is an assumption. Its hidden true label is not available to the classifier. Sequential use must also obey its declared conditional-state conditions; calibration does not establish them. Vacuum/qubit coherence may exist, since dark-free label effects annihilate vacuum and hence do not see that coherence. Predetermine
calibration trials using independently prepared copies of one stationary source marginal. A common trusted calibrator has the same state-independent efficiency
both settings and known contrast 0
Searchable transcription
Z : E0 = ηc|0⟩⟨0|, E1 = ηc|1⟩⟨1|, (36) X : E± = ηc(Pq ± γX)/2, E∅= I −ηcPq. (37)
Searchable transcription
Every null is counted and retained. The positive square roots with a neutral pointer give the finite isometry V = P j pEj ⊗|j⟩, retaining output source and any inert reference. For degenerate modes a balanced rotation and a complete basis absorber realize γ = 1; known unsharpness permits other values. Nondegenerate energy modes require the phase-reference stock from the finite-reference model. No calibration phase resource is free. A hit has probability wηc, independent of setting. Its conditional Bernoulli parameters are p and q = (1 + γt)/2. This conditioning is justified by independent preparations and state-independent loss, not by a reset wave. Let nZ, nX be hit counts and KZ, KX the true counts of label 0, +. An adversary may change at most kZ, kX accepted labels, even after seeing all data, producing f KZ, f KX. Nulls cannot be forged, suppressed or selected. This is robustness of the nominated reported-count readout; no optimum over hidden corruption-controller records is asserted.
One global finite confidence event
For binomial count in
trials, let [
)] be the two-sided Clopper–Pearson interval of failure at most
. In the interior,
Searchable transcription
Lβ = B−1(β/2; k, n −k + 1), Uβ = B−1(1 −β/2; k + 1, n −k).
Use) = 1, and [0
= 0. Define the corruption envelope
Searchable transcription
Cβ(f K, n, kf) = [Lβ((f K −kf)+, n), Uβ(min(n, f K + kf), n)]. (38)
Allocate source failure, set
3, and take
Searchable transcription
Ip = Cβ(f KZ, nZ, kZ), Iq = Cβ(f KX, nX, kX), It = [(2IL q −1)/γ, (2IU q −1)/γ] ∩[−1, 1].
Searchable transcription
Let Iω be the ordinary CP interval for total hits nZ + nX in NZ + NX trials. For trusted ηc ∈[ηL, ηU], use Iw = [IL ω /ηU, IU ω /ηL] ∩[0, 1],
with upper endpoint one when = 0. Then
Searchable transcription
GS = {p0 ∈Ip, t0 ∈It, w0 ∈Iw},
Pr(GS) ≥1 −αS.
(39)A statistical efficiency calibration requires its own allocated failure.
Searchable transcription
Proof. Conditional on a hit count the true label count is binomial; CP coverage remains valid after averaging over that random count. Monotonic endpoints and |K −f K| ≤kf make the envelope contain the true count’s interval on every corrupted transcript. Total hits are binomial with parameter w0ηc. A union bound proves coverage; independence of the three intervals is unnecessary. CP coverage itself follows by binomial-tail inversion, each excluded tail having probability at most β/2. Thus this is finite-sample coverage for each fixed underlying state, not a posterior probability on a parameter. □ Hits alone identify wηc, not its factors. Without efficiency information the safe bound w ≥IL ω still follows from ηc ≤1. One event constrains the source for every reader, allowing subsequent reader or sign-orientation choice without another source-confidence penalty. A transverse interval straddling zero does not become a positive-direction certificate merely by clipping its lower endpoint.
Exact source-class minimax certificate
For every future actual conditional input, given the preceding record, assume
Searchable transcription
|p −p0| ≤dp, t ≥t0 −dt, w ≥w0 −dw.
Searchable transcription
Inputs may otherwise be adversarial and correlated through history. These are future admission conditions, not consequences of finite calibration. Trace-distance qubit drift at most δ suffices for dp = δ, dt = 2δ, but the componentwise class below may be larger. On GS, enlarge the population interval to I′ p, put l = IL t −dt ≥0, wL = (IL w −dw)+, and define
Searchable transcription
I = [2(I′ p)L −1, 2(I′ p)U −1] ∩[−R, R], R = p 1 −l2. (40)
If 0 this positive-direction theorem is not used; an empty set means model/confidence inconsistency, not a vacuous certificate. Use the real symmetric reader
Searchable transcription
x ±z ±z y ! , E∅= I −diag(x, y), 0 ≤x, y ≤1, 0 ≤z ≤√xy. (41) E± = 1 2
The reader acts as null on vacuum. Its transverse axis can differ from the calibration axis by any ∆
2. Only differential phase matters; global phase convention is irrelevant. The actual coefficients must be known or calibrated. Set
2, with
C2: sharp error and success. For cos ∆
= sin ∆,
Searchable transcription
1 −z min u∈I a −b √ R2 −u2 " # ε∗= 1 , (42) 2 d + eu
Searchable transcription
Q∗= wL min u∈I (d + eu). (43)
These are the exact worst conditional error and guaranteed unconditional conclusive probability over the stated physical source/drift/axis class. The conditional-error statement applies only to members with positive conclusive probability. In particular,= 0 supplies no positive-rate guarantee and assigns no value to a 0
0 conditional error. They hold for every inert-reference extension, as statements about marginal labels, not full output-state equality.
Proof. At fixed, Bloch positivity gives
. The smallest reader component is
Searchable transcription
Xmin(u) = l cos ∆− p 1 −u2 −l2 sin ∆.
Choose the adverse sign of, saturate its allowed magnitude, and take
= ∆: the expression increases in
0 and decreases in
2. A pure state attains it. For either hypothesis the exact error is [1
2; minimizing over
proves the first claim. Conclusive probability is
minimized by
and an endpoint. References do not change these marginals.
The finite minimization evaluates endpoints and the admissible interior roots of
Searchable transcription
R2 −u2. (44) b(du + eR2) = ea p
Searchable transcription
Squaring gives (b2d2 + e2a2)u2 + 2b2deR2u + b2e2R4 −e2a2R2 = 0. (45)
Searchable transcription
Keep the original sign/equality check to reject extraneous roots. This follows by differentiating the ratio. Cases b = 0 or R = 0 reduce directly. Endpoint-only checking fails, for example, at I = [−0.8, 0.8], l = 0.6, ∆= 0.3, (x, y, z) = (0.9, 0.3, √
): the worst point is
3685962371, error
Searchable transcription
C3: sharper coherence interface. Let u∗be the point of I closest to zero, rmax = p
. For
0, define
. The exact source-only combined visibility/phase lower bound is
Searchable transcription
mcal = q cos ∆− q 1 −q2 sin ∆. (46)
Searchable transcription
1 −u2, hence is minimized at u∗, proving the claim. Supply this directly to the robust frontier; it already includes differential phase and must not be multiplied by another cosine. An independent p, m box is valid but can be looser than Eq. (43), which retains their correlation. If rmax = 0, the admitted states have zero transverse coherence; their conditional error is 1/2 for every positive conclusive output. Use C2 directly and do not divide by rmax. The positive-contrast robust frontier uses this interface only when mcal ≥0. If it is negative, use the general admissible-error certificate C2 or another appropriately enlarged problem; do not insert it into a theorem assuming nonnegative contrast. At ∆= 0, direct calibration gives m ≥q. Separately inferring visibility at least q and phase cosine at least q, then multiplying, gives only q2. Those extrema occur at different states: visibility q with zero phase, or unit visibility with phase arccos q. Keeping the measured product removes this unnecessary loss. No source Y assay is needed for this objective: the unmeasured component is retained adversarially within the physical Bloch disk. Divide Xmin(u) by √ 1 −u2. The result increases with l/ √
Actual-reader probes and a measured phase-axis bound
A held uncertain loss rate may alter a tuned amplitude ratio, so a worst scalar transfer factor is not an actual-effect certificate. Instead freeze the source-data-selected pulse, then calibrate
Searchable transcription
x ±c ±c∗ y ! , |c|2 ≤xy. (47) E± = 1 2
Searchable transcription
This structural family follows from the actual two-tap model: a balanced flag matrix times diag(a0, a1) gives x = |a0|2, y = |a1|2, c = a∗ 0a1. Input-independent mixtures preserve it by Cauchy–Schwarz. Unknown path loss and phase change the coefficients but preserve the family. This is a physical-model admission; finite probes cannot prove exact symmetry or dark-free behavior for an unrestricted device. Use independent identically prepared copies within each trusted-probe batch |0⟩, |1⟩, |+⟩, | + i⟩, with a fixed input-independent reader preparation and stationary pointer probabilities during calibration. Every plus, minus and null is counted:
Searchable transcription
x = Pcon|0, y = Pcon|1, Re c = P+| + −P−|+, Im c = P−| + i −P+| + i.
Searchable transcription
The fourth probe prevents an imaginary-offdiagonal blind spot. Six marginal CP intervals, with failures summing to αD, give Ix, Iy, Ir, Ii. Corruption envelopes apply to bounded accepted-label errors. For probe preparation trace error δprep, widen each event interval by δprep, since effects are trace-distance contractive. That probe-preparation accuracy is independently trusted. If IL r > 0, infer
Searchable transcription
(IL r )2 + dist(0, Ii)2, ∆D = arctan max(|IL i |, |IU i |) IL r . zL = q
Future hardware allowances widen, lower
, and add to ∆
. They must bound actual conditional instruments, not merely averaged dynamics. The global event is
Searchable transcription
G = GS ∩GD, Pr(G) ≥1 −α, α = αS + αD. (48)
Device coverage is conditional on the preceding source-based choice. Accepting or rejecting the frozen pulse afterward is allowed. Retuning requires fresh calibration or simultaneous catalogue coverage; source-confidence uniformity does not calibrate every hardware setting. When all admitted source reader components are nonnegative, use for a valid device-box error certificate. It is sharp for that outer Cartesian coefficient class when the corner is physical. Use
for a safe success lower bound, which need not be attained: positivity or raw-data correlations may exclude that lower corner. No joint optimum over the original multinomial confidence region is claimed. If the source component can be negative, this monotone device-box rule is not used. Effects certify nominated labels on arbitrary inert-reference inputs; they do not identify the retained field, recoil, controller or bath. The complete operational construction still supplies those maps. Their agreement cannot be inferred from count calibration.