2000 character limit reached
Decomposition of Clifford Gates (2102.11380v1)
Published 5 Feb 2021 in quant-ph, cs.IT, and math.IT
Abstract: In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of Clifford transvections. The algorithm can be directly used for finding all Pauli matrices that commute with any given Clifford gate. To achieve this goal, we exploit the structure of the symplectic group with a novel graphical approach.