§V (46): quantum/classical fidelity correspondence for EA and NS
OpenQAlgorithms.Papers.Independent.Support50.P11.quantum_classical_fidelityLet be a finite-dimensional CPTP channel and . Let be the optimal normalized channel fidelity for a -dimensional quantum system, and let be the optimal average success probability for equiprobable computational-basis messages, both optimized over actual codes in class . Then
This is exact fidelity preservation for the two operational classes used in the paper. No unspecified conversion loss is introduced.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
section Statements
variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
/-- PDF p.8, (46), supported by Appendix B, pp.14--15: exact classical/quantum
performance correspondence for the two named operational classes EA and NS. -/
theorem quantum_classical_fidelity
(N : Superop I O) (hN : IsChannel N) (K : ℕ) (hK : 0 < K) :
optimalCodeFidelity .EA N K = optimalClassicalCodeFidelity .EA N (K * K) ∧
optimalCodeFidelity .NS N K = optimalClassicalCodeFidelity .NS N (K * K) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite input and output index types, let be a channel, and let be an integer. Here a channel is a map for a finite family with . For a positive integer , consider channels satisfying for every , for some channel . In the entanglement-assisted class, additionally require finite positive integers , a positive semidefinite trace-one matrix on , and channels , , such that acts by adjoining , regrouping as , and applying . In the non-signalling class, instead additionally require a channel satisfying for every . For either class , define as the real supremum, over its codes, of , and define as the real supremum of , where projects onto and
The assertion is
Thus both equalities compare a code with quantum index size to a classical-success optimization with index size exactly , including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.