Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.20025 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929521773510656 |
|---|---|
| author | Ni, Zhong-Yi Zhao, Yu-Sheng Liu, Jin-Guo |
| author_facet | Ni, Zhong-Yi Zhao, Yu-Sheng Liu, Jin-Guo |
| contents | This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing a single arbitrary gate for compiling is beneficial for systems with limited degrees of freedom, e.g. the scattering based quantum computing schemes. However, how to efficiently compile the wanted gate with a single arbitrary gate, and finally achieve fault-tolerant quantum computing is unknown. In this work, we show almost any target gate can be compiled to precision $ε$ with a circuit depth of approximately $\log(ε^{-1})$ with an improved brute-force compiling method. Under the assumption of reasonable classical resource, we show the gate imperfection can be lowered to $10^{-3}$. By treating the imperfection as coherent error, we show that the error can be further reduced by roughly two orders of magnitude with a measurement-free quantum error correction method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_20025 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Universal quantum computing with a single arbitrary gate Ni, Zhong-Yi Zhao, Yu-Sheng Liu, Jin-Guo Quantum Physics This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing a single arbitrary gate for compiling is beneficial for systems with limited degrees of freedom, e.g. the scattering based quantum computing schemes. However, how to efficiently compile the wanted gate with a single arbitrary gate, and finally achieve fault-tolerant quantum computing is unknown. In this work, we show almost any target gate can be compiled to precision $ε$ with a circuit depth of approximately $\log(ε^{-1})$ with an improved brute-force compiling method. Under the assumption of reasonable classical resource, we show the gate imperfection can be lowered to $10^{-3}$. By treating the imperfection as coherent error, we show that the error can be further reduced by roughly two orders of magnitude with a measurement-free quantum error correction method. |
| title | Universal quantum computing with a single arbitrary gate |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.20025 |