Unassisted codes embed in cpp codes
ProvedQAlgorithms.Papers.Independent.Support50.P04.unassisted_in_cppLet be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write and for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension , rate , and squared fidelity to the normalized maximally entangled target at least . A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. For every actual unassisted encoder/decoder code for one possibly blocked channel , there is an actual cpp code with
Thus every feasible unassisted rate/error pair remains feasible with cpp assistance.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms
namespace QAlgorithms.Papers.Independent.Support50.P04
variable {A B E : Type} [Fintype A] [DecidableEq A]
variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- arXiv:1504.04617v2, PDF p.10: every actual unassisted code is a cpp code
with one-dimensional sender memory, preserving the SAME message size and fidelity. -/
theorem unassisted_in_cpp [Nonempty A] [Nonempty B]
(N : Superop A B) (hN : IsChannel N) (C : QAlgorithms.Papers.Independent.Information100.P80.TransmissionCode A B) :
∃ D : CppCode A B, D.q = 1 ∧ D.M = C.M ∧
cppFidelity N D = QAlgorithms.Papers.Independent.Information100.P80.transmissionFidelity N C := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary finite nonempty types with decidable equality, let be a channel from matrices on to matrices on , and let consist of a positive integer , a channel , and a channel . Here a channel is a map with a finite Kraus representation , . Define
The theorem asserts that there is another code with retained-memory dimension exactly , logical dimension exactly , a channel , and a channel , whose fidelity is exactly , where its effective map first applies , swaps the output factors, applies , and then applies , and its fidelity uses the same displayed expression with that effective map. In addition, must satisfy the receiver restriction: there exist positive integers , isometries , , a map on , and a channel , such that . The condition on is a limit of compatible finite local histories: an instrument has completely positive complex-linear branches, summable branch outputs for every matrix, and a trace-preserving total; complete positivity requires positivity under every finite identity amplification. A local round has tensor-product branches, one party’s maps forming a countable-outcome instrument and the other party’s maps being channels conditional on that outcome. Raw histories start with one local round and extend by an outcome-dependent local round on every previous history, with the fixed pairing of natural-number labels. There must be raw instruments , each with a positive finite number of rounds and with extending by one round, and single-outcome instruments coarse-grained from by summing over fibers of outcome-label functions, such that
Here . The assertion is exact equality of fidelities and dimensions; no error parameter or asymptotic limit is involved.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.