Decomposition of Clifford Gates

Tefjol Pllaha; Kalle Volanto; Olav Tirkkonen

doi:10.1109/GLOBECOM46510.2021.9685501

Decomposition of Clifford Gates

Tefjol Pllaha, Kalle Volanto, Olav Tirkkonen

Communications Theory

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

1 Citation (Scopus)

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 language	English
Title of host publication	2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings
Publisher	IEEE
Number of pages	6
ISBN (Electronic)	978-1-7281-8104-2
DOIs	https://doi.org/10.1109/GLOBECOM46510.2021.9685501
Publication status	Published - 2021
MoE publication type	A4 Article in a conference publication
Event	IEEE Global Communications Conference - Madrid, Spain Duration: 7 Dec 2021 → 11 Dec 2021 https://globecom2021.ieee-globecom.org/

Publication series

Name	2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

Conference

Conference	IEEE Global Communications Conference
Abbreviated title	GLOBECOM
Country/Territory	Spain
City	Madrid
Period	07/12/2021 → 11/12/2021
Internet address	https://globecom2021.ieee-globecom.org/

Access to Document

10.1109/GLOBECOM46510.2021.9685501

OpenUrl availability

Full text

Cite this

@inproceedings{94b075f419414139bfcb17e0959bd384,

title = "Decomposition of Clifford Gates",

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.",

author = "Tefjol Pllaha and Kalle Volanto and Olav Tirkkonen",

note = "Funding Information: ACKNOWLEDGEMENTS This work was funded in part by the Academy of Finland (grant 334539). Publisher Copyright: {\textcopyright} 2021 IEEE.; IEEE Global Communications Conference, GLOBECOM ; Conference date: 07-12-2021 Through 11-12-2021",

year = "2021",

doi = "10.1109/GLOBECOM46510.2021.9685501",

language = "English",

series = "2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings",

publisher = "IEEE",

booktitle = "2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings",

address = "United States",

url = "https://globecom2021.ieee-globecom.org/",

}

TY - GEN

T1 - Decomposition of Clifford Gates

AU - Pllaha, Tefjol

AU - Volanto, Kalle

AU - Tirkkonen, Olav

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85127223330&partnerID=8YFLogxK

U2 - 10.1109/GLOBECOM46510.2021.9685501

DO - 10.1109/GLOBECOM46510.2021.9685501

M3 - Conference contribution

AN - SCOPUS:85127223330

T3 - 2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

BT - 2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

PB - IEEE

T2 - IEEE Global Communications Conference

Y2 - 7 December 2021 through 11 December 2021

ER -

Decomposition of Clifford Gates

Abstract

Publication series

Conference

Access to Document

OpenUrl availability

Other files and links

Fingerprint

QC3: Quantum-Classical Coding and Communications

Cite this

Decomposition of Clifford Gates

Abstract

Publication series

Conference

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Projects

QC3: Quantum-Classical Coding and Communications

Cite this