Relative error of N to L mixed-state cloning
OpenQAlgorithms.Papers.Independent.Intakenext100.P97.n_to_l_cloning_lowerBoundAll states are positive semidefinite, trace-one matrices, including pure and rank-deficient states. Write for squared Uhlmann fidelity, , and .
Let , let be density operators on , and let be integers, with . An arbitrary finite-dimensional environment and normalized ancillas on are allowed. Fix a common unitary on , and set and . With
both regimes satisfy
Furthermore, for every density operator on , the choice and gives . This extends the bound and the full-information example to multiple original and additional copies.
Formalization Note The ideal -copy matrix is grouped as its first and last factors, using exact entrywise tensor powers.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P97
noncomputable section
open scoped Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Intakenext100.P97
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity sineDistance receiverChannel)
open QAlgorithms.Papers.Independent.Dependency50.P48 (densityPower)
/-- PDF p.4, §IV, Eq. (23) and the full-information example after it.
There are `N ≥ 1` original copies and `M ≥ 1` additional copies, `L=N+M`.
The example uses identity evolution; arbitrary evolution could spoil the clones. -/
theorem n_to_l_cloning_lowerBound {d N M : ℕ} (hd : 1 < d)
(hN : 1 ≤ N) (hM : 1 ≤ M)
{E : Type*} [Fintype E] [DecidableEq E] [Nonempty E]
(rho1 rho2 : Matrix (Fin d) (Fin d) ℂ)
(tau1 tau2 : Matrix ((Fin M → Fin d) × E) ((Fin M → Fin d) × E) ℂ)
(V : Matrix.unitaryGroup (((Fin N → Fin d) × (Fin M → Fin d)) × E) ℂ)
(hrho1 : IsDensityMatrix rho1) (hrho2 : IsDensityMatrix rho2)
(htau1 : IsDensityMatrix tau1) (htau2 : IsDensityMatrix tau2)
(hdistinct : rho1 ≠ rho2) :
let f := rootFidelity rho1 rho2
let phi := rootFidelity tau1 tau2
(f ^ M ≤ phi ∧ phi ≤ 1 →
cloningBound N M f phi ≤ copiesError N M rho1 rho2 tau1 tau2 V) ∧
(0 ≤ phi ∧ phi ≤ f ^ M → 0 ≤ copiesError N M rho1 rho2 tau1 tau2 V) ∧
(∀ sigma : Matrix E E ℂ, IsDensityMatrix sigma →
copiesError N M rho1 rho2
(Matrix.kronecker (densityPower rho1 M) sigma)
(Matrix.kronecker (densityPower rho2 M) sigma) 1 = 0) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P97
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with , , and ; let be a finite nonempty type with decidable equality; let be positive semidefinite complex matrices of trace ; let be positive semidefinite matrices of trace on ; and let be any unitary on . For , define , and put
For auxiliary matrices on the same registers as the , define
where partial trace sums entries with equal coordinates. The theorem asserts all three statements
In the last equality evolution is the identity, independently of the originally supplied . The boundary belongs to both implications. Matrix square roots use real continuous functional calculus; real square roots of nonpositive numbers and division by zero return zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.