Relative-error lower bound for two mixed-state clones
OpenQAlgorithms.Papers.Independent.Intakenext100.P97.cloning_relative_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.
For every such common-unitary device, both of the following bounds hold:
This bounds the relative error using the distinguishability of the input states and of the entire ancillary states.
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 pp.3--4, §IV, Theorem (i)--(ii), Eq. (15).
Both regimes are retained, including orthogonal inputs; identical inputs
are excluded because Eq. (14) has no ratio meaning there. -/
theorem cloning_relative_lowerBound {d : ℕ} (hd : 1 < d)
{E : Type*} [Fintype E] [DecidableEq E] [Nonempty E]
(rho1 rho2 : Matrix (Fin d) (Fin d) ℂ)
(tau1 tau2 : Matrix (Fin d × E) (Fin d × E) ℂ)
(V : Matrix.unitaryGroup ((Fin d × 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 ≤ phi ∧ phi ≤ 1 → cloningBound 1 1 f phi ≤ oneToTwoError rho1 rho2 tau1 tau2 V) ∧
(0 ≤ phi ∧ phi ≤ f → 0 ≤ oneToTwoError rho1 rho2 tau1 tau2 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 positive semidefinite matrices of trace on , and let be any unitary on . Define
and let , with coordinates grouped as , where partial trace sums entries with equal coordinates. Put
The theorem asserts both implications
The boundary is included in both conditions. All square roots and divisions use the total real operations, with division by zero equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.