Decomposition of Clifford Gates

Tefjol Pllaha, Kalle Volanto, Olav Tirkkonen

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

2 Citations (Scopus)


In fault-tolerant quantum computation and quan-tum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. This information is encoded by the support (Pllaha et al., 2020) of the given circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a minimal product of Clifford transvections. The algorithm can be directly used for computing the support of any given Clifford gate. To achieve this goal, we exploit the structure of the symplectic group with a novel graphical approach.

Original languageEnglish
Title of host publication2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings
Number of pages6
ISBN (Electronic)978-1-7281-8104-2
Publication statusPublished - 2021
MoE publication typeA4 Conference publication
EventIEEE Global Communications Conference - Madrid, Spain
Duration: 7 Dec 202111 Dec 2021

Publication series

Name2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings


ConferenceIEEE Global Communications Conference
Abbreviated titleGLOBECOM
Internet address


Dive into the research topics of 'Decomposition of Clifford Gates'. Together they form a unique fingerprint.

Cite this