Eq. (10), p. 3 — the operator of U(α) is |ψ_α⟩⟨ψ_α|, with ψ_α = (U(α) ⊗ 𝟙)|Φ⁺⟩|Φ⁺⟩
ProvedEntanglingOps.BinaryPhase.eq_10choi-jamiolkowskinonlocal-gatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Let (Eq. (9)) and let
be the state printed in Eq. (10), with the Bell states and . Then for every real :
- ;
- the operator of Eq. (4) of the map (qubits, ) is
This identifies the resource state the protocol consumes: one copy of is exactly what Eq. (6) needs to implement probabilistically.
Differences from the source:
- generalization: α = α_N = π/2^N → every real α; reason: the identity holds for every phase; α = α_N is an instance
- encoding: 'the corresponding operator E' of U(α_N) → choiOp of the one-element Kraus family {U(α)} (at d = 2, where |Φ⟩ of (5) is |Φ⁺⟩); reason: the map ρ ↦ UρU† has the single Kraus operator U; same object
- encoding: state vectors on A1A2B1B2 → functions on ((a1,a2),(b1,b2)), identity 1 stated entrywise; reason: Lean carrier convention; same vectors
Preamble
import Mathlib import Definitions.Def_EntanglingOps_BinaryPhase_Model
Formal statement
namespace EntanglingOps.BinaryPhase
open Matrix
open scoped Kronecker
/-- Eq. (10), p. 3: the resource state of the printed formula (10) is the gate `U(α)` of (9) on
`A₁B₁` applied to `|Φ⁺⟩_{A₁A₂}|Φ⁺⟩_{B₁B₂}` (entrywise, at `((a₁, a₂), (b₁, b₂))`), and the
operator `E_{A₁A₂,B₁B₂}` of Eq. (4) of the map `ρ ↦ U(α) ρ U(α)†` is `|ψ_α⟩⟨ψ_α|`. Stated for
every real `α` (the paper's `α_N` is one instance). -/
theorem eq_10 :
(∀ (α : ℝ) (x : (Fin 2 × Fin 2) × (Fin 2 × Fin 2)),
resource α x = ∑ y : Fin 2 × Fin 2,
gate α (x.1.1, x.2.1) y * phiPlus (y.1, x.1.2) * phiPlus (y.2, x.2.2)) ∧
(∀ α : ℝ, choiOp (fun _ : Unit => gate α) = vecMulVec (resource α) (star (resource α))) := by sorry
end EntanglingOps.BinaryPhase
Source
Cirac, Dür, Kraus, Lewenstein, Entangling operations and their implementation using a small amount of entanglement, arXiv:quant-ph/0007057v1, p. 3, Eqs. (9)–(10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.