Standard mixed-state cloning with a common ancilla
OpenQAlgorithms.Papers.Independent.Intakenext100.P97.standard_cloning_lowerBoundAll states are positive semidefinite, trace-one matrices, including pure and rank-deficient states. Write for squared Uhlmann fidelity, , and .
Let with and let be two density operators on . The auxiliary register is arbitrary finite dimensional, with no dimension bound. For density operators on , where , fix one unitary on for both labels. Set , , and
The initial state factors between the input and the whole ancilla; the ancilla may be mixed and correlated across and . Distinct inputs ensure a positive denominator.
If both labels use the same normalized ancillary state , then
This is the standard-cloning bound for arbitrary mixed input states. The common ancilla need not be pure or factor between blank and environment.
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. (22). Standard cloning uses the same normalized
ancilla for both labels; the blank and environment need not be independent. -/
theorem standard_cloning_lowerBound {d : ℕ} (hd : 1 < d)
{E : Type*} [Fintype E] [DecidableEq E] [Nonempty E]
(rho1 rho2 : Matrix (Fin d) (Fin d) ℂ)
(tau : Matrix (Fin d × E) (Fin d × E) ℂ)
(V : Matrix.unitaryGroup ((Fin d × Fin d) × E) ℂ)
(hrho1 : IsDensityMatrix rho1) (hrho2 : IsDensityMatrix rho2)
(htau : IsDensityMatrix tau) (hdistinct : rho1 ≠ rho2) :
standardBound (rootFidelity rho1 rho2) ≤ oneToTwoError rho1 rho2 tau tau V := 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 a natural number, let be a finite nonempty type with decidable equality, let be positive semidefinite complex matrices of trace , let be a positive semidefinite matrix of trace on , and let be any unitary on . Define
and , where partial trace sums entries with equal last-register coordinates. The theorem asserts
The same and are used for both inputs. Matrix square roots use real continuous functional calculus, and any quotient with zero denominator is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.