Quantum Compiling with Reinforcement Learning on a Superconducting Processor
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914837896888320 |
|---|---|
| author | Wang, Z. T. Chen, Qiuhao Du, Yuxuan Yang, Z. H. Cai, Xiaoxia Huang, Kaixuan Zhang, Jingning Xu, Kai Du, Jun Li, Yinan Jiao, Yuling Wu, Xingyao Liu, Wu Lu, Xiliang Xu, Huikai Jin, Yirong Wang, Ruixia Yu, Haifeng Zhao, S. P. |
| author_facet | Wang, Z. T. Chen, Qiuhao Du, Yuxuan Yang, Z. H. Cai, Xiaoxia Huang, Kaixuan Zhang, Jingning Xu, Kai Du, Jun Li, Yinan Jiao, Yuling Wu, Xingyao Liu, Wu Lu, Xiliang Xu, Huikai Jin, Yirong Wang, Ruixia Yu, Haifeng Zhao, S. P. |
| contents | To effectively implement quantum algorithms on noisy intermediate-scale quantum (NISQ) processors is a central task in modern quantum technology. NISQ processors feature tens to a few hundreds of noisy qubits with limited coherence times and gate operations with errors, so NISQ algorithms naturally require employing circuits of short lengths via quantum compilation. Here, we develop a reinforcement learning (RL)-based quantum compiler for a superconducting processor and demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. We show that for the three-qubit quantum Fourier transformation, a compiled circuit using only seven CZ gates with unity circuit fidelity can be achieved. The compiler is also able to find optimal circuits under device topological constraints, with lengths considerably shorter than those by the conventional method. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation, offering valuable insights for the advancement of RL-based compilers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_12195 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Compiling with Reinforcement Learning on a Superconducting Processor Wang, Z. T. Chen, Qiuhao Du, Yuxuan Yang, Z. H. Cai, Xiaoxia Huang, Kaixuan Zhang, Jingning Xu, Kai Du, Jun Li, Yinan Jiao, Yuling Wu, Xingyao Liu, Wu Lu, Xiliang Xu, Huikai Jin, Yirong Wang, Ruixia Yu, Haifeng Zhao, S. P. Quantum Physics Machine Learning To effectively implement quantum algorithms on noisy intermediate-scale quantum (NISQ) processors is a central task in modern quantum technology. NISQ processors feature tens to a few hundreds of noisy qubits with limited coherence times and gate operations with errors, so NISQ algorithms naturally require employing circuits of short lengths via quantum compilation. Here, we develop a reinforcement learning (RL)-based quantum compiler for a superconducting processor and demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. We show that for the three-qubit quantum Fourier transformation, a compiled circuit using only seven CZ gates with unity circuit fidelity can be achieved. The compiler is also able to find optimal circuits under device topological constraints, with lengths considerably shorter than those by the conventional method. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation, offering valuable insights for the advancement of RL-based compilers. |
| title | Quantum Compiling with Reinforcement Learning on a Superconducting Processor |
| topic | Quantum Physics Machine Learning |
| url | https://arxiv.org/abs/2406.12195 |