Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911150883471360 |
|---|---|
| author | Rosa, Evandro C. R. Marchi, Jerusa Duzzioni, Eduardo I. de Santiago, Rafael |
| author_facet | Rosa, Evandro C. R. Marchi, Jerusa Duzzioni, Eduardo I. de Santiago, Rafael |
| contents | Similar to classical programming, high-level quantum programming languages generate code that cannot be executed directly by quantum hardware and must be compiled. However, unlike classical code, quantum programs must be compiled before each execution, making the trade-off between compilation time and execution time particularly significant. In this paper, we address the first step of quantum compilation: multi-qubit gate decomposition. We analyze the trade-offs of state-of-the-art decomposition algorithms by implementing them in the Ket quantum programming platform and collecting numerical performance data. This is the first study to both implement and analyze the current state-of-the-art decomposition methods within a single platform. Based on our findings, we propose two compilation profiles: one optimized for minimizing compilation time and another for minimizing quantum execution time. Our results provide valuable insights for both quantum compiler developers and quantum programmers, helping them make informed decisions about gate decomposition strategies and their impact on overall performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20291 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs Rosa, Evandro C. R. Marchi, Jerusa Duzzioni, Eduardo I. de Santiago, Rafael Quantum Physics Programming Languages Similar to classical programming, high-level quantum programming languages generate code that cannot be executed directly by quantum hardware and must be compiled. However, unlike classical code, quantum programs must be compiled before each execution, making the trade-off between compilation time and execution time particularly significant. In this paper, we address the first step of quantum compilation: multi-qubit gate decomposition. We analyze the trade-offs of state-of-the-art decomposition algorithms by implementing them in the Ket quantum programming platform and collecting numerical performance data. This is the first study to both implement and analyze the current state-of-the-art decomposition methods within a single platform. Based on our findings, we propose two compilation profiles: one optimized for minimizing compilation time and another for minimizing quantum execution time. Our results provide valuable insights for both quantum compiler developers and quantum programmers, helping them make informed decisions about gate decomposition strategies and their impact on overall performance. |
| title | Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs |
| topic | Quantum Physics Programming Languages |
| url | https://arxiv.org/abs/2504.20291 |