Theorem 10: the noisy conjugate contains a reversible copy of every input
ProvedQAlgorithms.Papers.Independent.Gap48.P36.noisy_reversible_copyAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let be a basis of unitaries on , including , with . Write for the canonical conjugate using Kraus matrices , and . There is one unitary , independent of the density matrix , such that
Mixed inputs are included. This displays a reversible copy of every input in the environment.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Theorem 10, PDF p.19: one unitary before all density inputs, including mixed inputs.
U is rectangular only in its labeling: the two dimensions are both d^2. -/
theorem noisy_reversible_copy [Nonempty A] [Nonempty K] (T : UnitaryBasis A K) :
∃ U : Matrix K (A × A) ℂ, Uᴴ * U = 1 ∧ U * Uᴴ = 1 ∧
∀ rho : Matrix A A ℂ, IsDensityMatrix rho →
noisyComplement T.matrix rho = U * (((Fintype.card A : ℂ)⁻¹ • (1 : Matrix A A ℂ)) ⊗ₖ rho) * Uᴴ := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality and . Suppose matrices on have a specified identity label and satisfy , , , and for and otherwise. Define the matrix-valued map
Then there exists a complex matrix with rows indexed by and columns indexed by such that
for every positive semidefinite matrix on with trace . The same works for every such , and dimension is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.