Projects per year
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.
|Title of host publication||2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings|
|Number of pages||6|
|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
|Name||2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings|
|Conference||IEEE Global Communications Conference|
|Period||07/12/2021 → 11/12/2021|
FingerprintDive into the research topics of 'Decomposition of Clifford Gates'. Together they form a unique fingerprint.
- 1 Active
QC3: Quantum-Classical Coding and Communications
Tirkkonen, O., Pllaha, T., Lietzen, J., Vehkalahti, R. & Bayanifar, M.
01/09/2020 → 31/08/2024
Project: Academy of Finland: Other research funding