How many quantum programs are needed to compose two unknown operations?
This project studies a processor supplied with copies of the Choi states of two arbitrary unknown
The optimal copy-product threshold at fixed error is
where
Canonical-Purification-Cost studies a related contraction problem with an exact prescribed output and independent state/conjugate samples. Its sharp unequal-budget frontier is derived from exact-output rigidity and a finite LP, with mixed-source costs given by an exact binomial transform. The shared mechanism is coherent contraction with physical whole-space normalization; the unitary-Choi theorem below is not a premise of that frontier. The comparison and transfer boundary fixes the different input correlations, exactness requirements and ownership.
| Result | Established guarantee | Scientific account |
|---|---|---|
| Collective composition | Global squared fidelity at least |
Construction |
| Arbitrary-processor converse |
|
Converse |
| Balanced copy cost | Optimal total copies of order |
Model |
| Explicit known-gate circuit | Approximately |
Implementation |
The lower bound holds for every allocation and dimension, including one copy of one program and order
A Bell contraction of one program pair gives the desired matrix product with probability
For the converse, a sufficiently accurate composer would distinguish inverse-correlated unknown operations from independent ones. Their averaged Choi inputs remain close when the product of copy budgets is small. Mixed-tensor symmetry makes this comparison valid without a stable-dimension assumption.
The related-work account credits Choi-state composition, pretty-good measurements, port-based teleportation, mixed Schur–Weyl duality and singular-value transformation. The contribution is the universal program-composition resource law and its construction/converse, rather than a new general measurement or representation-theory method.
Choose a route according to the question you want to answer:
| Reader's question | Starting point |
|---|---|
| What is the task, and what is proved? | Scientific account and exact model |
| How does a stored operation become a composed program? | Worked tutorial |
| Which foundations connect to the proofs? | Watrous bridge |
| How do the ideas fit into one learning route? | Learning guide and 30 milestones |
| How can I reproduce the finite checks? | Verification guide |
| Which contraction ideas apply to exact purification? | Canonical-purification boundary and sister project |
The single educational anchor is John Watrous's The Theory of Quantum Information (2018). The bridge identifies relevant sections and translates the Choi normalization and fidelity conventions. The specialist proofs remain in the scientific account.
From the repository root, with Python 3.11 or later:
python -m pip install -r verification/requirements.txt
python verification/check_construction.py
python verification/check_mixed_moments.py
python verification/check_projected_encoding.pyThese scripts check physical-register routing, Gram moments, mixed Choi ensembles and the projected circuit encoding in small dimensions. They do not constitute a proof of the asymptotic theorems or a simulation of a fault-tolerant implementation.
Both halves of each ideal pure Choi copy are accessible. The output is a quantum state encoding
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.