Manuscript I@2 · I.tex · theorem · 85631fa7
Theorem: Uniform correlations
Locality and uniform correlations · lines 1461–1509 · proof included or linked
I@2#thm:uniformity
Assume . If
where the computational strings are distinct and the computational strings are distinct, then is uniform on .
Proof. A diagonal environment unitary removes the phases without changing the -law. Write
Nullity restricts to . Composability gives
For a permutation of , extend it to a computational-basis permutation unitary on . Then
The same vector is , where is an environment unitary sending to . Its -law remains , by invariance under . Its -law remains , by invariance under .
For the new pairing, nullity and composability imply
Every permutation preserves , so .
Displayed formulas in this passage
unlabeled · line 1465
unlabeled · line 1479
unlabeled · line 1485
unlabeled · line 1494
unlabeled · line 1505