The converse of unitary operator pushing
OpenQAlgorithms.Papers.Independent.Intakenext100.P95.unitary_pushing_converseLet be a nonzero linear map between finite-dimensional complex Hilbert spaces. Suppose that for every unitary on there exists a unitary on such that . Then
Consequently is an isometric tensor. The outgoing unitary may depend on the incoming unitary; injectivity of is not assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
namespace QAlgorithms.Papers.Independent.Intakenext100.P95
open scoped Matrix ComplexConjugate
noncomputable section
local instance (p : Prop) : Decidable p := Classical.propDecidable p
/-- PDF p.6, converse of (2.3): a nonzero tensor intertwining every incoming
unitary with some outgoing unitary has a positive scalar Gram matrix.
The outgoing unitary is chosen after the incoming one; injectivity is a conclusion. -/
theorem unitary_pushing_converse {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (T : Matrix B A ℂ) (hT : T ≠ 0)
(hpush : ∀ U : Matrix.unitaryGroup A ℂ, ∃ W : Matrix.unitaryGroup B ℂ,
T * (U : Matrix A A ℂ) = (W : Matrix B B ℂ) * T) :
∃ c : ℝ, 0 < c ∧ Tᴴ * T = (c : ℂ) • 1 := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P95
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite types , both with decidable equality, suppose is a nonzero complex matrix with rows indexed by and columns by , and suppose that for every unitary matrix on , there exists a unitary matrix on such that . Then there exists a real number such that
The unitary may depend on ; no single is required to work for every . The finite types may formally be empty, but if either is empty, every such matrix is zero, so the nonzero hypothesis is impossible.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.