Cargando…
Efficient decomposition methods for controlled-R(n) using a single ancillary qubit
We consider decomposition for a controlled-R(n) gate with a standard set of universal gates. For this problem, a method exists that uses a single ancillary qubit to reduce the number of gates. In this work, we extend this method to three ends. First, we find a method that can decompose into fewer ga...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5882919/ https://www.ncbi.nlm.nih.gov/pubmed/29615687 http://dx.doi.org/10.1038/s41598-018-23764-x |
Sumario: | We consider decomposition for a controlled-R(n) gate with a standard set of universal gates. For this problem, a method exists that uses a single ancillary qubit to reduce the number of gates. In this work, we extend this method to three ends. First, we find a method that can decompose into fewer gates than the best known results in decomposition of controlled-R(n). We also confirm that the proposed method reduces the total number of gates of the quantum Fourier transform. Second, we propose another efficient decomposition that can be mapped to a nearest-neighbor architecture with only local CNOT gates. Finally, we find a method that can minimize the depth to 5 gate steps in a nearest-neighbor architecture with only local CNOT gates. |
---|