Real 3-qubit gate decompositions via triality
Brendan Pawlowski

TL;DR
This paper introduces a new decomposition method for real 3-qubit gates using triality symmetry, reducing the number of CNOT gates needed and advancing quantum circuit optimization.
Contribution
It presents a novel approach leveraging triality symmetry of PSO(8) to decompose real 3-qubit gates more efficiently than previous methods.
Findings
Any unimodular real 3-qubit gate can be decomposed with at most 14 CNOTs.
The method improves the previous bound of 16 CNOTs.
Utilizes the exotic triality symmetry of PSO(8) for gate decomposition.
Abstract
We show that any unimodular real 3-qubit gate can be expressed as the product of at most 14 CNOT gates plus single-qubit gates, improving on the bound of 16 CNOTs due to Wei and Di. Our method uses the exotic triality symmetry of , and we explore some of the useful properties of this map in relation to the study of real 3-qubit gates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
