Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908469452341248 |
|---|---|
| author | Moflic, Ioana Robertson, Alan Devitt, Simon J. Paler, Alexandru |
| author_facet | Moflic, Ioana Robertson, Alan Devitt, Simon J. Paler, Alexandru |
| contents | Utility-scale quantum programs contain operations on the order of $>10^{15}$ which must be prepared and piped from a classical co-processor to the control unit of the quantum device. The latency of this process significantly increases with the size of the program: existing high-level classical representations of quantum programs are typically memory intensive and do not naïvely efficiently scale to the degree required to execute utility-scale programs in real-time. To combat this limitation, we propose the utilization of high-level quantum circuit caches and compressors. The first save on the time associated with repetitive tasks and sub-circuits, and the latter are useful for representing the programs/circuits in memory-efficient formats. We present numerical evidence that caches and compressors can offer five orders of magnitude lower latencies during the automatic transpilation of extremely large quantum circuits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_20677 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing Moflic, Ioana Robertson, Alan Devitt, Simon J. Paler, Alexandru Quantum Physics Utility-scale quantum programs contain operations on the order of $>10^{15}$ which must be prepared and piped from a classical co-processor to the control unit of the quantum device. The latency of this process significantly increases with the size of the program: existing high-level classical representations of quantum programs are typically memory intensive and do not naïvely efficiently scale to the degree required to execute utility-scale programs in real-time. To combat this limitation, we propose the utilization of high-level quantum circuit caches and compressors. The first save on the time associated with repetitive tasks and sub-circuits, and the latter are useful for representing the programs/circuits in memory-efficient formats. We present numerical evidence that caches and compressors can offer five orders of magnitude lower latencies during the automatic transpilation of extremely large quantum circuits. |
| title | Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.20677 |