The same one-copy mixed state can support different collective sampling costs. A hidden phase pattern can look like complete dephasing on one specimen while still supplying useful correlations across repeated specimens. This project determines how long those phases must persist to help solve complement sampling.
An unknown set
Fix an integer phase order
The optimal hard budget of supplied copies is
The constants depend on fixed
For unknown signs, the law is
| Source promise | Optimal supplied copies |
|---|---|
| Positive amplitudes in the known basis | One, by the established complement swapper |
| Unknown signs fixed across all specimens | |
| Unknown signs fixed for known blocks of |
|
| Independent uniform signs at every address and every call | |
| Arbitrary continuous hidden phases, with any block length |
The independent root-phase priors and continuous-phase prior have the same one-copy averaged density operator at fixed support. Their repeated-copy states differ. The matching lower bound covers arbitrary collective receivers with a classical label as output; it does not impose a memory or measurement-batch restriction.
For fixed
A collective collision instrument coherently raises supported amplitudes to the
Conversely, below the relevant
The complement task and positive-state swapper are due to Benedetti, Buhrman and Weggemans. The power extractor and its occupation compiler are inherited from Quantum Coherent Collisions. Random-phase coupon simulation and phase-moment methods also have prior sources. Related work separates those ingredients from the output-specific persistence law.
Start with the connected scientific route, or go directly to a question:
| Question | Authoritative account |
|---|---|
| What is supplied, hidden, persistent and charged? | Source model |
| What is the exact theorem and its regime map? | Persistence frontier |
| Why can no collective receiver beat the copy order? | Phase-twirl converse |
| How does recovery work within a refresh block? | Coherent recovery |
| How are gates, workspace and rare-success precision charged? | Implementation |
| What does equality of one-copy states leave undetermined? | Interpretation |
| Which conclusions and tools are inherited? | Attribution and bibliography |
llms.txt maps theorem, story and reproduction requests to those files.
The learning route uses John Watrous's The Theory of Quantum Information (2018) as its educational anchor. A section-by-section bridge and four-label worked example lead into 30 intrinsic milestones: 12 on background and preliminaries, followed by 18 on the theorem, matching proofs, costs and interpretation. The route builds from local calculations to the complete scientific claim.
With Python 3.10 or later, no additional packages are needed:
python3 verification/check_science.py
python3 verification/check_learning.pyThe science suite independently checks phase ensembles, occupation blocks, Kraus admissibility and factorization, exact batch probabilities, classical posteriors, charged source-clock schedules and phase-cell diffusion. The learning checker checks the map's structure and navigation. The verification guide gives their finite scope. These checks support the derivations; they are not an asymptotic proof, hardware experiment or priority certificate.
The main result is a supplied-quantum-data copy advantage. Preparing a general hidden subset source is a separate operation and may require work growing with
The source clock counts acquisitions. Waiting does not reset a phase block for free. Known exact boundaries, a balanced support, a fixed cyclic phase order and a fixed success margin are material assumptions. The result does not cover arbitrary drifting phases, general mixed-state noise, unknown boundaries or a growing-
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.