Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Probing Coherent Noise with Stabilizer Codes: Identifiability, Ambiguity, and Decoder Priors

Long Huang

Published Nov 3, 2026• 0 citations
Publisher

Abstract

This Zenodo record is the Supplemental Material for the manuscript "Probing Coherent Noise with Stabilizer Codes: Identifiability, Ambiguity, and Decoder Priors" (Long Huang, Sichuan Normal University). It is the operating manual for the probe on a target device: the device and gate parameters the protocol is written for, the seven stabilizer-code channels with their prepare–encode–expose–decode–recover–tomograph sequence, the twelve tomography settings per channel, readout correction and null-channel deconvolution of state-preparation-and-measurement error, the interleaved acquisition schedule and its drift tolerance, the shot budget together with the saturation point set by a non-unitary component, and the acceptance criteria for a session.This record describes the protocol and the hardware parameters it assumes; no experimental data enter it or the manuscript. The model-space scan and the non-unitary error budget are Appendices F and G of the main article. The scripts and tabulated data behind them, and behind Figs. 1–3 and Tables I–IX of the manuscript, are archived separately under DOI 10.5281/zenodo.23794746 (concept DOI 10.5281/zenodo.23794180, which always resolves to the newest version). Popular_Summary.pdf is a non-technical summary of the same work.

DOI
10.5281/zenodo.23914166

Related papers

Experimental supplement: three-qubit, three-gate repetition-code noise tomography

Long Huang

Experimental supplement to arXiv:2611.08310, a companion manuscript on gate-optimal recovery designs (2026). This supplement specifies a concrete experiment for measuring the eleven-parameter small-angle coherent noise of a three-qubit register with three single-qubit Pauli gates, using a distance-three repetition code in both orientations. It gives the branch structure, the syndrome-to-Pauli look-up table for the three-gate design, the fixed sixteen-setting measurement table, shot and wall-clock budgets for three platform classes, a calibration and systematics checklist, an analysis pipeline, and a symptom-to-cause table. Two sections price the alternatives: a fixed recovery that does not resolve the syndrome saves a factor three in circuits and loses a factor five in precision floor, and a coherent unitary recovery keeps the circuit saving but replaces each single-qubit Pauli by a multi-controlled gate that every branch must compile. At three qubits no design in the scanned budget loses rank, so identifiability does not separate the gate counts; what depends on the working point is which three gates to use, not how many. The organising point is that the recovery gate count is a resource: three gates attain the lowest precision floor, the standard six-gate decoder is 22 times worse at a small-angle operating point and 2.3 times worse at the well-conditioned point of arXiv:2610.19779, and the ordering is stable over forty sampled working points while the size of the factor is not. The ordering survives when the look-up is compiled rather than measured, and the margin then widens from 5.6 to 7.7 in wall clock, because a compiled table charges every entry in every branch. A section added in version 1.5 asks whether that answer depends on the platform. A second device archetype -- a tunable coupler or iSWAP-style gate, whose always-on term is the exchange J(XX+YY)/2 -- carries one more parameter per bond, thirteen in all, and the two clusters are not nested: XX and YY commute, and ZZ is orthogonal to their plane. Enumerating all 64 design pairs at n=3 and all 3969 at n=5 gives the same gate budget for both archetypes, zero gates to reach full rank at n=3 and one at n=5; that count is a lower bound on the budget, not a recommended design, since the precision optimum is the three gates of the main text, where zero gates is 18 times worse at the median and 379 times worse at the certified point. At matched per-layer coherent infidelity the thirteen-parameter cluster is not worse (101.0 against 88.9 mrad on the local angles at 10^5 shots), and at the three-gate optimum the comparison widens (41.7 against 32.2 mrad). Choosing the wrong cluster is a bias, not a variance: the correct family leaves a residual of exactly zero, the wrong one leaves 0.4-0.6% in the fingerprint and moves the nine local angles by a quarter to a half, while its Cramer-Rao bound looks better. The decoded logical error cannot arbitrate at that bias level -- 200 random perturbations of the same total variation spread it over a factor 43 -- so the model family must be chosen by the residual. The same section closes with a composition law: a per-gate composition of Pauli probabilities is elementwise in the Walsh eigenvalues and therefore under-counts the coherent part of the depth-L noise by exactly L (measured slopes 1.98 for the generator against 0.99 for the per-gate rule). A closing section fixes the size of the gain and asks how far it extends. An exact prior removes 19.3% of the logical error at d=3, which is 4.3e-5 errors per code cycle; a three-gate fit captures 83, 96.5 and 99.5% of that share on the three platform classes. That share, not the accuracy of the estimate, is where every prior-based protocol stops, because 94% of the residual is weight-two aliasing. It is not a limit set by using Pauli probabilities: the same prior decodes both the coherent channel and its twirled version, so the drop from 19.3% to 11.6% under twirling prices the device rather than the estimate, and composing per-gate twirls changes at most two of the 256 decoder decisions. A generator rather than a channel is what additionally allows the coherent part to be inverted and the prior to be extrapolated to unmeasured working points. Carrying the same three-qubit fit to d=5 or d=7 obeys a closed form, G_d = G_3^((d+1)/4), so no extra precision is needed at larger distance: a 6.4 mrad rms on the eleven parameters moves the d=7 gain by 8.5%. What does not transport is the truncated part of the model---the 2(d-1)^2 three-body positions a d x d patch adds, none of which a chain fit covers---which costs 5% of the gain at d=5 and 10% at d=7; site-to-site spread costs another 3%. The law itself is a property of the decoder and applies to any prior, so this is a bound on what a three-qubit run can claim, not an advantage over Pauli-statistics protocols. Measuring at the target size instead of transporting avoids the truncation count but pays conditioning: a factor 68 from three to seven qubits. All numbers are model-level: no device data are reported, and the floors assume a calibration residual of 1e-3. Contents (v1.5): 1 What the experiment measures · 2 The three branches · 3 Syndrome decoding · 4 Settings and shot arithmetic · 5 Budget on three platforms · 6 Why the syndromes must be resolved · 7 What does and does not depend on the gate count · 8 Does the platform change the answer? · 9 How large the gain is, and how far it extends · 10 Calibration and systematics · 11 Analysis pipeline · 12 Diagnostics · 13 Checklist.

•Nov 6, 2026•3 citations

Probing Coherent Noise with Stabilizer Codes: Identifiability, Ambiguity, and Decoder Priors

Long Huang

Coherent noise calls for a reusable physical model, but Pauli twirling erases it and full process tomography scales exponentially. We turn measurement-free quantum error correction into a probe: bit-flip and phase-flip codes polarize few-qubit coherent noise into single-logical-qubit channels, and the resulting fingerprint identifies an 11-parameter three-qubit family. An exact rational-arithmetic rank certificate, evaluated at a rational point in the interior of the parameter domain, proves local injectivity on a dense open subset of that domain. The map is nevertheless not globally injective: a compensating rotation combined with a site exchange yields exact collisions, which we classify and then remove by adding one two-qubit marginal channel. The site exchange is the only nontrivial permutation symmetry of the $n$-qubit chain generator at any $n$, so the classification is structural rather than a three-qubit accident. A Cramér--Rao analysis, checked at the level of individual measurement settings, reaches $0.01$~rad per parameter at a representative point, and decoder priors rebuilt from such an estimate retain most of their correlation gain. Propagating the generator into a distance-three surface code gives a $14.8$-fold encoding gain when the generator is known exactly, and $1.21$-fold of the correlation gain survives when the prior is rebuilt from an estimate at the stated precision, closing the loop from characterization to decoding.

quant-pharXiv:2610.19779•Oct 15, 2026•4 citations

Experimental Realization of the Klein Bottle Stabilizer Code on a Superconducting Processor

Leonardo Roma

Comprehensive experimental account of non-orientable stabilizer codes on superconducting quantum hardware. This work consolidates and extends a five-paper series on the Klein bottle stabilizer code, and reports the first experimental realisation of the real projective plane (RP²) stabilizer code. Key results: Klein bottle code confirmed at distances d=2,3,4 with a working MWPM decoder (antipodal shortcut, 6/6 hardware validation at Z=688–730σ); transversal Clifford group with O(1) gate overhead; 12 logical qubits on 156 physical qubits at CV=0.01; δ-family confirmed at d=2,3,4. RP² 4×4 code: both boundary twists confirmed simultaneously (266–571σ, zero noise bits in dominant), logical qubit verified with Z_L contrast 0.885, GSD=2 confirmed. Transversal T^⊗32 ruled out analytically; code deformation identified as the open problem. Raw syndrome count data for all experiments available at https://github.com/theoricline/klein-bottle-qec/data Paper 1: Code existence, GSD=4, kill test Z=691σ https://doi.org/10.5281/zenodo.19284050 Paper 2: δ-family, topological parameter encoding https://doi.org/10.5281/zenodo.19286677 Paper 3: Non-orientable logical algebra, holonomy https://doi.org/10.5281/zenodo.19287977 Paper 4: Six Simultaneous Non-Orientable Stabilizer Codes https://doi.org/10.5281/zenodo.19333513 Paper 5: MWPM Decoder for a Non-Orientable Stabilizer Code https://doi.org/10.5281/zenodo.19451825

•Apr 7, 2026•0 citations

Noise redistribution by stabilizer codes: an organizing view of concatenated three-qubit codes

Long Huang

We formulate stabilizer-code error correction as a code- and recovery-dependent transformation of the noise channel. For a fixed recovery map, syndrome projection produces a block-diagonal logical channel whose diagonal Pauli weights follow from code-induced error classes, with no physical Pauli twirl; concatenation is then iterated redistribution, with the dominant logical error guiding the next code. The bit-flip and phase-flip three-qubit codes with standard recoveries supply a closed-form benchmark, and logically inequivalent recoveries appear as a design degree of freedom for shaping the channel presented to the next decoder. For amplitude damping, the three-qubit rules select $C_2(\hatσ_y)C_1(\hatσ_x)$ and give $f_l=1-\mathcal O(γ^2)$, with an ideal-gate crossover at $γ_c\approx0.30$ ($f=1-1.72755γ^2$) and a favorable gate-count comparison with the five-qubit code under the same assumptions. Correlated noise requires joint class statistics, whereas coherent noise retains intra-class coherences that make the same transformation usable in reverse as a tomographic fingerprint; there the companion work proves local identifiability from a rank certificate evaluated inside the parameter domain, classifies the sole permutation-symmetry ambiguity as structural at any chain length, and closes it with one two-qubit marginal channel. The construction remains an analytic benchmark, not a universal prescription for an inner code beneath a surface code.

quant-pharXiv:2610.31007•Oct 23, 2026•1 citation

BKT-43A Formalization of Relational Closure and Non-Closure Estimators for Quantum-State Stability

Robert Kupski

This record provides the bilingual publication package of document BKT-43A/USC-RA1/ZENODO-20260707-v13, entitled “Formalization of Relational Closure and Non-Closure Estimators for Quantum-State Stability”, with the subtitle “A New Class of Mathematical-Physical Tools for Studying and Diagnosing the Stability of Quantum Systems.” The work presents a family of relational closure and non-closure estimators as a coherent mathematical-physical apparatus for diagnosing the stability of quantum states. The core formalism includes a sectoral closure estimator, an attractor-topological-spectral extension, a logarithmic multichannel aggregator, a covariance-aware variant, a geometric estimator based on the Bures distance, and a differential-dynamical layer. The article includes a canonical tabular compendium of the formulas, parameters, formal meaning, and physical interpretation of the estimators. The model-computational verification is based on Bell-state dephasing, the Bures channel, quantum Fisher information, Lindblad dynamics, a finite Kitaev-chain test, and the analysis of quantum-error correlations. The results have formal and computational status: they confirm the internal consistency of the definitions, agreement with analytic results of the reference model, and correct treatment of channel redundancy by the covariance-aware estimator. They do not yet constitute external experimental validation. This record continues earlier models and published formal materials. In particular, it develops the sectoral (\delta_{\rm eff}) and (\delta_{\rm eff,ATS}) model from BKT-Y16-20260622-v10.2, extends the three-level relational non-closure estimator apparatus from BKT-43 USC-RA1 20260619 v1.3, and organizes earlier Zenodo records related to the (K^{\log}_{QM}) estimator, relational geometry, and response tomography: 10.5281/zenodo.19893953, 10.5281/zenodo.20798037, 10.5281/zenodo.20797198, and 10.5281/zenodo.19824700. The response-tomography record is used as methodological context, not as validation evidence for the quantum calculations presented in the present article. The package contains the Polish version, the English mirror version, LaTeX source files, figures, MasterData tables, auxiliary scripts, bibliography, and editorial-technical audit reports. The purpose of the record is to provide a complete, reproducible, and citable formalization package for the estimator family before further editorial assessment and possible experimental validation.

•Jul 7, 2026•0 citations

A Differential Null Test for Informational Corrections to Gravity-Related State Reduction

Ren Maxwell Chen

This record provides the complete figure archive and figure-generation code for the manuscript: “A Differential Null Test for Informational Corrections to Gravity-Related State Reduction.” The archive contains the final manuscript and Supplemental Material figures in both PDF and PNG formats, together with a reproducible Python/Matplotlib script for regenerating the figure set. The figures support a theoretical proposal for a differential null test of informational corrections to gravity-related quantum state reduction. The manuscript develops a matched-pair visibility-residual framework in which ordinary gravitational and environmental baseline terms are cancelled, leaving a testable bound on the informational coupling parameter. The included figures are: Fig1 — main manuscript figure showing the differential null-test structure and visibility-residual logic. FigS1–FigS5 — supplementary figures supporting the branch-density construction, perturbative regime, visibility residuals, coupling bounds, and source-to-energy schematic. The code package includes: generate_prl_figures.py — Python script for regenerating the full figure set. requirements.txt — minimal package requirements. PDF and PNG output folders. SHA256 manifest for file-integrity checking. This Zenodo record is intended to support transparency, reproducibility, and independent inspection of the visual materials associated with the manuscript. The figures are synthetic/theoretical benchmark illustrations and do not represent observational detections or experimental data. Suggested citation use: cite this record when referring to the reproducible figure-generation code or archived figure files associated with the manuscript.

•May 27, 2026•0 citations
This Zenodo record is the Supplemental Material for the manuscript "Probing Coherent Noise with Stabilizer Codes: Identifiability, Ambiguity, and Decoder Priors" (Long Huang, Sichuan Normal University). It is the operating manual for the probe on a target device: the device and gate parameters the protocol is written for, the seven stabilizer-code channels with their prepare–encode–expose–decode–recover–tomograph sequence, the twelve tomography settings per channel, readout correction and null-channel deconvolution of state-preparation-and-measurement error, the interleaved acquisition schedule and its drift tolerance, the shot budget together with the saturation point set by a non-unitary component, and the acceptance criteria for a session.This record describes the protocol and the hardware parameters it assumes; no experimental data enter it or the manuscript. The model-space scan and the non-unitary error budget are Appendices F and G of the main article. The scripts and tabulated data behind them, and behind Figs. 1–3 and Tables I–IX of the manuscript, are archived separately under DOI 10.5281/zenodo.23794746 (concept DOI 10.5281/zenodo.23794180, which always resolves to the newest version). Popular_Summary.pdf is a non-technical summary of the same work.
Experimental supplement to arXiv:2611.08310, a companion manuscript on gate-optimal recovery designs (2026). This supplement specifies a concrete experiment for measuring the eleven-parameter small-angle coherent noise of a three-qubit register with three single-qubit Pauli gates, using a distance-three repetition code in both orientations. It gives the branch structure, the syndrome-to-Pauli look-up table for the three-gate design, the fixed sixteen-setting measurement table, shot and wall-clock budgets for three platform classes, a calibration and systematics checklist, an analysis pipeline, and a symptom-to-cause table. Two sections price the alternatives: a fixed recovery that does not resolve the syndrome saves a factor three in circuits and loses a factor five in precision floor, and a coherent unitary recovery keeps the circuit saving but replaces each single-qubit Pauli by a multi-controlled gate that every branch must compile. At three qubits no design in the scanned budget loses rank, so identifiability does not separate the gate counts; what depends on the working point is which three gates to use, not how many. The organising point is that the recovery gate count is a resource: three gates attain the lowest precision floor, the standard six-gate decoder is 22 times worse at a small-angle operating point and 2.3 times worse at the well-conditioned point of arXiv:2610.19779, and the ordering is stable over forty sampled working points while the size of the factor is not. The ordering survives when the look-up is compiled rather than measured, and the margin then widens from 5.6 to 7.7 in wall clock, because a compiled table charges every entry in every branch. A section added in version 1.5 asks whether that answer depends on the platform. A second device archetype -- a tunable coupler or iSWAP-style gate, whose always-on term is the exchange J(XX+YY)/2 -- carries one more parameter per bond, thirteen in all, and the two clusters are not nested: XX and YY commute, and ZZ is orthogonal to their plane. Enumerating all 64 design pairs at n=3 and all 3969 at n=5 gives the same gate budget for both archetypes, zero gates to reach full rank at n=3 and one at n=5; that count is a lower bound on the budget, not a recommended design, since the precision optimum is the three gates of the main text, where zero gates is 18 times worse at the median and 379 times worse at the certified point. At matched per-layer coherent infidelity the thirteen-parameter cluster is not worse (101.0 against 88.9 mrad on the local angles at 10^5 shots), and at the three-gate optimum the comparison widens (41.7 against 32.2 mrad). Choosing the wrong cluster is a bias, not a variance: the correct family leaves a residual of exactly zero, the wrong one leaves 0.4-0.6% in the fingerprint and moves the nine local angles by a quarter to a half, while its Cramer-Rao bound looks better. The decoded logical error cannot arbitrate at that bias level -- 200 random perturbations of the same total variation spread it over a factor 43 -- so the model family must be chosen by the residual. The same section closes with a composition law: a per-gate composition of Pauli probabilities is elementwise in the Walsh eigenvalues and therefore under-counts the coherent part of the depth-L noise by exactly L (measured slopes 1.98 for the generator against 0.99 for the per-gate rule). A closing section fixes the size of the gain and asks how far it extends. An exact prior removes 19.3% of the logical error at d=3, which is 4.3e-5 errors per code cycle; a three-gate fit captures 83, 96.5 and 99.5% of that share on the three platform classes. That share, not the accuracy of the estimate, is where every prior-based protocol stops, because 94% of the residual is weight-two aliasing. It is not a limit set by using Pauli probabilities: the same prior decodes both the coherent channel and its twirled version, so the drop from 19.3% to 11.6% under twirling prices the device rather than the estimate, and composing per-gate twirls changes at most two of the 256 decoder decisions. A generator rather than a channel is what additionally allows the coherent part to be inverted and the prior to be extrapolated to unmeasured working points. Carrying the same three-qubit fit to d=5 or d=7 obeys a closed form, G_d = G_3^((d+1)/4), so no extra precision is needed at larger distance: a 6.4 mrad rms on the eleven parameters moves the d=7 gain by 8.5%. What does not transport is the truncated part of the model---the 2(d-1)^2 three-body positions a d x d patch adds, none of which a chain fit covers---which costs 5% of the gain at d=5 and 10% at d=7; site-to-site spread costs another 3%. The law itself is a property of the decoder and applies to any prior, so this is a bound on what a three-qubit run can claim, not an advantage over Pauli-statistics protocols. Measuring at the target size instead of transporting avoids the truncation count but pays conditioning: a factor 68 from three to seven qubits. All numbers are model-level: no device data are reported, and the floors assume a calibration residual of 1e-3. Contents (v1.5): 1 What the experiment measures · 2 The three branches · 3 Syndrome decoding · 4 Settings and shot arithmetic · 5 Budget on three platforms · 6 Why the syndromes must be resolved · 7 What does and does not depend on the gate count · 8 Does the platform change the answer? · 9 How large the gain is, and how far it extends · 10 Calibration and systematics · 11 Analysis pipeline · 12 Diagnostics · 13 Checklist.
Coherent noise calls for a reusable physical model, but Pauli twirling erases it and full process tomography scales exponentially. We turn measurement-free quantum error correction into a probe: bit-flip and phase-flip codes polarize few-qubit coherent noise into single-logical-qubit channels, and the resulting fingerprint identifies an 11-parameter three-qubit family. An exact rational-arithmetic rank certificate, evaluated at a rational point in the interior of the parameter domain, proves local injectivity on a dense open subset of that domain. The map is nevertheless not globally injective: a compensating rotation combined with a site exchange yields exact collisions, which we classify and then remove by adding one two-qubit marginal channel. The site exchange is the only nontrivial permutation symmetry of the nnn-qubit chain generator at any nnn, so the classification is structural rather than a three-qubit accident. A Cramér--Rao analysis, checked at the level of individual measurement settings, reaches 0.010.010.01~rad per parameter at a representative point, and decoder priors rebuilt from such an estimate retain most of their correlation gain. Propagating the generator into a distance-three surface code gives a 14.814.814.8-fold encoding gain when the generator is known exactly, and 1.211.211.21-fold of the correlation gain survives when the prior is rebuilt from an estimate at the stated precision, closing the loop from characterization to decoding.
Comprehensive experimental account of non-orientable stabilizer codes on superconducting quantum hardware. This work consolidates and extends a five-paper series on the Klein bottle stabilizer code, and reports the first experimental realisation of the real projective plane (RP²) stabilizer code. Key results: Klein bottle code confirmed at distances d=2,3,4 with a working MWPM decoder (antipodal shortcut, 6/6 hardware validation at Z=688–730σ); transversal Clifford group with O(1) gate overhead; 12 logical qubits on 156 physical qubits at CV=0.01; δ-family confirmed at d=2,3,4. RP² 4×4 code: both boundary twists confirmed simultaneously (266–571σ, zero noise bits in dominant), logical qubit verified with Z_L contrast 0.885, GSD=2 confirmed. Transversal T^⊗32 ruled out analytically; code deformation identified as the open problem. Raw syndrome count data for all experiments available at https://github.com/theoricline/klein-bottle-qec/data Paper 1: Code existence, GSD=4, kill test Z=691σ https://doi.org/10.5281/zenodo.19284050 Paper 2: δ-family, topological parameter encoding https://doi.org/10.5281/zenodo.19286677 Paper 3: Non-orientable logical algebra, holonomy https://doi.org/10.5281/zenodo.19287977 Paper 4: Six Simultaneous Non-Orientable Stabilizer Codes https://doi.org/10.5281/zenodo.19333513 Paper 5: MWPM Decoder for a Non-Orientable Stabilizer Code https://doi.org/10.5281/zenodo.19451825
We formulate stabilizer-code error correction as a code- and recovery-dependent transformation of the noise channel. For a fixed recovery map, syndrome projection produces a block-diagonal logical channel whose diagonal Pauli weights follow from code-induced error classes, with no physical Pauli twirl; concatenation is then iterated redistribution, with the dominant logical error guiding the next code. The bit-flip and phase-flip three-qubit codes with standard recoveries supply a closed-form benchmark, and logically inequivalent recoveries appear as a design degree of freedom for shaping the channel presented to the next decoder. For amplitude damping, the three-qubit rules select C2(σ^y)C1(σ^x)C_2(\hatσ_y)C_1(\hatσ_x)C2​(σ^y​)C1​(σ^x​) and give fl=1−O(γ2)f_l=1-\mathcal O(γ^2)fl​=1−O(γ2), with an ideal-gate crossover at γc≈0.30γ_c\approx0.30γc​≈0.30 (f=1−1.72755γ2f=1-1.72755γ^2f=1−1.72755γ2) and a favorable gate-count comparison with the five-qubit code under the same assumptions. Correlated noise requires joint class statistics, whereas coherent noise retains intra-class coherences that make the same transformation usable in reverse as a tomographic fingerprint; there the companion work proves local identifiability from a rank certificate evaluated inside the parameter domain, classifies the sole permutation-symmetry ambiguity as structural at any chain length, and closes it with one two-qubit marginal channel. The construction remains an analytic benchmark, not a universal prescription for an inner code beneath a surface code.
This record provides the bilingual publication package of document BKT-43A/USC-RA1/ZENODO-20260707-v13, entitled “Formalization of Relational Closure and Non-Closure Estimators for Quantum-State Stability”, with the subtitle “A New Class of Mathematical-Physical Tools for Studying and Diagnosing the Stability of Quantum Systems.” The work presents a family of relational closure and non-closure estimators as a coherent mathematical-physical apparatus for diagnosing the stability of quantum states. The core formalism includes a sectoral closure estimator, an attractor-topological-spectral extension, a logarithmic multichannel aggregator, a covariance-aware variant, a geometric estimator based on the Bures distance, and a differential-dynamical layer. The article includes a canonical tabular compendium of the formulas, parameters, formal meaning, and physical interpretation of the estimators. The model-computational verification is based on Bell-state dephasing, the Bures channel, quantum Fisher information, Lindblad dynamics, a finite Kitaev-chain test, and the analysis of quantum-error correlations. The results have formal and computational status: they confirm the internal consistency of the definitions, agreement with analytic results of the reference model, and correct treatment of channel redundancy by the covariance-aware estimator. They do not yet constitute external experimental validation. This record continues earlier models and published formal materials. In particular, it develops the sectoral (\delta_{\rm eff}) and (\delta_{\rm eff,ATS}) model from BKT-Y16-20260622-v10.2, extends the three-level relational non-closure estimator apparatus from BKT-43 USC-RA1 20260619 v1.3, and organizes earlier Zenodo records related to the (K^{\log}_{QM}) estimator, relational geometry, and response tomography: 10.5281/zenodo.19893953, 10.5281/zenodo.20798037, 10.5281/zenodo.20797198, and 10.5281/zenodo.19824700. The response-tomography record is used as methodological context, not as validation evidence for the quantum calculations presented in the present article. The package contains the Polish version, the English mirror version, LaTeX source files, figures, MasterData tables, auxiliary scripts, bibliography, and editorial-technical audit reports. The purpose of the record is to provide a complete, reproducible, and citable formalization package for the estimator family before further editorial assessment and possible experimental validation.
This record provides the complete figure archive and figure-generation code for the manuscript: “A Differential Null Test for Informational Corrections to Gravity-Related State Reduction.” The archive contains the final manuscript and Supplemental Material figures in both PDF and PNG formats, together with a reproducible Python/Matplotlib script for regenerating the figure set. The figures support a theoretical proposal for a differential null test of informational corrections to gravity-related quantum state reduction. The manuscript develops a matched-pair visibility-residual framework in which ordinary gravitational and environmental baseline terms are cancelled, leaving a testable bound on the informational coupling parameter. The included figures are: Fig1 — main manuscript figure showing the differential null-test structure and visibility-residual logic. FigS1–FigS5 — supplementary figures supporting the branch-density construction, perturbative regime, visibility residuals, coupling bounds, and source-to-energy schematic. The code package includes: generate_prl_figures.py — Python script for regenerating the full figure set. requirements.txt — minimal package requirements. PDF and PNG output folders. SHA256 manifest for file-integrity checking. This Zenodo record is intended to support transparency, reproducibility, and independent inspection of the visual materials associated with the manuscript. The figures are synthetic/theoretical benchmark illustrations and do not represent observational detections or experimental data. Suggested citation use: cite this record when referring to the reproducible figure-generation code or archived figure files associated with the manuscript.