Decomposition of Clifford Gates

Tefjol Pllaha, Kalle Volanto, Olav Tirkkonen

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

Abstract

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
PublisherIEEE
Number of pages6
ISBN (Electronic)9781728181042
DOIs
Publication statusPublished - 2021
MoE publication typeA4 Article in a conference publication
EventIEEE Global Communications Conference - Madrid, Spain
Duration: 7 Dec 202111 Dec 2021
https://globecom2021.ieee-globecom.org/

Publication series

Name2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

Conference

ConferenceIEEE Global Communications Conference
Abbreviated titleGLOBECOM
Country/TerritorySpain
CityMadrid
Period07/12/202111/12/2021
Internet address

Fingerprint

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

Cite this