§7.2: collective phase-flip qq capacity
OpenQAlgorithms.Papers.Independent.Support50.P02.phaseflip_qqLet and let act on the two input qubits by
where . Its unassisted qq capacity region, using separate encoders, untouched independent references, one joint decoder, and one squared joint fidelity, is
Here is binary entropy in bits. This is a full single-letter capacity equality, including and .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- Full single-letter qq capacity for the collective phase-flip channel,
PDF p.8 and §7.2 p.34; endpoints p=0,1 and p=1/2 are included. -/
theorem phaseflip_qq (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
qqMacCapacity (collectivePhase p) =
{r | Nonnegative r ∧ r.1 ≤ 1 ∧ r.2 ≤ 1 ∧ r.1 + r.2 ≤ 2 - binEntropy2 p} := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , let , where on Boolean pairs. The assertion is
where , using the total real logarithm, including at the endpoints. Here is the generation region: the closure of the nonnegative pairs such that, for every , there is such that every admits positive integers , a unit vector on an -dimensional reference and Boolean inputs, an independent unit vector on a -dimensional reference and Boolean inputs, and a decoding channel from the Boolean-pair outputs to an - by -dimensional output, satisfying
Registers are reordered to group the two references together and pair the two inputs at each channel use. The matrix has entries when both its row and column have equal reference and output labels, and zero otherwise; is defined likewise. The fidelity is , with square roots given by continuous functional calculus. A decoding channel has a finite Kraus representation with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.