Linear decomposition of approximate multi-controlled single qubit gates
Preprint
Abstract
We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and the previous best approximate approach without auxiliary qubits requires 32nk elementary operations, where k is a function that depends on the error threshold. The proposed decomposition depends on an optimization technique that minimizes the CNOT gate count for multi-target and multi-controlled CNOT and SU(2) gates. Computational experiments show the reduction in the number of CNOT gates to apply multi-controlled U(2) gates. As multi-controlled single-qubit gates serve as fundamental components of quantum algorithms, the proposed decomposition offers a comprehensive solution that can significantly decrease the count of elementary operations employed in quantum computing applications.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Linear-depth quantum circuits for multiqubit controlled gatesPhysical Review A, 2022
- A divide-and-conquer algorithm for quantum state preparationScientific Reports, 2021
- Quantum circuit optimization using quantum Karnaugh mapScientific Reports, 2020
- The bitter truth about gate-based quantum algorithms in the NISQ eraQuantum Science and Technology, 2020
- Circuit-Based Quantum Random Access Memory for Classical DataScientific Reports, 2019
- Decompositions of n-qubit Toffoli Gates with Linear Circuit ComplexityInternational Journal of Theoretical Physics, 2017
- Efficient quantum circuits for diagonal unitaries without ancillasNew Journal of Physics, 2014
- Linear-depth quantum circuits for-qubit Toffoli gates with no ancillaPhysical Review A, 2013
- Quantum-state preparation with universal gate decompositionsPhysical Review A, 2011
- Elementary gates for quantum computationPhysical Review A, 1995