Data processing of fidelity under the partial trace
ProvedMixedCloning.Optimal.fidelity_le_partialTracedata-processingfidelityquantum-channels
Let and be finite sets, let , and consider registers with and . Let be the squared fidelity. For all positive semidefinite on ,
This is the data-processing inequality for fidelity [Wat18, Theorem 3.27], specialized to the channel that traces out the auxiliary registers. The source uses it in the proofs of Proposition 10 (p. 16) and Proposition 25 (p. 27) to pass from purified outputs to the original registers.
Formalization Note The partial trace is the platform function partialTrace m, which keeps the register order . The inequality is stated for squared fidelity; it is equivalent to the root-fidelity form because root fidelity is nonnegative.
Differences from the source:
- specialization: an arbitrary channel → the partial trace over ; reason: this is the instance used in the source
Preamble
import Definitions.Def_MixedCloning_Optimal_Model noncomputable section open Matrix MeasureTheory open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
Formal statement
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Data processing of fidelity [Wat18, Theorem 3.27], used on PDF p.16 (and p.27), for the
partial trace over the auxiliary registers `B_1,…,B_m`. -/
theorem fidelity_le_partialTrace {a b : Type} [Fintype a] [DecidableEq a] [Fintype b] [DecidableEq b] (m : ℕ)
(X Y : Op (Word (a × b) m)) (hX : X.PosSemidef) (hY : Y.PosSemidef) :
fidelity X Y ≤ fidelity (partialTrace m X) (partialTrace m Y) := by sorry
end MixedCloning.Optimal
Source
John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, Theorem 3.27 (monotonicity of fidelity under channels), https://doi.org/10.1017/9781316848142; used as 'data processing of fidelity [Wat18, Theorem 3.27]' in Dmitry Grinko, Marco Fanizza, Thilo Scharnhorst, Jack Spilecki, Optimal cloning of mixed states, STOC 2027 submission #243 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/243.pdf, p. 16 (proof of Proposition 10) and p. 27 (proof of Proposition 25).