Linear decomposition of approximate multi-controlled single qubit gates
arXiv:2310.14974 · doi:10.1109/TCAD.2024.3471905
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.
References in corpus (15)
- Quantum Computing in the NISQ era and beyond
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Synthesis of Quantum Logic Circuits
- Quantum Error Mitigation
- Quantum-state preparation with universal gate decompositions
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Quantum Circuits for Isometries
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Efficient fault-tolerant quantum computing
- Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
- Linear-depth quantum circuits for multiqubit controlled gates
- Quantum Circuits for Sparse Isometries
- Reducing the Depth of Linear Reversible Quantum Circuits
- Parametrized constant-depth quantum neuron