Quantum Frequential Computing: a quadratic runtime advantage for all computations
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910888979595264 |
|---|---|
| author | Woods, Mischa P. |
| author_facet | Woods, Mischa P. |
| contents | An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain problems compared to the best-known classical algorithms. This advantage is enabled by the quantum mechanical nature of the logical degrees of freedom. To date, it was unknown if permitting other parts of the computer to be quantum mechanical, rather than semi-classical, could yield additional runtime speed-ups as a function of resource utilization (e.g., power consumption or cooling requirements).
In this work, we prove that when the control mechanisms associated with gate implementation are optimal quantum mechanical states, a quadratic runtime speedup (with respect to power consumption) is achievable for any algorithm, relative to optimal classical or semi-classical control schemes. Moreover, we demonstrate that only a small fraction of the computer's architecture needs to employ optimal quantum control states to realize this advantage, thereby significantly simplifying the design of future systems.
We call this new device a quantum frequential computer, since the quantum speedup arises from an increase in gate frequency. In current state-of-the-art designs, gate frequency is often limited by the coupling strength between components. Notably, our approach achieves the speedup without requiring an increase in coupling strength. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_02389 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Frequential Computing: a quadratic runtime advantage for all computations Woods, Mischa P. Quantum Physics Mathematical Physics Computational Physics An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain problems compared to the best-known classical algorithms. This advantage is enabled by the quantum mechanical nature of the logical degrees of freedom. To date, it was unknown if permitting other parts of the computer to be quantum mechanical, rather than semi-classical, could yield additional runtime speed-ups as a function of resource utilization (e.g., power consumption or cooling requirements). In this work, we prove that when the control mechanisms associated with gate implementation are optimal quantum mechanical states, a quadratic runtime speedup (with respect to power consumption) is achievable for any algorithm, relative to optimal classical or semi-classical control schemes. Moreover, we demonstrate that only a small fraction of the computer's architecture needs to employ optimal quantum control states to realize this advantage, thereby significantly simplifying the design of future systems. We call this new device a quantum frequential computer, since the quantum speedup arises from an increase in gate frequency. In current state-of-the-art designs, gate frequency is often limited by the coupling strength between components. Notably, our approach achieves the speedup without requiring an increase in coupling strength. |
| title | Quantum Frequential Computing: a quadratic runtime advantage for all computations |
| topic | Quantum Physics Mathematical Physics Computational Physics |
| url | https://arxiv.org/abs/2403.02389 |