Rakyta, Péter and Zimborás, Zoltán (2022) Approaching the theoretical limit in quantum gate decomposition. QUANTUM, 6. ISSN 2521-327X
|
Text
2109.06770.pdf Download (2MB) | Preview |
Abstract
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively. This is currently the lowest achieved gate count compared to other algorithms. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be adopted to sparse inter-qubit connectivity architectures provided by current mid-scale quantum computers, needing only a few additional $CNOT$ gates to be implemented in the resulting quantum circuits.
Item Type: | Article |
---|---|
Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QC Physics / fizika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 07 Nov 2022 09:54 |
Last Modified: | 07 Nov 2022 09:54 |
URI: | http://real.mtak.hu/id/eprint/153009 |
Actions (login required)
![]() |
Edit Item |