Back to Search
Start Over
Decomposing (n+1)$(n+1)$‐Qubit Toffoli Gate with Shallow Circuit Depth and No Ancilla.
- Source :
- Advanced Quantum Technologies; Feb2024, Vol. 7 Issue 2, p1-7, 7p
- Publication Year :
- 2024
-
Abstract
- Circuit depth optimization is crucial for implementing quantum algorithms in practical systems. The decomposition of (n+1)$(n+1)$‐qubit Toffoli gate is continually optimized since this gate is a fundamental component for many quantum algorithms. Without any ancilla, (n+1)$(n+1)$‐qubit Toffoli gate can be decomposed by standard gates with circuit depth 33n−47$33n-47$. Here, the decomposition is further optimized and its circuit depth is reduced to 17n−38$17n-38$. The decomposition is equivalent to (n+1)$(n+1)$‐qubit Toffoli gate up to an overall phase and also does not need any ancilla. [ABSTRACT FROM AUTHOR]
- Subjects :
- CIRCUIT complexity
QUANTUM computing
Subjects
Details
- Language :
- English
- ISSN :
- 25119044
- Volume :
- 7
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Advanced Quantum Technologies
- Publication Type :
- Academic Journal
- Accession number :
- 175365654
- Full Text :
- https://doi.org/10.1002/qute.202300370