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

Quantum Processes with Recovery: Normal Form, Stability, and Memory Certification

David Gutierrez Ule

Published Oct 26, 2026• 0 citations
Publisher

Abstract

We characterize two-step quantum processes with a prescribed first channel whose unperturbed final evolution exactly recovers the input. For a system of dimension d and a first channel of Kraus rank k > 1, the compatible family is affinely bijective to the set of channels from dimension d(k−1) to dimension d. For qubit dephasing with residual coherence r, an intermediate X intervention not only reconstructs the parametrizing channel but also attains the optimal operational distance, equal to (1−r²) times the diamond distance between the parametrizing channels. We determine the classical subfamily, its minimum register cardinality, and the maximal temporal negativity (1−r²)/2. For imperfect recovery, we prove O(√δ) proximity to the exact family while preserving the first channel, with dimension-independent constants. An explicit two-qubit example shows that the exponent 1/2 cannot be uniformly improved. Finally, we derive a Pauli-cycle witness whose exact classically attainable region is characterized by a quadratic inequality involving the cyclic coherence and two return probabilities. The witness requires neither population preservation nor perfect recovery. A linear version uses twelve experimental settings and admits explicit finite-sample significance bounds with calibrated control errors. Analytical proofs are accompanied by reproducible code. No experimental data or departures from standard quantum mechanics are claimed.

DOI
10.5281/zenodo.23662632

Related papers

Robust State Equation: Calibrated Hankel Recovery and Finite-Precision Classicalization

Максим Чурилов

Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation \(\Theta([N(L-1)]^{-1/2})\) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core \(H\), all shifts are recovered in one basis by \(\tilde{A}_a = \tilde{H}^{-1}\tilde{H}_a\). An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy \(1-(1-\Delta/2)^L\) at one-step diamond radius \(\Delta\). Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon \(L\) and operational error \(\eta>0\), a classical realization whose number of states is the seeded covering number at radius \(2\eta/L\), uniformly over adaptive policies. For a \(d\)-dimensional quantum instrument this gives, for \(d\geq 2\), \[ \left(1+\frac{2(1-d^{-1})L}{\eta}\right)^{d^2-1} \] states, with no extra transient state; one state suffices for \(d=1\). The ambient exponent \(d^2-1\) is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed \(d\), \(L\), \(\eta\). Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.

•Nov 3, 2026•0 citations

Intermediate memory costs of quantum channel synthesis with a protected subsystem

Kai Liu, Deguang Han

A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a $b$-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an $a$-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most $a$. A target graph may be realizable with a carrier of dimension $b$, while synthesizing a channel with that graph can require dimension $ab$. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error $(1-η)/4$, where $0\leqη\leq1$ is the depolarization strength. For $η<1$, the gap persists under sufficiently small perturbations of the target branches.

quant-pharXiv:2610.20536•Oct 15, 2026•0 citations

Exact Diamond Distance to Equilibrium for a Qubit Generalized-Amplitude-Damping Channel

Boris Batenin, Andrei Preece

This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.

•Nov 10, 2026•0 citations

What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?

Danesh Morales-Hashemi, Graeme Smith, Ningping Cao

What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.

quant-pharXiv:2610.03545•Oct 5, 2026•0 citations

Fidelity Determines the Minimum Error of Quantum Recovery

Dario Picozzi

Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor $0<ε<1$, the operational optimizers' sensitivity to residual unitary errors of size $s$ is at worst of order $s^{4/3}$, while the canonical polar correction has quadratic sensitivity.

arXiv:2611.07344•Nov 5, 2026•0 citations

Retained Quantum Records: Recovery Limits and Control-Dependent Formation Costs

Kent Nimmo

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.

•Nov 2, 2026•0 citations
We characterize two-step quantum processes with a prescribed first channel whose unperturbed final evolution exactly recovers the input. For a system of dimension d and a first channel of Kraus rank k > 1, the compatible family is affinely bijective to the set of channels from dimension d(k−1) to dimension d. For qubit dephasing with residual coherence r, an intermediate X intervention not only reconstructs the parametrizing channel but also attains the optimal operational distance, equal to (1−r²) times the diamond distance between the parametrizing channels. We determine the classical subfamily, its minimum register cardinality, and the maximal temporal negativity (1−r²)/2. For imperfect recovery, we prove O(√δ) proximity to the exact family while preserving the first channel, with dimension-independent constants. An explicit two-qubit example shows that the exponent 1/2 cannot be uniformly improved. Finally, we derive a Pauli-cycle witness whose exact classically attainable region is characterized by a quadratic inequality involving the cyclic coherence and two return probabilities. The witness requires neither population preservation nor perfect recovery. A linear version uses twelve experimental settings and admits explicit finite-sample significance bounds with calibrated control errors. Analytical proofs are accompanied by reproducible code. No experimental data or departures from standard quantum mechanics are claimed.
Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation Θ([N(L−1)]−1/2)\Theta([N(L-1)]^{-1/2})Θ([N(L−1)]−1/2) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core HHH, all shifts are recovered in one basis by A~a=H~−1H~a\tilde{A}_a = \tilde{H}^{-1}\tilde{H}_aA~a​=H~−1H~a​. An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy 1−(1−Δ/2)L1-(1-\Delta/2)^L1−(1−Δ/2)L at one-step diamond radius Δ\DeltaΔ. Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon LLL and operational error η>0\eta>0η>0, a classical realization whose number of states is the seeded covering number at radius 2η/L2\eta/L2η/L, uniformly over adaptive policies. For a ddd-dimensional quantum instrument this gives, for d≥2d\geq 2d≥2, (1+2(1−d−1)Lη)d2−1 \left(1+\frac{2(1-d^{-1})L}{\eta}\right)^{d^2-1} (1+η2(1−d−1)L​)d2−1 states, with no extra transient state; one state suffices for d=1d=1d=1. The ambient exponent d2−1d^2-1d2−1 is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed ddd, LLL, η\etaη. Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.
A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a bbb-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an aaa-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most aaa. A target graph may be realizable with a carrier of dimension bbb, while synthesizing a channel with that graph can require dimension ababab. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error (1−η)/4(1-η)/4(1−η)/4, where 0≤η≤10\leqη\leq10≤η≤1 is the depolarization strength. For η<1η<1η<1, the gap persists under sufficiently small perturbations of the target branches.
This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent XXX rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/21/21/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/21/21/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's XXX distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor 0<ε<10<ε<10<ε<1, the operational optimizers' sensitivity to residual unitary errors of size sss is at worst of order s4/3s^{4/3}s4/3, while the canonical polar correction has quadratic sensitivity.
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.