Manuscript Oai272-A@1 · Oai272-A.tex · theorem · a40828a0

Theorem: A PPT pair gives a 2d+1-dimensional channel

The channel-completion interface · lines 1227–1287 · proof included or linked

Oai272-A@1#thm:completion, Oai272-A@1#eq:completion, Oai272-A@1#eq:corner

Back to manuscript

Let be PPT. There are explicit and a trace-preserving PPT channel whose squared Choi matrix has a coordinate-local corner equal to . If is entangled, is not entanglement breaking.

Proof. Set

Since ,

Use the real coordinate inclusions in

Write . Define

The moving terms are CP. Each flag term is a positive-effect measurement followed by a fixed preparation, hence CP. The identities prove trace preservation.

Output transpose replaces by in the moving branches and fixes . All branches remain CP, so is PPT. This uses ordinary complex-linear transpose; it does not conjugate the scalar flag coefficient.

The flag is absorbing. For every ,

Expanding in input matrix units gives

Local compression preserves separability. Therefore a separable would force separability of its entangled corner, a contradiction.

Displayed formulas in this passage

  • Oai272-A@1#eq:completion · line 1255

  • Oai272-A@1#eq:corner · line 1279

  • unlabeled · line 1238

  • unlabeled · line 1242

  • unlabeled · line 1246

  • unlabeled · line 1250

  • unlabeled · line 1275

Nearby in this section