Watrous amplitude-product unitaries fail closure under composition and inverse
ProvedQAlgorithms.Papers.Independent.Intakethird100.P96.watrous_nonclosureFix a cyclic binary chain of length and its computational basis. A matrix is of Watrous form if a single translation-invariant local amplitude function satisfies . Allow to be the whole ring, so this includes every smaller neighborhood. Let be the tensor product of single-qubit Hadamards, and let be the product of controlled-phase gates on all adjacent pairs. Then are unitary and
Here denotes the matrices of Watrous form in this fixed basis. Thus composing two such unitaries can leave the class, and a member of the class can have its inverse outside it. The ring length is encoded as with .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P96
noncomputable section
open scoped TensorProduct Kronecker BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P96
open QAlgorithms.Papers.Independent.Information100.P26 (Mat)
/-- §V.B, PDF pp.14--15: WQCA unitaries fail closure under product and inverse.
Phase pi and ring length at least five avoid the trivial short rings. -/
theorem watrous_nonclosure (extra : ℕ) :
ringHadamard extra ∈ Matrix.unitaryGroup (RingConfiguration extra) ℂ ∧
ringPhase extra ∈ Matrix.unitaryGroup (RingConfiguration extra) ℂ ∧
IsWatrous extra (ringHadamard extra) ∧
IsWatrous extra (ringPhase extra) ∧
¬ IsWatrous extra (ringPhase extra * ringHadamard extra) ∧
IsWatrous extra (star (ringPhase extra * ringHadamard extra)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P96
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , put and let be the Boolean configurations on . Define complex matrices indexed by by
where neighboring positions are interpreted modulo . Say that a matrix has the factorization property if there exists such that for all configurations , with position addition modulo and no further restrictions on . The assertion is that and are both unitary, each has this factorization property, their ordinary matrix product does not have this property, and the conjugate transpose does have this property. Each affirmative factorization may use its own function , and the assertion includes , corresponding to five positions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.