Timeline for The weight distribution of uniformly random Clifford conjugation
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22 at 6:47 | comment | added | Chris Pattison | It might be easy to analyze by rephrasing the question in terms of the symplectic formalism (section 3.4 of Gottesman's thesis arxiv.org/abs/quant-ph/9705052). E.g. by sampling binary matrices** that act on the length-2n binary vector associated with a particular Pauli operator. ** Subject to an invertibility / full rank constraint so that there is a Clifford that implements that transformation | |
| Nov 21 at 21:32 | comment | added | forky40 | That's interesting. I guess if conjugation by a random Clifford does result in uniformly random Paulis, someone must have proven this at some point. | |
| Nov 21 at 19:59 | history | answered | Craig Gidney | CC BY-SA 4.0 |