Vanished interference fringes do not by themselves tell us that the environment has recorded which path a particle took. This preprint studies a minimal model that separates the two: a qubit acquires a controlled phase from N environment qubits whose purity is set by one knob η ∈ [0,1]. The loss of fringes is the same for every η; what changes is where the information goes. At η = 1 every fragment of the environment carries a copy of the path; for smaller η records become biased coins, and the number of records needed for 0.9 bit grows as 2.7114/(1 − h_η) in the weak-record limit; at η = 0 the qubit is completely dephased while the modelled environment holds no path record and no system–environment entanglement, only a global parity from which any initial state can be restored. For a single witness the paper gives closed formulas for the path knowledge K and the phase-corrected visibility V along a family of readouts between the "kick" and "path" bases, and shows that this family is optimal: with phase-only feed-forward and no postselection, every readout obeys (K/η)² + V² ≤ 1. A two-path clock is the N = 1 case. The PDF embeds all verification scripts, their outputs, seven key files with expected values, a README and a list of SHA-256 hashes; the same files are in the ZIP. Exploratory calculations are distinguished from subsequent verification checks, and the known errors found during review are documented, not removed. No new physical law is claimed. Calculations, figures and typesetting were assisted by AI tools (Claude, Anthropic), used as tools; the author is responsible for the content.
Vanished interference fringes do not by themselves tell us that the environment has recorded which path a particle took. This preprint studies a minimal model that separates the two: a qubit acquires a controlled phase from N environment qubits whose purity is set by one knob η ∈ [0,1]. The loss of fringes is the same for every η; what changes is where the information goes. At η = 1 every fragment of the environment carries a copy of the path; for smaller η records become biased coins, and the number of records needed for 0.9 bit grows as 2.7114/(1 − h_η) in the weak-record limit; at η = 0 the qubit is completely dephased while the modelled environment holds no path record and no system–environment entanglement, only a global parity from which any initial state can be restored. For a single witness the paper gives closed formulas for the path knowledge K and the phase-corrected visibility V along a family of readouts between the "kick" and "path" bases, and shows that this family is optimal: with phase-only feed-forward and no postselection, every readout obeys (K/η)² + V² ≤ 1. A two-path clock is the N = 1 case. The PDF embeds all verification scripts, their outputs, seven key files with expected values, a README and a list of SHA-256 hashes; the same files are in the ZIP. Exploratory calculations are distinguished from subsequent verification checks, and the known errors found during review are documented, not removed. No new physical law is claimed. Calculations, figures and typesetting were assisted by AI tools (Claude, Anthropic), used as tools; the author is responsible for the content.
A computational tutorial on standard quantum probability, written in the language of complex amplitudes (“arrows”) and environmental records. Eleven well-known puzzles — two-path interference, the quantum eraser, delayed choice, the Zeno effect and interaction-free measurement, decoherence, Bell–CHSH, GHZ, Hardy’s argument, the Peres–Mermin square, no-signalling and the information–disturbance trade-off — are each worked out explicitly, step by step. For every example the paper separates three things that are often merged: what quantum theory predicts, which classical model (with which assumptions) is excluded, and what is left to interpretation. A further worked example shows that one and the same loss of interference can leave records whose accessible which-path information ranges from none to complete, and how the difference can be estimated from data. Reported tests of higher-order interference are collected with their original uncertainty conventions. Every computed number is reproduced by released, seeded Python scripts; expected results were fixed (with SHA-256 hashes) before each script was run. The scripts, expected-result files and an independent reviewer’s cross-check are attached to this record and embedded in the PDF. No new physical law or quantum algorithm is claimed; the contribution is a connected, verifiable teaching path.
Decoherence is usually viewed as the loss of local coherence, but it also writes information into the environment. Here we show that the environment stores this information in two distinct forms. One is a recoverable quantum record: after a transverse qubit measurement, the bath is projected onto a Schrödinger-cat-like state in a mode-matched physical collective coordinate. The other is a redundant classical which-path record distributed across physical frequency-band fragments. Using tensor-network simulations of a spin--boson reservoir, we reconstruct the conditional bath Wigner function and find visible negativity. In the chain representation used for the simulations, one natural orbital carries more than 95% of the bath one-body occupation associated with the record. A parity symmetry gives an exact nonperturbative identity between the remaining qubit coherence and the overlap of the two environmental branches, while the classical pointer information forms a Darwinian record across fragments. At finite temperature the quantum record is thermally smoothed. In the pure-dephasing limit it becomes an exact mixture of displaced cat states, and negativity remains visible over the simulated range. These results connect decoherence to phase-space tomography and outline how both records can be observed by qubit readout and collective-mode Wigner tomography.
This preprint, ISTP Paper II, examines which records must be retained to predict recoverable interference in a two-path quantum system. Identical path statistics can accompany different outcomes of a later joint or conditioned measurement. The analysis distinguishes coherent recombination, summation over unobserved quantum registers, and classical coarse graining after readout. An exact representation assigns nonnegative integer histories to eight phase addresses and implements a specified Clifford+T gate family. For a fixed later outcome, the reduced path state is sufficient over all joint preparations precisely when the measurement effect acts as the identity on the discarded register. Explicit equal-marginal examples demonstrate the consequences when this condition fails. With preparation, transport, record coupling and overall normalization held fixed, four discrete phase settings determine the complex interference coefficient, showing why cancellation at a single setting does not establish an absence of coherence. Three-register circuits compare an accessible path marker with a further environmental record: interference recovered by conditioning on the accessible marker remains limited by the residual environmental overlap. The gates and quadratic Born readout are adopted inputs. The results organize standard quantum structures into a conditional, exactly reproducible account of retained information and measurement access. They do not derive spatial propagation or individual detector events from discrete updates, and they introduce no new erasure principle or departure from quantum mechanics. The spatial screen map and displayed record ordering are explicitly illustrative. This v2.5.1 deposit includes the manuscript, Supplementary Information, editable manuscript sources, and reproducibility package v4.1.1, with exact rational and quadratic-surd data, executable verification commands, and an independent exact-coordinate verifier. CHSH is retained only as a supplementary implementation reference; photoemission is treated separately. Rights: CC BY 4.0 applies to the manuscript, Supplementary Information, and the author's original explanatory figures and tables. Software and build scripts retain their existing rights and are not covered by the manuscript license. See RIGHTS_SCOPE.md and the license notices within the accompanying archives.
A friend measures a qubit. Wigner, standing outside, wants to reverse that measurement and run an interference test; this is the core of Wigner's-friend no-go arguments. In a real laboratory the friend's result also leaks into the surroundings, and Wigner can control only some of them. We ask a narrow, operational question for the simplest local-friendliness test, a CHSH inequality with one friend: which parts of the surroundings must Wigner control to still obtain a CHSH violation? We give four results. (1) The best CHSH value Wigner can reach depends only on the two states of the surroundings he does not control, one for each result of the friend, and on the visibility of the entangled source. We give it exactly. (2) This value lies between a fidelity bound and a distinguishability bound; the upper bound is a known device-independent bound. (3) Wigner must control at least one qubit in every group of outside qubits that can read the friend's result on its own. This is necessary in general, and sufficient when each group reads the result either fully or not at all. We check it on every control set for one bit stored in eight qubits. Stored as eight copies, Wigner needs all 8 qubits; as four blocks, 4; as two blocks, 2; in a GHZ-type state, 1; in a Haar-random state, about half. (4) So r disjoint groups that can each read the result (the redundancy of quantum Darwinism) force Wigner to control at least r qubits. The converse is false. The tools are standard. The contributions are the exact partial-control formula, the hitting-set condition with its exact cases, and this one-way link to redundancy. We propose small circuits for quantum processors; on one chip they test quantum predictions, not local friendliness itself. Emmy Team consists of human researchers and AI agents (large language models). The AI agents took part in drafting, coding, translation and review, together with the human members. The human authors set the questions, reviewed the results, and take responsibility for the paper. This record holds the paper (Markdown and PDF), two figures, and a zip with all scripts and their JSON outputs. Version 1.0.
Preprint and reproducibility archive; not peer reviewed. What this record contains. The full text of the manuscript "Identical Few-Particle Gauge Hamiltonians, Programmable Collective Charge Response" (M. J. Baek), its Supplementary Information with complete proofs, and the archive that certifies every closed-form value the paper states. The result. Few-particle dynamics are routinely used to infer collective response in paired quantum matter. This work constructs finite-range interacting response twins that defeat that inference exactly. For any prescribed finite p, two positive finite-range parents have complete static gauge Hamiltonians that coincide at every Peierls link phase on every sector N ≤ p and first separate at N = p+1; their zero-twist finite-density ground rays are the same Dicke condensate, yet their collective charge curvatures differ extensively. The obstruction has no universal depth, and the paper locates it exactly: the blind depth equals the spectator body order, the algebraic bound is independent of geometric range, and bounded range still bounds depth only through the number of sites a ball can hold — so no arbitrary-depth family of uniformly fixed range is claimed. Conversely, a structurally closed exact-pair tower closes at depth two. What is hidden is designable: with d(d+1)/2 displacement families the whole symmetric response-tensor difference is locally realizable at interior filling, and a triangular-lattice twin pair differs only in shear while both diagonal responses stay equal. A 4×4 hard-core-qubit discriminator gives an exact factor-of-two contrast with an internal null control and a state-preparation certificate in 17 equal-time settings. What is certified, and what is not. Results proved in closed form are stated as theorems and proved in full in the Supplementary Information; results established by exact rational or symbolic computation are labelled computer-assisted and carry the script that produces them; the 16-qubit discriminator is a blueprint with an end-to-end noise simulation, not a hardware demonstration, which is not claimed anywhere. Scope limits, open proof lines and one refuted conjecture are recorded explicitly rather than omitted. The archive. response_twins_unified_v1.0.zip contains the manuscript and Supplementary sources, the proof notes, the complete fail-closed verification harness (31 executed stages in release mode — 27 claim-bearing certificate stages, 1 non-claim diagnostic stage and three fail-closed gates — and 24 in quick mode) with one frozen log per stage, independent reimplementations of the load-bearing calculations, negative controls that must fail, the exact-arithmetic certificates behind every closed-form value in the paper, the figure-generation scripts, the scientific claim and provenance record (79 rows with status and scope notes, 50 of them naming the in-archive script or certificate that checks them, the rest saying in words why not), and a per-file SHA-256 manifest of all 209 payload files. Verifying it. Extract the archive and run python3 REPRODUCIBILITY/run_all.py --mode quick for the fast subset or --mode release for all 31 stages; bash BUILD.sh rebuilds both PDFs from source. The three gates check journal-format limits, the release payload against its manifest, and every number the documentation states about the artefacts. Running the harness does not modify the archive: all runtime output is written outside the immutable tree, so verification cannot invalidate the manifest. README.md separates reproducing the content (TeX Live 2023 or newer) from reproducing the archived PDF bytes, which needs the exact producing build recorded inside the PDFs. Licences. Manuscript, Supplementary Information and documentation CC BY 4.0; source code MIT; certificate data CC0 1.0. LICENSE.md is the authoritative per-file mapping and is included both in the archive and as a separate file on this record.
Licensing: paper, figures and data are under CC BY 4.0; the source code is under the Apache License, Version 2.0. The paper text names the code licence "Apache License 2.0" — this is the same licence. Korbany, Ellison, Stephen and Piroli showed that a non-integer value, in some modular frame, of the Shannon entropy of the topological-sector weights of a topologically ordered ground state, which equals the mutual information between separated regions, certifies long-range nonstabilizerness. They treated the toric code and doubled Fibonacci. We ask where this witness is blind on doubled SU(2)_k string nets. For minimal-entropy states whose modular-data columns are flat, we prove that the witness is integer in every modular frame if and only if the column supports are powers of two. The proof embeds the modular representation into the Clifford/Weil representation of a qudit of dimension 2(k+2). We map all minimal-entropy states for k ≤ 32 (the flat-column characterization was registered before the computations for 17 ≤ k ≤ 32), show that the doubled-Ising state σσ̄ is bit-blind in exact arithmetic although the ground-space dimension criterion of Wei and Liu certifies strong long-range magic in a qubit embedding, and show that the blind spots depend on the encoding of the local degrees of freedom. The modular-invariant diagonal state is blind exactly when the number of anyons is a power of the local prime. We argue that it is the ground state obtained from the empty string-net configuration, and confirm this numerically on the doubled-Fibonacci honeycomb torus. This record contains the manuscript, the 16 verification scripts and their result files, the pre-registration documents (one of them redacted, see README) and the material of the cold reads described below. The README explains how to re-run the scripts and states which hash cannot be checked against the deposited copy.Notice (2026-10-__). Two sentences of the introduction will be revised in the next version; no computed value and no result changes.(1) The value H = 1.700979 of Ref. [Sayim, 5a] is described as "one of two long-range-nonstabilizerness certificates reported there". Following the correction notice of that work (2026-10-10), it is the long-range certificate reported there; the other item shows only that sampled ground-space states are not stabilizer states.(2) The sentence "the witness and its theorem are due to Ref. [Korbany et al., arXiv:2605.22424]" will also state that the idea of certifying long-range nonstabilizerness by non-integer mutual information goes back to D. A. Korbany, M. J. Gullans and L. Piroli, Phys. Rev. Lett. 135, 160404 (2025), and N. Parham, arXiv:2504.19966, as Sec. 3.1 of arXiv:2605.22424 states. Both works are already cited in the paper. Use of AI tools: In the research, processing, and writing of this paper and its results I worked together with generative AI tools, in practice a system of multiple coordinated AI instances that I set up and orchestrate (large language models, mainly Claude, by Anthropic, inside Claude Code and, for part of the work, in the Claude AI web interface). At their current context sizes I found it far more effective to work with several specialized instances, each with its own role and its own harness of rules and parameters that I designed and refined through feedback, than to load a single instance with all of the material; for my workflow that would have been inefficient, though this depends on the individual implementation. I lead this collaboration: I choose the research directions, set the goals, and make the final decisions in open exchange with the AI, learning actively as the work proceeds. The AI carries out the drafting, including the mathematical and technical parts, the numerical computation, and the literature search, under my direction. The AI works autonomously only task by task, within the structure I develop through feedback: it completes a task, and at open questions that need me it stops until the point is settled before the next step. Along the way I witness and take many of the decisions that shape the path, and it is common for me to spot things that need improvement. The work spans many separate runs, and a single simulation or build task alone can take up to an hour, so it could not happen all together in one autonomous run; and had I let the AI do all of it together alone, even if it is possible, it would no longer be my work but the AI's. I run multiple verifications at the different stages of the work and one before release, and all references are checked against the original sources. Before release, the statements and proofs of the main theorem were cold-read in one run, and two of its lemmas in a second run, each in a new Claude AI chat (Opus 5.5, high reasoning effort) given only extracted text: the first reader computed the list of blind states for k <= 16 itself, conjectured the rule of Theorem 1 and tested it at four larger k, and the readers reported imprecisions in the statements of two lemmas, which I corrected; the corrected text was not read again by a fresh reader. In the end what matters are human eyes, a principle that is itself written into the parameters of my system: I reach out to experts after publishing for review and feedback, so I learn what is solid and what must be corrected or falsified. My scripts for reproduction and review are released with this record. These tools are not authors; I am the author, and I take full responsibility for all scientific content and decisions leading to these results and their publication.