How much quantum memory is needed to calibrate a detector that destroys the probe and returns only a classical record?
For a known detector family with one unknown contrast, this project gives an exact retained-memory information frontier and a matching global estimation law. The detector privately selects a fresh random Pauli measurement on each use and reveals the setting only after consuming the probe.
Let
where
For each integer
| Question | Result | Read |
|---|---|---|
| How much one-use information can a reference retain? | Exact Fisher coefficient |
Fisher frontier |
| Is the frontier physically attainable? | Uniform entanglement over a computational subset; |
Construction and resources |
| Can coherent adaptive reuse improve distinguishability from zero? | Exact maximum relative entropy |
Entropy and adaptive calibration |
| What is the global estimation cost? | Minimax mean-square error within a factor 32 of |
Finite-sample guarantees |
| Can one scalar detector parameter benefit from an ancilla? | A six-outcome qubit detector has an exact factor-three Fisher advantage | Qubit counterexample |
Here
With
in the nontrivial small-error regime. Uniform high-confidence estimation adds a factor
Start with the model, assumptions and exact claims, then the attaining protocol. Specialists can go directly to the Fisher proof, relative-entropy proof, or adaptive minimax argument.
The interpretation explains why disclosure timing matters and compares the result with depolarizing-channel estimation. The related-work account and structured bibliography credit the inherited local Schmidt form, ancillary calibration, Pauli-learning memory tradeoffs and replacer-channel amortization. The LLM reading guide maps questions to their authoritative files.
The new claim is the solved destructive-detector calibration model and its consequences. Generic ancillary advantage, the zero-contrast rank numerator and exponential memory tradeoffs have established precedents.
The single educational anchor is John Watrous, The Theory of Quantum Information (2018). The learning entrypoint connects its foundations to this detector model without assigning additional textbooks.
| Route | What it provides |
|---|---|
| Two-qubit worked experiment | Probe preparation, all fifteen settings, observed erasures, the Y-sign correction and a complete estimator |
| Watrous-to-project bridge | Verified source sections, notation and log conventions, and the locally supplied Fisher, entropy and statistical arguments |
| Thirty-milestone map | Twelve background milestones and eighteen narrative milestones, with understanding targets, dependencies and canonical proof pointers |
The map is learner independent. It separates local Fisher information, global relative-entropy bounds and minimax rates; the scientific pages above remain the authoritative proofs.
From the repository root:
python3 -m pip install -r verification/requirements.txt
python3 verification/run_all.pyThe verification guide documents the actual matrix checks, deterministic cases, expected tolerances and scope. These corroborate finite-dimensional calculations; the universal adaptive and minimax statements rest on the written proofs.
The setting is disclosed after preparation. Every accessible retained coherent register, future entangled probe and purification counts in
The exact adaptive Fisher optimum is established at zero contrast. Exact relative-entropy optimality does not imply exact optimality for every finite-sample testing loss, and the global minimax theorem concerns intervals containing zero. Returning the quantum probe or revealing the setting before preparation changes the resource model.
This repository serves as a record of the work and a guide for the author’s self-directed learning. For discussion or potential collaboration, please contact Ruge Lin at gogoko699@gmail.com.