Linear decomposition of approximate multi-controlled single qubit gates
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912458385391616 |
|---|---|
| author | Silva, Jefferson D. S. Azevedo, Thiago Melo D. Araujo, Israel F. da Silva, Adenilton J. |
| author_facet | Silva, Jefferson D. S. Azevedo, Thiago Melo D. Araujo, Israel F. da Silva, Adenilton J. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_14974 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Linear decomposition of approximate multi-controlled single qubit gates Silva, Jefferson D. S. Azevedo, Thiago Melo D. Araujo, Israel F. da Silva, Adenilton J. Quantum Physics Emerging Technologies 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. |
| title | Linear decomposition of approximate multi-controlled single qubit gates |
| topic | Quantum Physics Emerging Technologies |
| url | https://arxiv.org/abs/2310.14974 |