A mixed-state counterexample to square-root optimality of transpose recovery
ProvedQAlgorithms.Papers.Independent.Support50.P44.transpose_not_square_root_optimalOn three qubits let . Let be its transpose recovery map. Let measure in the computational basis, prepare on outcome , and prepare the uniform mixture on on outcome . Both maps are CPTP, and
Writing and analogously, with root fidelity, one has
Here is the supremum over all CPTP recovery channels. Thus the square-root optimum bound fails for mixed states. The definition of includes zero action on off-diagonal matrix units.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P44
open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)
open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)
open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)
open Filter
open scoped ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable {A B C E G : Type*}
/-- PDF p.28, Appendix F, (169)–(171): the concrete mixed-state counterexample,
with both decimals. Rendered p.28 confirms 0.9829 bounds F itself, whereas 0.9696
bounds sqrt(F). The map R has been defined on off-diagonal inputs as well. -/
theorem transpose_not_square_root_optimal :
IsDensityMatrix counterexampleState ∧ IsChannel counterexampleRecovery ∧
IsChannel counterexampleTranspose ∧
counterexampleTranspose (Matrix.single false false 1) =
Matrix.diagonal (fun z => if z = (false,false) then (5/6 : ℂ)
else if z = (false,true) then (1/6 : ℂ) else 0) ∧
counterexampleTranspose (Matrix.single true true 1) =
Matrix.diagonal (fun z => if z.1 then (1/2 : ℂ) else 0) ∧
9829/10000 < rootFidelity counterexampleState
(idTensorSuperop counterexampleRecovery (marginalAB counterexampleState)) ∧
Real.sqrt (rootFidelity counterexampleState
(idTensorSuperop counterexampleTranspose (marginalAB counterexampleState))) < 9696/10000 ∧
rootFidelity counterexampleState
(idTensorSuperop counterexampleRecovery (marginalAB counterexampleState)) ≤
finiteRecoveryFidelity counterexampleState ∧
Real.sqrt (rootFidelity counterexampleState
(idTensorSuperop counterexampleTranspose (marginalAB counterexampleState))) <
finiteRecoveryFidelity counterexampleState := by sorry
end QAlgorithms.Papers.Independent.Support50.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let each have basis , corresponding to false and true. Define the diagonal matrix on by , for every , and all remaining entries zero. Define a map from matrices on to matrices on by making diagonal, with entry at and entry at each other basis index. Define another such map by , where, in the order , and . The assertion is that is positive semidefinite with trace one, and both and are channels: each admits finitely many matrices satisfying and mapping every matrix to . Moreover, and . Write , and let mean applying separately to each matrix block indexed by . For matrices on the same space, set , with the square roots interpreted by continuous functional calculus, and set , where the supremum ranges over all channels in the finite Kraus sense just specified. Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.