Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.01038 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929610232430592 |
|---|---|
| author | Li, Yingheng Dai, Yue Pawar, Aditya Dong, Rongchao Yang, Jun Zhang, Youtao Tang, Xulong |
| author_facet | Li, Yingheng Dai, Yue Pawar, Aditya Dong, Rongchao Yang, Jun Zhang, Youtao Tang, Xulong |
| contents | Photonic quantum computer (PQC) is an emerging and promising quantum computing paradigm that has gained momentum in recent years. In PQC, which leverages the measurement-based quantum computing (MBQC) model, computations are executed by performing measurements on photons in graph states (i.e., sets of entangled photons) that are generated before measurements. The graph state in PQC is generated deterministically by quantum emitters. The generation process is achieved by applying a sequence of quantum gates to quantum emitters. In this process, i) the time required to complete the process, ii) the number of quantum emitters used, and iii) the number of CZ gates performed between emitters greatly affect the fidelity of the generated graph state. However, prior work for determining the generation sequence only focuses on optimizing the number of quantum emitters. Moreover, identifying the optimal generation sequence has vast search space. To this end, we propose RLGS, a novel compilation framework to identify optimal generation sequences that optimize the three metrics. Experimental results show that RLGS achieves an average reduction in generation time of 31.1%, 49.6%, and 57.5% for small, medium, and large graph states compared to the baseline. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01038 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Using Reinforcement Learning to Guide Graph State Generation for Photonic Quantum Computers Li, Yingheng Dai, Yue Pawar, Aditya Dong, Rongchao Yang, Jun Zhang, Youtao Tang, Xulong Quantum Physics Photonic quantum computer (PQC) is an emerging and promising quantum computing paradigm that has gained momentum in recent years. In PQC, which leverages the measurement-based quantum computing (MBQC) model, computations are executed by performing measurements on photons in graph states (i.e., sets of entangled photons) that are generated before measurements. The graph state in PQC is generated deterministically by quantum emitters. The generation process is achieved by applying a sequence of quantum gates to quantum emitters. In this process, i) the time required to complete the process, ii) the number of quantum emitters used, and iii) the number of CZ gates performed between emitters greatly affect the fidelity of the generated graph state. However, prior work for determining the generation sequence only focuses on optimizing the number of quantum emitters. Moreover, identifying the optimal generation sequence has vast search space. To this end, we propose RLGS, a novel compilation framework to identify optimal generation sequences that optimize the three metrics. Experimental results show that RLGS achieves an average reduction in generation time of 31.1%, 49.6%, and 57.5% for small, medium, and large graph states compared to the baseline. |
| title | Using Reinforcement Learning to Guide Graph State Generation for Photonic Quantum Computers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.01038 |