Quantum executions sharing a provenance record can produce different output distributions. We ask which execution details to retain, and at what precision, to guarantee agreement within a declared Hellinger tolerance. Under a specified channel model, we combine independent stochastic mechanisms and coherent rotation differences to certify recording precision without output simulation or explicit dependence on register dimension. For four-qubit quantum approximate optimization at depth one, a 13-bit comparison record suffices at tolerance 0.05 over a declared continuous noise range, uniformly in programmed angles for each fixed task. Pairwise separation constraints characterize sufficient field sets on finite context classes, exposing omissions that pass individually but fail jointly. Separately, six-qubit hardware measurements over six tested contexts certify minimum label counts of two for raw outputs and one after a fixed decoder, at tolerance 0.15 with 97\% simultaneous confidence under stationary independent shots. Execution records thereby carry checkable agreement guarantees.
AI Summary
The paper asks which execution-context fields, and what numerical precision, must be recorded so that executions sharing a record have output distributions within Hellinger tolerance $\varepsilon$. It defines sufficiency through the maximum within-record distributional diameter, distinguishing agreement between implementations from accuracy relative to an ideal target.
For executions with common circuit structure, independent stochastic channel mixtures and differing Pauli rotations, it derives $H^2\leq1-a_{\rm st}\cos(\min\{D,\pi/2\})$, where $a_{\rm st}$ is the product affinity of the stochastic branch probabilities and $D=\frac12\sum_j|\Delta\alpha_j|$. The proof uses flagged mixtures, fidelity monotonicity and Bures-angle accumulation. This supplies continuous recording-bin certificates without output simulation or explicit register-dimension dependence. For four-qubit QAOA-1 over specified noise ranges, 13 comparison bits certify $\varepsilon=0.05$, uniformly over common programmed angles.
On finite context classes, sufficient named-field sets are characterized by hitting all tolerance-violating pairs. Density-matrix simulations demonstrate that individually acceptable omissions can fail jointly: omitting routing or angle bias gives discrepancies $0.0417$ and $0.0497$, but omitting both gives $0.0514$. A separate six-qubit hardware study, with six contexts and 32,768 shots each, certifies minimum label counts of two for raw outputs and one after a fixed decoder, at tolerance $0.15$ with 97% simultaneous confidence.
Guarantees are conditional on declared contexts and models; unmodelled mechanisms or drift can invalidate them. Hardware confidence assumes stationary independent shots and does not validate the analytic channel model. Bit counts exclude shared task definitions, dictionaries and evidential archives.
Little sign of AI-generated textIncrementalStrong assumptions
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
v3: Revised abstract and introduction; clarified relation to prior work; added references. Scientific results unchanged
Quantum executions sharing a provenance record can produce different output distributions. We ask which execution details to retain, and at what precision, to guarantee agreement within a declared Hellinger tolerance. Under a specified channel model, we combine independent stochastic mechanisms and coherent rotation differences to certify recording precision without output simulation or explicit dependence on register dimension. For four-qubit quantum approximate optimization at depth one, a 13-bit comparison record suffices at tolerance 0.05 over a declared continuous noise range, uniformly in programmed angles for each fixed task. Pairwise separation constraints characterize sufficient field sets on finite context classes, exposing omissions that pass individually but fail jointly. Separately, six-qubit hardware measurements over six tested contexts certify minimum label counts of two for raw outputs and one after a fixed decoder, at tolerance 0.15 with 97% simultaneous confidence under stationary independent shots. Execution records thereby carry checkable agreement guarantees.
The paper asks which execution-context fields, and what numerical precision, must be recorded so that executions sharing a record have output distributions within Hellinger tolerance ε. It defines sufficiency through the maximum within-record distributional diameter, distinguishing agreement between implementations from accuracy relative to an ideal target.
For executions with common circuit structure, independent stochastic channel mixtures and differing Pauli rotations, it derives H2≤1−astcos(min{D,π/2}), where ast is the product affinity of the stochastic branch probabilities and D=21∑j∣Δαj∣. The proof uses flagged mixtures, fidelity monotonicity and Bures-angle accumulation. This supplies continuous recording-bin certificates without output simulation or explicit register-dimension dependence. For four-qubit QAOA-1 over specified noise ranges, 13 comparison bits certify ε=0.05, uniformly over common programmed angles.
On finite context classes, sufficient named-field sets are characterized by hitting all tolerance-violating pairs. Density-matrix simulations demonstrate that individually acceptable omissions can fail jointly: omitting routing or angle bias gives discrepancies 0.0417 and 0.0497, but omitting both gives 0.0514. A separate six-qubit hardware study, with six contexts and 32,768 shots each, certifies minimum label counts of two for raw outputs and one after a fixed decoder, at tolerance 0.15 with 97% simultaneous confidence.
Guarantees are conditional on declared contexts and models; unmodelled mechanisms or drift can invalidate them. Hardware confidence assumes stationary independent shots and does not validate the analytic channel model. Bit counts exclude shared task definitions, dictionaries and evidential archives.
Which properties of a quantum state are determined by two global observables and the outcomes of specified measurement sequences? On a calibrated four-level system, the marked observables determine two complementary qubit factor algebras without prior local qubit labels. For each measurement protocol, the paper asks how much entanglement every state compatible with its data must possess. For a single sequential measurement, retaining the complete outcome record gives sharp lower bounds on concurrence and negativity. A second measurement can be recorded either as a parity or as four resolved outcomes. The parity record gives a rank-five measurement space with explicit attainable bounds. Retaining individual population differences within a parity class can strengthen those bounds without further measurement runs. In an explicit example, the guaranteed concurrence rises from zero to one half. The paper identifies which population difference produces that gain and when the resulting certificate is exact. Further results include an exact rank formula for pulse sampling, a four-duration minimum within the specified pulse family, and explicit states for which rank-ten and rank-fourteen protocols certify entanglement in opposite directions. The manuscript gives finite-sample and calibration bounds and distinguishes reconstruction on the assumed system from identification of a physical realisation solely from probabilities. The accompanying archive contains fifteen Python verification scripts, run logs and a SHA-256 manifest. All numerical data are synthetic.
How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.
Environmental records can be individually accurate while sharing the same errors. We show how retained coherence can quantify this conditional dependence without reconstructing the joint record distribution. For a balanced two-qubit state supported on the span of |00> and |11>, we derive the sharp compatibility boundary between a retained Clauser-Horne-Shimony-Holt (CHSH) value, the accuracy of R designated local binary records, and their conditional total correlation. The full extremum reduces to a convex problem in R+1 Hamming-weight probabilities, and every boundary value has a pure-state quantum realization using only the designated fragments. Its inverse gives the least dependence compatible with Bell data and separate record calibrations. For two records it is explicit; at fixed accuracy, a fixed positive Bell excess requires dependence growing at least linearly with record count. Independent monitoring reaches the zero-dependence boundary in a Lindblad dephasing limit. A shared-memory Lindblad process instead improves record accuracy at constant Bell value, with an exact time after which dependence becomes certifiable. The result quantifies departures from conditional independence in environmental recording, under trusted state-sector and readout assumptions. Version 1.1.0 revises the preprint previously titled "Certifying conditional dependence among environmental records from Bell measurements". It strengthens quantum attainment to a pure-state construction using only the designated fragments, clarifies the common-preparation requirement for separate measurement batches, and adds corresponding finite implementation checks. The main frontier, explicit inverse and three calculated figures are retained. The files include the manuscript, computational supplement, editable LaTeX, Python code, reference data and calculated figures. No experimental data were used. AI assistance and author declarations are in the manuscript. The revised manuscript and supplement are licensed CC BY-NC 4.0. Unchanged figures and reference data retain their earlier CC BY 4.0 licence, and code is MIT licensed. Earlier CC BY permissions remain in force. See LICENSES.txt for the file-specific terms. This is a preprint, not a peer-reviewed article.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
Quantum records may be well encoded upstream yet fail to support downstream inference when routing, decoder resources, memory, or comparison channels are restricted. We analyze finite routed quantum-record networks using task-specific Bayes risk. Three exact results provide the constructive core. First, a single Bell-coded pair supplied as the same complete input to GLOBAL and finite-round LOCC-late decoders yields the risk gap qμ/2, where q is pair-delivery probability and μ retained coherence; memory policy determines whether this access is preserved. Second, fixing local binary experiments with error rates 0.20 and 0.30, we determine the entire compatible joint-risk interval [0.15, 0.20] and an attaining decoder with minimax risk 0.20 that does not know the coupling. Third, a binary sufficient-statistic delivery law is attained by a three-record majority compression with nonzero raw risk, yielding a tight physical reconstruction defect. A generated-outcome model gives an exact receiver-availability boundary, while four reduced-description witnesses and continuity bounds delineate when source, state/resource, local-coupling, or clock/memory information is insufficient. The results distinguish record formation, receiver use, memory retention, and task-adequate comparison within standard finite quantum processes. Author manuscript, preprint version 1.0. This manuscript is not a peer-reviewed journal publication. A separate technical Supplement provides complete model definitions, proofs, channel specifications and numerical details. Reproducibility materials are available separately as Software release 1.3 on OSF: https://doi.org/10.17605/OSF.IO/5TDRB. The preprint and reproducibility record are separate, linked scholarly outputs.
Calibrated support observations can constrain a complete quantum instrument without identifying its action by unrestricted tomography. We study what those observations guarantee when the noise law is not supplied. On a fixed four-dimensional incidence-record experiment, we define the set of all complete two-outcome completely positive instruments compatible with the exact raw rejection and outcome probabilities, retaining the classical flags. Exact ideal data identify the target, but an explicit family of complete instruments reproduces the nonzero-data category laws of a low-error contamination device while admitting coherent error of square-root order. A target-ray mass certificate and a common complete-dilation comparison give a universal upper, while an exactly feasible rational instrument supplies a stronger lower witness. At the diagnostic parameter r = 1/300000000, the unhalved target-relative worst-case radius lies between 0.000258065115532250 and 0.000951566242566. The result separates avoidable inequality conservatism from information absent from the measured data. Fixed-functional and fixed-map optimizations have separately certified scopes; they do not solve the global radius. The conclusions are conditional on the supplied carrier, calibration and common-device model. They do not establish an apparatus, device-independent certification, a finite-sample power guarantee or complete formal verification. Selected supporting declarations have one recorded successful Lean 4.19.0 macOS execution and declaration-specific source, type and axiom review; this is not an end-to-end formalization.