Dephasing finite-block quantum/classical testing converse
OpenQAlgorithms.Papers.Independent.Support50.P04.dephasing_testing_converseLet 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 and , let when and otherwise, for binary , and let . Classical testing is identified with diagonal density matrices. Assume and set and , where are the two phase Bell densities. Then
The equality identifies tests, not optimal code regions.
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.16, Eqs.(61)–(63): operational converse and exact
quantum-to-classical equality of tests; no equality of optimal coding regions. -/
theorem dephasing_testing_converse (gamma epsilon : ℝ)
(hg0 : 0 ≤ gamma) (hg1 : gamma ≤ 1) (he0 : 0 < epsilon) (he1 : epsilon < 1)
(n : ℕ) (hn : 0 < n) :
let qtest := QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma))))
(QAlgorithms.Papers.Independent.Information100.P60.copies n dephasingAlternative) epsilon
let ctest := QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (bscJoint gamma)) (QAlgorithms.Papers.Independent.Information100.P60.copies n bscAlternative) epsilon
unassistedBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon ≤ cppBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon ∧
cppBoundary (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)) n epsilon ≤ qtest / (n : EReal) ∧ qtest = ctest := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every , , and integer , define to preserve diagonal entries of a matrix and multiply off-diagonal entries by . Put , with , and . Let be the diagonal matrix on having diagonal entry at equal-bit pairs and at unequal-bit pairs, and put . Define
The assertion is
Tensor powers have entries equal to products of single-copy entries. For arbitrary matrices , equals when , and otherwise, where
Both capacity boundaries are extended-real suprema of real rates achievable with positive and entanglement fidelity at least ; that fidelity is overlap with the normalized maximally entangled state of dimension after applying the effective channel to its second half. For , channel encoders and decoders connect dimensions to the -qubit input and output. For , the encoder may additionally output a memory of any positive finite dimension, retained until decoding. Its decoder must factor through separate isometric embeddings of memory and output into positive dimensions , a two-factor map , tracing out the first factor, and a channel on the second. The map must be the stabilized trace-norm limit of total maps of a continuing sequence of finite positive-round local protocols, each successor extending every history by one round. At each history one party uses a countably indexed completely positive instrument and the other outcome-dependent channels; branch sums are summable on every input and preserve trace in total. The stabilized norm takes the supremum over density inputs with an equally dimensional reference. All channels are finite complete Kraus sums. Both endpoint values of are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.