Theorem 5 — phase-state mixing is an abelian random walk
OpenQSDMixing.GU.Supplement.phase_state_abelian_walkfourier-analysismarkov-chainp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-mixing-timequantum-state-discrimination
Let be a finite abelian group, let the finite group act faithfully on , and consider the phase-state GU ensemble generated by and a unit vector whose stabilizer is the embedded copy of . Let be the character group, with its character-multiplication group law.
There is a unique probability law on with Fourier transform
If and for i.i.d. increments , then for every ,
Differences from the source:
- encoding: , , and its character group → an abstract finite group with an injective action into
MulAut (Multiplicative A), the corresponding semidirect product, and an additive-group equivalence with the characters ; reason: this is a coordinatization of the same faithful action, semidirect product, and Pontryagin dual including its group law - encoding: i.i.d. random variables and their sum → the convolution law with the time-zero point mass at zero; reason: on a finite abelian group this is exactly the law of the displayed random walk
- reading: the minimum in equation (22) has no displayed lower endpoint → integers , with if no time qualifies; reason: the paper's natural-number convention in equation (52) starts at one
Preamble
import Mathlib import Definitions.Def_GaussTesting_Ell2 import Definitions.Def_QSDMixing_GU_stabilizer import Definitions.Def_QSDMixing_GU_tMin import Definitions.Def_QSDMixing_GU_Supplement_FiniteProbability set_option autoImplicit false open GaussTesting (Ell2)
Formal statement
namespace QSDMixing.GU.Supplement
/-- **Theorem 5, pp.22--23.** For the phase-state GU ensemble generated by the semidirect
product `A ⋊ K`, the unique Bochner probability law on the character group has Fourier transform
`a ↦ ⟨ψ₀,U_aψ₀⟩`. If `Z₀=0` and `Z_t` is the sum of `t` i.i.d. increments with this law, then the
quantum mixing time equals the least positive `t` for which the law of `Z_t` is within `ε` in
ℓ¹ distance of the uniform law.
Zhou, Leditzky, *A mixing time method for estimating the sample complexity of quantum state
discrimination*, arXiv:2609.40182 (held version, sha256 62fb68dd…), Theorem 5,
pp.22--23, eqs. (21)--(22). -/
theorem phase_state_abelian_walk {A K Ahat ι : Type} [AddCommGroup A] [Fintype A]
[Group K] [Fintype K] [AddCommGroup Ahat] [Fintype Ahat]
(action : K →* MulAut (Multiplicative A))
(haction : Function.Injective action)
[Finite (Multiplicative A ⋊[action] K)]
(dual : Ahat ≃+ AddChar A (unitary ℂ))
(U : (Multiplicative A ⋊[action] K) →* unitary (Ell2 ι →L[ℂ] Ell2 ι))
(ψ₀ : Ell2 ι) (hψ₀ : ‖ψ₀‖ = 1)
(hstabilizer : QSDMixing.GU.stabilizer U ψ₀ = SemidirectProduct.inr.range) :
∃ p : FiniteProbability Ahat,
(∀ a : A,
(inner ℂ ψ₀ ((U (SemidirectProduct.inl (Multiplicative.ofAdd a)) :
Ell2 ι →L[ℂ] Ell2 ι) ψ₀) : ℂ) =
∑ χ, (p χ : ℂ) * (((dual χ a : unitary ℂ) : ℂ))) ∧
(∀ q : FiniteProbability Ahat,
(∀ a : A,
(inner ℂ ψ₀ ((U (SemidirectProduct.inl (Multiplicative.ofAdd a)) :
Ell2 ι →L[ℂ] Ell2 ι) ψ₀) : ℂ) =
∑ χ, (q χ : ℂ) * (((dual χ a : unitary ℂ) : ℂ))) → q = p) ∧
∀ ε : ℝ, 0 < ε → ε < 1 →
QSDMixing.GU.tMin U ψ₀ ε = abelianMixingTime p ε := by sorry
end QSDMixing.GU.Supplement
Source
Zhou, Leditzky, A mixing time method for estimating the sample complexity of quantum state discrimination, arXiv:2609.40182 (held version, sha256 62fb68dd…), Theorem 5, pp.22–23, eqs. (21)–(22)