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

Finite Target Preparation and Complete Reader Initialization for Source-Tagged Quantum Records

Qingchun Zhang

Published Oct 31, 2026• 0 citations
Publisher

Abstract

A calibrated quantum-record test can require both a global target state and a commoncomplete reader input, neither of which is certified by accessible marginal data. We construct theseinputs for the specified source-tagged model at an independently known source length m= 65. Thepublished joint-input work/source reset is followed by 37 finite swaps with fresh reader qubits and a69-slot target sequence: coherent work-label creation, globally conditioned tag injection, and 64neighboring source transfers. The control-only sequence prepares the exact far-target cat or itssigned partner with the required common phase. A retained random sign produces the comparisonmixture without postselection. Full-state comparisons include consumed supplies and arbitraryinitial correlations with exactly inert retained memory. The original clock, holding terms, sourcehopping, both port directions and either actual law, h= 0 or h= J/25, remain active throughout.The constructed initialization fits the existing 1/4000 allowance; target delivery has sufficienterror below 0.004816692 <1/200. With separate complete-interval generator and endpoint-effectallowances, each target response differs from its nominal value by less than 0.007816692 <1/125.The same reader initialization supplies the published reference-preparation interface. The resultis a conditional single-delivery construction: it consumes 37 fresh pure reader qubits, requirespreparation access through site 65 and additional globally conditioned controls, and inherits anextremely costly reset. Application to repeated acquisition still requires almost-sure conditionalsupply and error bounds; practical feasibility and uniform passing power are not established.

DOI
10.5281/zenodo.23839590

Related papers

Reset Resource Frontiers for Source-Tagged Quantum Records

Qingchun Zhang

This technical note studies selected reset resource trade-offs for a fixed source-tagged quantum-record apparatus at independently known source length m = 65. It preserves the already published target preparation, complete-reader initialization, calibration and acquisition results as inherited interfaces. For exact unitary reset with a pure initialized environment and arbitrary inert-reference correlations, the environment dimension must be at least the 131-dimensional source dimension. Under the staged-isolation contract in which a dedicated source bank is the only system allowed to retain the source label during the source stage, five qutrits are necessary among qutrit tensor banks because 3^4 < 131 <= 3^5. An explicit five-qutrit encoded-bank construction attains that count. The paper compares two constructions satisfying the same full-joint reset interface. A nearest-neighbor-transport circuit uses 65 source qutrits and 2,159 finite slots; its source stage combines neighboring transfers with 65 globally vacuum-conditioned extraction pulses. An encoded-bank circuit uses five qutrits and 15 slots, but assumes one nonlocal, coherently phased 130-block all-site extraction Hamiltonian. Under the declared supply, control, generator-error and isolation conditions, the sufficient reset bounds are below 0.000083661 and 0.000081959, respectively, and both remain within the existing downstream initialization allocation. The contribution is an apparatus-specific comparison of selected feasible points in environment dimension, control connectivity, pulse count, strength and slew, elapsed model time, calibration burden and complete-input error. It does not prove a Pareto frontier, a general reset resource theory, a local synthesis of the encoded Hamiltonian, an approximate or catalytic optimum, an all-length theorem or practical implementation.

•Nov 1, 2026•0 citations

Calibrated Discrimination of Dynamics in Source-Tagged Quantum Records

Qingchun Zhang

We construct a source-matched reference calibration for distinguishing the coherent law h = 0 from the specified added generator h = J/25 in a finite quantum-record model. A complete-carrier transfer bound connects an accessible reference contrast to a delayed target contrast while retaining the original drift and actual law. On reference coverage and measured admission, restricting both hypotheses by the same observed reference band yields a directed target-set separation of at least 0.0071230619 whenever both compatible classes are nonempty. Rival worlds may have different admitted nuisance parameters. The constants are uniform over independently known finite lengths m >= 65, with tag 65, access prefix 1:32 and target deadline 25.02/J. Finite reference preparation and work/source reset satisfy the declared response budgets. Reset acts on the actual joint input and consumed supply, with the retained reference R exactly inert. It does not assign a universal reduced channel to correlated supplies. Under almost-sure conditional resource and supply bounds, the comparison extends to history-dependent acquisition. A prespecified rule, including abstention below the calibration threshold, has each-law unconditional wrong-declaration probability at most 2 exp(-6) + exp(-85/16) < 0.01. This is neither a posterior probability nor an error bound conditional on admission. The statistical step uses standard bounded-martingale concentration. Global target states and specified auxiliary supplies remain resources. Reset requires additional globally conditioned controls and has very large finite costs. The result is a conditional theorem for the two declared laws; it does not establish practical implementation or a unique diagnosis of fundamental collapse. A supporting Lean 4 companion contains 85 theorem declarations and 30 supporting definitions across Calibration, Operations and Risk. It provides checked scalar, sufficient-bound, resource-arithmetic and finite-history risk consequences under explicit premises. The companion has an executed Linux preflight and accepted returned macOS compilation, named-type and transitive-axiom evidence. The quantum constructions and conditional moment, filtration, tower and tail derivations remain written proofs or external premises; this is not an end-to-end formalization of the physical theorem chain. The original checked companion targeted author v0.4 and is carried forward unchanged, with its scope and execution chronology preserved.

•Oct 25, 2026•0 citations

Local Access and Phase Recovery of Source-Tagged Quantum Records

Qingchun Zhang

A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.

•Oct 20, 2026•0 citations

Locality, Memory, and Calibration Trade-offs in Exact Quantum Reset

Qingchun Zhang

We study exact reference-preserving reset as an information-transfer task in a finite tagged-source model. A declared local-qutrit realization admits a depth-one parallel source-to-bank unitary:65 pair-local exchanges reset the complete source carrier on a pure-zero bank while transferringeach source basis label to an orthogonal bank record and each source matrix unit coherently to thecorresponding bank matrix unit. We propagate this identity through an inherited work-replacementinterface and a complete-joint error contract, deriving a channel-wise calibration theorem thatcharges coefficient, timing, axis, cross-talk, leakage and bank-dynamics errors against one globalallowance. For admitted complete inputs whose nominal post-replacement source-bank comparisonis supported on the vacuum-plus-one-excitation sector with a zero bank, a per-port peak 218J givesa sufficient reset bound below 10−4 at source length 65 and preserves the existing reader allocation,while requiring 65 local ports, an aggregate peak 65·218J, and stringent joint calibration. Conversely,an ε-reset of a d-dimensional input with a pure blank environment requires environment dimensionat least ⌈d(1−ε)⌉. At ε= 10−4 the 131-dimensional tagged source still requires 131 environmentdimensions. Combining this rank bound with circuit causal cones yields memory-dependent depthlower bounds; combining environment distinguishability with a supplied positive-constant Lieb–Robinson profile yields a conditional reset-time lower bound that is nontrivial only when the profileseparation term is positive. The results quantify a memory–locality–calibration trade-off in onedeclared architecture. They do not establish optimal hardware, practical supplier generation, anautonomous repeated-use service, or a universal tight reset speed.

•Nov 1, 2026•0 citations

Feedback and Robust Local Readout of a Fixed Four-State Quantum Source

Jeremy Rodgers

This paper develops local quantum-reader decision problems within Shadow Theory’s source–readout programme. It asks when feedback improves access to a target distinction in a fixed quantum source, and how reliably that distinction can be read under detector noise and calibration uncertainty. The source supplies independent copies conditional on one hidden label, held fixed throughout the experiment, from four equatorial qubit preparations. The task is to identify their common positive or negative sign, rather than reconstruct the full preparation label. Although all four preparations have identical separate-mode intensities, phase-sensitive local measurements provide access to the target. The analysis compares adaptive readers, whose measurement settings depend on earlier records, with randomized nonadaptive readers, whose complete schedules are selected before outcomes are observed. Each measurement consumes one fresh copy. Every protocol must return a sign at a fixed deadline, retaining all settings, outcomes, nulls and specified timing records. Neither class uses collective measurements or coherent quantum memory between specimens. The main results establish equal optimal worst-case error for both reader classes through three copies across the shared efficiency and visibility model. At four copies, explicit rational feedback policies outperform every randomized nonadaptive schedule over the full continuous equatorial measurement menu, in both the ideal model and a specified noisy model. The comparison is supported by continuous-menu lower certificates rather than measurement-grid searches alone. For a one-percent worst-case error target, the minimum copy count is narrowed to either 13 or 14 for each reader class in the nominal model, and either 16 or 17 under the specified asymmetric gain and phase uncertainty. These adjacent thresholds remain unresolved. Further results give an exact robust repeated-angle frontier, extend the comparison to randomized choices of a fixed repeated angle, and identify convex-source conditions under which one reader is globally sufficient. The accompanying technical supplement and reproducibility materials provide measurement-allocation benchmarks, expanded finite-menu comparisons, compact feedback policies, exact optimization certificates, and timing and calibration interfaces. The results quantify target access under explicitly stated preparation, measurement and record-access conditions. They use standard quantum probabilities within Shadow Theory’s research programme and distinguish copy savings from total apparatus, control or calibration savings.

•Oct 28, 2026•0 citations

Finite Quantum Records and Source-Inclusive Coherence Tests

Qingchun Zhang

A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.

•Oct 15, 2026•0 citations
A calibrated quantum-record test can require both a global target state and a commoncomplete reader input, neither of which is certified by accessible marginal data. We construct theseinputs for the specified source-tagged model at an independently known source length m= 65. Thepublished joint-input work/source reset is followed by 37 finite swaps with fresh reader qubits and a69-slot target sequence: coherent work-label creation, globally conditioned tag injection, and 64neighboring source transfers. The control-only sequence prepares the exact far-target cat or itssigned partner with the required common phase. A retained random sign produces the comparisonmixture without postselection. Full-state comparisons include consumed supplies and arbitraryinitial correlations with exactly inert retained memory. The original clock, holding terms, sourcehopping, both port directions and either actual law, h= 0 or h= J/25, remain active throughout.The constructed initialization fits the existing 1/4000 allowance; target delivery has sufficienterror below 0.004816692 <1/200. With separate complete-interval generator and endpoint-effectallowances, each target response differs from its nominal value by less than 0.007816692 <1/125.The same reader initialization supplies the published reference-preparation interface. The resultis a conditional single-delivery construction: it consumes 37 fresh pure reader qubits, requirespreparation access through site 65 and additional globally conditioned controls, and inherits anextremely costly reset. Application to repeated acquisition still requires almost-sure conditionalsupply and error bounds; practical feasibility and uniform passing power are not established.
This technical note studies selected reset resource trade-offs for a fixed source-tagged quantum-record apparatus at independently known source length m = 65. It preserves the already published target preparation, complete-reader initialization, calibration and acquisition results as inherited interfaces. For exact unitary reset with a pure initialized environment and arbitrary inert-reference correlations, the environment dimension must be at least the 131-dimensional source dimension. Under the staged-isolation contract in which a dedicated source bank is the only system allowed to retain the source label during the source stage, five qutrits are necessary among qutrit tensor banks because 3^4 < 131 <= 3^5. An explicit five-qutrit encoded-bank construction attains that count. The paper compares two constructions satisfying the same full-joint reset interface. A nearest-neighbor-transport circuit uses 65 source qutrits and 2,159 finite slots; its source stage combines neighboring transfers with 65 globally vacuum-conditioned extraction pulses. An encoded-bank circuit uses five qutrits and 15 slots, but assumes one nonlocal, coherently phased 130-block all-site extraction Hamiltonian. Under the declared supply, control, generator-error and isolation conditions, the sufficient reset bounds are below 0.000083661 and 0.000081959, respectively, and both remain within the existing downstream initialization allocation. The contribution is an apparatus-specific comparison of selected feasible points in environment dimension, control connectivity, pulse count, strength and slew, elapsed model time, calibration burden and complete-input error. It does not prove a Pareto frontier, a general reset resource theory, a local synthesis of the encoded Hamiltonian, an approximate or catalytic optimum, an all-length theorem or practical implementation.
We construct a source-matched reference calibration for distinguishing the coherent law h = 0 from the specified added generator h = J/25 in a finite quantum-record model. A complete-carrier transfer bound connects an accessible reference contrast to a delayed target contrast while retaining the original drift and actual law. On reference coverage and measured admission, restricting both hypotheses by the same observed reference band yields a directed target-set separation of at least 0.0071230619 whenever both compatible classes are nonempty. Rival worlds may have different admitted nuisance parameters. The constants are uniform over independently known finite lengths m >= 65, with tag 65, access prefix 1:32 and target deadline 25.02/J. Finite reference preparation and work/source reset satisfy the declared response budgets. Reset acts on the actual joint input and consumed supply, with the retained reference R exactly inert. It does not assign a universal reduced channel to correlated supplies. Under almost-sure conditional resource and supply bounds, the comparison extends to history-dependent acquisition. A prespecified rule, including abstention below the calibration threshold, has each-law unconditional wrong-declaration probability at most 2 exp(-6) + exp(-85/16) < 0.01. This is neither a posterior probability nor an error bound conditional on admission. The statistical step uses standard bounded-martingale concentration. Global target states and specified auxiliary supplies remain resources. Reset requires additional globally conditioned controls and has very large finite costs. The result is a conditional theorem for the two declared laws; it does not establish practical implementation or a unique diagnosis of fundamental collapse. A supporting Lean 4 companion contains 85 theorem declarations and 30 supporting definitions across Calibration, Operations and Risk. It provides checked scalar, sufficient-bound, resource-arithmetic and finite-history risk consequences under explicit premises. The companion has an executed Linux preflight and accepted returned macOS compilation, named-type and transitive-axiom evidence. The quantum constructions and conditional moment, filtration, tower and tail derivations remain written proofs or external premises; this is not an end-to-end formalization of the physical theorem chain. The original checked companion targeted author v0.4 and is carried forward unchanged, with its scope and execution chronology preserved.
A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.
We study exact reference-preserving reset as an information-transfer task in a finite tagged-source model. A declared local-qutrit realization admits a depth-one parallel source-to-bank unitary:65 pair-local exchanges reset the complete source carrier on a pure-zero bank while transferringeach source basis label to an orthogonal bank record and each source matrix unit coherently to thecorresponding bank matrix unit. We propagate this identity through an inherited work-replacementinterface and a complete-joint error contract, deriving a channel-wise calibration theorem thatcharges coefficient, timing, axis, cross-talk, leakage and bank-dynamics errors against one globalallowance. For admitted complete inputs whose nominal post-replacement source-bank comparisonis supported on the vacuum-plus-one-excitation sector with a zero bank, a per-port peak 218J givesa sufficient reset bound below 10−4 at source length 65 and preserves the existing reader allocation,while requiring 65 local ports, an aggregate peak 65·218J, and stringent joint calibration. Conversely,an ε-reset of a d-dimensional input with a pure blank environment requires environment dimensionat least ⌈d(1−ε)⌉. At ε= 10−4 the 131-dimensional tagged source still requires 131 environmentdimensions. Combining this rank bound with circuit causal cones yields memory-dependent depthlower bounds; combining environment distinguishability with a supplied positive-constant Lieb–Robinson profile yields a conditional reset-time lower bound that is nontrivial only when the profileseparation term is positive. The results quantify a memory–locality–calibration trade-off in onedeclared architecture. They do not establish optimal hardware, practical supplier generation, anautonomous repeated-use service, or a universal tight reset speed.
This paper develops local quantum-reader decision problems within Shadow Theory’s source–readout programme. It asks when feedback improves access to a target distinction in a fixed quantum source, and how reliably that distinction can be read under detector noise and calibration uncertainty. The source supplies independent copies conditional on one hidden label, held fixed throughout the experiment, from four equatorial qubit preparations. The task is to identify their common positive or negative sign, rather than reconstruct the full preparation label. Although all four preparations have identical separate-mode intensities, phase-sensitive local measurements provide access to the target. The analysis compares adaptive readers, whose measurement settings depend on earlier records, with randomized nonadaptive readers, whose complete schedules are selected before outcomes are observed. Each measurement consumes one fresh copy. Every protocol must return a sign at a fixed deadline, retaining all settings, outcomes, nulls and specified timing records. Neither class uses collective measurements or coherent quantum memory between specimens. The main results establish equal optimal worst-case error for both reader classes through three copies across the shared efficiency and visibility model. At four copies, explicit rational feedback policies outperform every randomized nonadaptive schedule over the full continuous equatorial measurement menu, in both the ideal model and a specified noisy model. The comparison is supported by continuous-menu lower certificates rather than measurement-grid searches alone. For a one-percent worst-case error target, the minimum copy count is narrowed to either 13 or 14 for each reader class in the nominal model, and either 16 or 17 under the specified asymmetric gain and phase uncertainty. These adjacent thresholds remain unresolved. Further results give an exact robust repeated-angle frontier, extend the comparison to randomized choices of a fixed repeated angle, and identify convex-source conditions under which one reader is globally sufficient. The accompanying technical supplement and reproducibility materials provide measurement-allocation benchmarks, expanded finite-menu comparisons, compact feedback policies, exact optimization certificates, and timing and calibration interfaces. The results quantify target access under explicitly stated preparation, measurement and record-access conditions. They use standard quantum probabilities within Shadow Theory’s research programme and distinguish copy savings from total apparatus, control or calibration savings.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.