BROWSE
Detail
Journal Article
MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
- Authors
- Jongheon Lee, Yousung Kang, You-Seok Lee, Boheung Chung, Dooho Choi
- Issue Date
- 2023-10
- Citation
- Quantum Information Processing, v.22, pp.1-31
- ISSN
- 1570-0755
- Publisher
- Kluwer Academic Publishers
- Language
- English
- Type
- Journal Article
- Abstract
- We propose a method for efficient mixed polarity multiple controlled Toffoli (MPMCT) gate decomposition from the perspective of a cost metric related to Toffoli gates, namely Toffoli-depth. When using the technique presented in a previous study, there is a range in which Toffoli-depth (consequently T-depth) of the implemented circuit increases proportionally as the number of provided (clean) work qubits increases. In other words, using the previous technique may result in more inefficient MPMCT gates even though the number of helpful work qubits has increased. In this work, a technique is devised to provide sufficient help from clean work qubits at the central part of the implemented circuit as many as possible, thereby addressing the issues with the previous technique. Meanwhile, one of the representative algorithms that use MPMCT gates is Grover’s algorithm. We show the implementation results for MPMCT gates according to the number of work qubits, using Grover’s algorithm as an example. It is experimentally demonstrated that T-depth decreases much more quickly when using our method than the previous method.
- KSP Keywords
- Decomposition method, T-depth, mixed polarity
This work is distributed under the term of Creative Commons License (CCL)
(CC BY)
(CC BY)
