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

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

1 Sitaatiot (Scopus)

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings
Kustantaja	IEEE
Sivumäärä	6
ISBN (elektroninen)	978-1-7281-8104-2
DOI - pysyväislinkit	https://doi.org/10.1109/GLOBECOM46510.2021.9685501
Tila	Julkaistu - 2021
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	IEEE Global Communications Conference - Madrid, Espanja Kesto: 7 jouluk. 2021 → 11 jouluk. 2021 https://globecom2021.ieee-globecom.org/

Julkaisusarja

Nimi	2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

Conference

Conference	IEEE Global Communications Conference
Lyhennettä	GLOBECOM
Maa/Alue	Espanja
Kaupunki	Madrid
Ajanjakso	07/12/2021 → 11/12/2021
www-osoite	https://globecom2021.ieee-globecom.org/

Pääsy asiakirjaan

10.1109/GLOBECOM46510.2021.9685501

OpenUrl-saatavuus

Koko teksti

Muut tiedostot ja linkit

Linkki julkaisuun Scopuksessa

QC3: Quantum-Classical Coding and Communications
Tirkkonen, O., Pllaha, T., Lietzen, J., Vehkalahti, R. & Bayanifar, M.
01/09/2020 → 31/08/2024
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@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

Abstrakti

Julkaisusarja

Conference

Pääsy asiakirjaan

OpenUrl-saatavuus

Muut tiedostot ja linkit

Sormenjälki

Projektit

QC3: Quantum-Classical Coding and Communications

Siteeraa tätä