A Hard Worst-Case Floor for All-Parameter Recoverability in Three-Qubit Coherent-Noise Fingerprinting

Supplementary note to arXiv:2611.08310 and arXiv:2610.19779. A fingerprint of coherent noise built from a stabilizer code is only as informative as the recovery gates that produce it, and every fixed choice of those gates is blind somewhere. This note isolates what can nevertheless be guaranteed, and states it as a worst-case floor rather than an average improvement. Two elementary facts about Fisher information make the guarantee exact. Because information matrices add, the identifiable set of a collection of designs is the union of theirs, so running several designs in parallel can never cost a direction that any member sees. Because the inverse of a sum is Loewner-dominated by the inverse of any summand, splitting a fixed shot budget over S designs can never cost more than sqrt(S) in standard deviation, that is, S in shots. The premium is therefore fixed in advance and independent of the working point, while the gain is not. Both statements are certified over the 64-design space of the three-qubit repetition code, under the 48- and 112-component fingerprints: the Loewner inequality is evaluated rather than assumed at every point tested, the worst case over 300 working points is 1.25 against the certified sqrt(2) = 1.4142, the bound is attained to five figures at one structured point, and at the worst points of the individual designs the parallel pair sits below the better single design by factors of 2.6 to 9.5 under the 48-component fingerprint and 4.3 to 17 under the 112-component one. Two three-gate placements suffice; a third adds 3.5 to 11.5 per cent. The floor buys recoverability and worst-case precision, and it buys nothing else: it does not buy accuracy under common-mode calibration bias, and it does not repair a model degeneracy that no design can see. Converting the floor into a shot count: at a unit per-component error the pair brings the worst parameter to a 10 mrad target in a median of 7.5e4 shots under the 112-component fingerprint and 5.5e5 under the 48-component one, with 95th percentiles of 4.6e5 and 2.9e6. These are sample statistics and are labelled as such, because the parameter box contains a degenerate locus at which all 64 designs fall to rank 5: no design has a finite worst-case count over the whole box. A directed search from the worst sampled point raises the sample maximum by factors of 4.7e3 and 1.1e4 while leaving all three Jacobians at full rank, which is the honest size of that tail; over the whole domain the only statement that survives is the sqrt(2) inequality itself. Contents: the two propositions with proofs, the cost corollary, the numerical certification (six tables, one figure), the relation to the two companion papers, and a reproduction map. The archive repro_v1.0.zip in this record contains the eight scripts, five data files, the figure and a self-test that re-derives every quoted number; run python scripts/selftest.py from the archive root and compare against MANIFEST.sha256. Companion papers: arXiv:2611.08310 (recovery gates as a resource) and arXiv:2610.19779 (coherent-noise identifiability).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24241028
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Hard Worst-Case Floor for All-Parameter Recoverability in Three-Qubit Coherent-Noise Fingerprinting

Long Huang
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

A Hard Worst-Case Floor for All-Parameter Recoverability in Three-Qubit Coherent-Noise Fingerprinting

Long Huang
article en

Abstract

Supplementary note to arXiv:2611.08310 and arXiv:2610.19779. A fingerprint of coherent noise built from a stabilizer code is only as informative as the recovery gates that produce it, and every fixed choice of those gates is blind somewhere. This note isolates what can nevertheless be guaranteed, and states it as a worst-case floor rather than an average improvement. Two elementary facts about Fisher information make the guarantee exact. Because information matrices add, the identifiable set of a collection of designs is the union of theirs, so running several designs in parallel can never cost a direction that any member sees. Because the inverse of a sum is Loewner-dominated by the inverse of any summand, splitting a fixed shot budget over S designs can never cost more than sqrt(S) in standard deviation, that is, S in shots. The premium is therefore fixed in advance and independent of the working point, while the gain is not. Both statements are certified over the 64-design space of the three-qubit repetition code, under the 48- and 112-component fingerprints: the Loewner inequality is evaluated rather than assumed at every point tested, the worst case over 300 working points is 1.25 against the certified sqrt(2) = 1.4142, the bound is attained to five figures at one structured point, and at the worst points of the individual designs the parallel pair sits below the better single design by factors of 2.6 to 9.5 under the 48-component fingerprint and 4.3 to 17 under the 112-component one. Two three-gate placements suffice; a third adds 3.5 to 11.5 per cent. The floor buys recoverability and worst-case precision, and it buys nothing else: it does not buy accuracy under common-mode calibration bias, and it does not repair a model degeneracy that no design can see. Converting the floor into a shot count: at a unit per-component error the pair brings the worst parameter to a 10 mrad target in a median of 7.5e4 shots under the 112-component fingerprint and 5.5e5 under the 48-component one, with 95th percentiles of 4.6e5 and 2.9e6. These are sample statistics and are labelled as such, because the parameter box contains a degenerate locus at which all 64 designs fall to rank 5: no design has a finite worst-case count over the whole box. A directed search from the worst sampled point raises the sample maximum by factors of 4.7e3 and 1.1e4 while leaving all three Jacobians at full rank, which is the honest size of that tail; over the whole domain the only statement that survives is the sqrt(2) inequality itself. Contents: the two propositions with proofs, the cost corollary, the numerical certification (six tables, one figure), the relation to the two companion papers, and a reproduction map. The archive repro_v1.0.zip in this record contains the eight scripts, five data files, the figure and a self-test that re-derives every quoted number; run python scripts/selftest.py from the archive root and compare against MANIFEST.sha256. Companion papers: arXiv:2611.08310 (recovery gates as a resource) and arXiv:2610.19779 (coherent-noise identifiability).

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon