§VII.C, Fig.7: a PPT and NS operation requiring quantum forward assistance
OpenQAlgorithms.Papers.Independent.Support50.P11.bonus_operation_requires_quantum_forward_channelDefine a two-qubit-input bipartite operation as follows. Bob measures his input in the computational basis to obtain , chooses an independent uniform bit , and outputs . Alice measures her input in the computational basis when and the Hadamard basis when , obtains , and outputs . Then is CPTP, PPT-preserving and non-signalling in both directions. For every exact forward realization of this fixed operation using positive finite side registers, CPTP encoder , side channel and decoder ,
with the tensor reordering specified in the definition, there exist CPTP maps with
In particular cannot be Horodecki. This is the separately defined operation of Fig.7, with a conclusion quantified over every exact forward implementation.
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
/-- PDF pp.12--13, section VII.C, Fig.7: this independently defined CPTP, PPT,
non-signalling operation forces every exact forward side channel to transmit a qubit
perfectly. This conclusion is not asserted for the different operation of Example 9. -/
theorem bonus_operation_requires_quantum_forward_channel :
IsChannel bonusOperation ∧ NSBA bonusOperation ∧ NSAB bonusOperation ∧ PPTMap bonusOperation ∧
∀ q r : ℕ, 0 < q → 0 < r →
∀ E : Superop (Fin 2) (Fin 2 × Fin q),
∀ F : Superop (Fin q) (Fin r), ∀ D : Superop (Fin r × Fin 2) (Fin 2),
IsChannel E → IsChannel F → IsChannel D → forwardOp E F D = bonusOperation →
PerfectQubit F ∧ ¬ Horodecki F := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For indices , define and , and define a map on matrices indexed by by
This map is a channel: it has a finite representation with . There exist channels such that, for every matrix , and ; also is a channel, where . Furthermore, for every pair of positive natural numbers and every three maps
if all three are channels and the map obtained by applying to the first input subsystem, to the -dimensional part of its output, and to that transmitted part together with the second input subsystem equals , then there exist channels and such that for every complex matrix . Precisely, the assumed composition is
with the factors reassociated in the indicated order. In addition, it is false that is a channel whose Choi matrix has positive semidefinite second-subsystem transpose ; since is already assumed to be a channel, this says is not positive semidefinite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.