Localized charges, reset noise, and boundary memory in matrix-product-conserving quantum chains

Abstract:We construct boundary observables that retain memory for a quantified time window in quantum chains whose basis configurations carry a conserved ordered product of matrix labels. Under strong-irreducibility and proximality hypotheses on the label matrices, projective contraction of random matrix products localizes a conserved charge in the root-mean-square over uniform basis configurations. A finite-time inequality then converts readout overlap and reset leakage into a correlation bound: for a conserved reference observable $H$, a readout $F$, accumulated squared leakage $\mathcal B$, and the normalized Hilbert-Schmidt inner product, $\langle F,\Phi(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2$. Here $\Phi$ is a sequence of conserving channels and partial resets. The bound holds for each such circuit, without averaging its gates. It yields an exponential memory window in the distance from the noisy region, with quantitative corrections for spatially distributed noise and imperfect conservation. For a thirteen-state elementary-matrix model, exact polynomial certificates give root-mean-square localization error $e^{-r/1400}$ between the charge and its restriction to the last $r$ sites, and limiting variance at least $1/19$ for a rational charge. A related normalized-Gram charge gives an eight-site certificate retaining more than half the specified readout correlation through two boundary-reset rounds. Uniform depolarization imposes an inverse-noise-rate lifetime ceiling. A two-qubit IBM experiment illustrates the general reset inequality; it does not realize the matrix-product chain. We provide proofs, exact certificate programs, and an independent recount of the archived experimental outcomes.

43 pages, 3 figures. Ancillary file: exact certificate programs, primary experimental data and offline recount code

Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph)

arXiv:2609.23195 [quant-ph]

(or arXiv:2609.23195v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.23195 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

ARCHIVE_MANIFEST.json

PUBLICATION_PROVENANCE.json

anc/audit_finite_gram.py

anc/certify_geometry_sizes.py

anc/certify_one_step.py

anc/certify_stationary_variance.py

anc/exact_gram.json

anc/exact_gram.py

anc/geometry_sizes_certificate.json

anc/one_step_bernstein_certificate.json

anc/orthogonal_drift.py

anc/orthogonal_drift_certificate.json

anc/sharpen_audit.py

anc/sharpen_audit_certificate.json

anc/stationary_variance_certificate.json

data/two_qubit/ANALYSIS_PLAN.md

data/two_qubit/MEMORY_RESULTS_2026-09-18.md

data/two_qubit/README.md

data/two_qubit/circuit.txt

data/two_qubit/live/calibration.json

data/two_qubit/live/circuit.qpy

data/two_qubit/live/compact.qpy

data/two_qubit/live/contexts.json

data/two_qubit/live/manifest.json

data/two_qubit/live/presubmit_calibration.json

data/two_qubit/live/raw_outcomes.npy

data/two_qubit/live/recount.json

data/two_qubit/live/result_metadata.json

data/two_qubit/live/results.json

data/two_qubit/live/status.json

data/two_qubit/live/submission.json

data/two_qubit/live/submission_intent.json

data/two_qubit/logical.qpy

data/two_qubit/native_basis.qpy

data/two_qubit/recount.py

data/two_qubit/run.py

data/two_qubit/validation.json

data/two_qubit_overlap.py

supporting_reports/adapted_diagnostic.md

supporting_reports/adapted_pair_flip.md

supporting_reports/first_pair_flip_pilot.md

supporting_reports/paired_charge_failure.json

supporting_reports/paired_charge_status.json

supporting_reports/seven_qubit_pilot.md

supporting_reports/ten_qubit_followup.md

supporting_reports/two_qubit_mathematical_audit.md

supporting_reports/two_qubit_protocol_audit.md

(46 additional files not shown) You must enabled JavaScript to view entire file list.

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.