Enregistré dans:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2501.14020 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914200921571328 |
|---|---|
| author | Dreier, Florian Fleckenstein, Christoph Aigner, Gregor Fellner, Michael Aumann, Philipp Stahn, Reinhard Lanthaler, Martin Lechner, Wolfgang |
| author_facet | Dreier, Florian Fleckenstein, Christoph Aigner, Gregor Fellner, Michael Aumann, Philipp Stahn, Reinhard Lanthaler, Martin Lechner, Wolfgang |
| contents | We present a general method for the implementation of quantum algorithms that optimizes both gate count and circuit depth. Our approach introduces connectivity-adapted CNOT-based building blocks called Parity Twine chains. It outperforms all known state-of-the art methods for implementing prominent quantum algorithms such as the quantum Fourier transform or the Quantum Approximate Optimization Algorithm across a wide range of quantum hardware, including linear, square-grid, hexagonal, ladder and all-to-all connected devices. We show that even moderate increments in connectivity can yield significant efficiency improvements and reach the proven optimum for specific cases. Furthermore, we demonstrate a practical performance advantage of this approach for a wide range of compilation problems and quantum hardware. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14020 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Connectivity-aware Synthesis of Quantum Algorithms Dreier, Florian Fleckenstein, Christoph Aigner, Gregor Fellner, Michael Aumann, Philipp Stahn, Reinhard Lanthaler, Martin Lechner, Wolfgang Quantum Physics We present a general method for the implementation of quantum algorithms that optimizes both gate count and circuit depth. Our approach introduces connectivity-adapted CNOT-based building blocks called Parity Twine chains. It outperforms all known state-of-the art methods for implementing prominent quantum algorithms such as the quantum Fourier transform or the Quantum Approximate Optimization Algorithm across a wide range of quantum hardware, including linear, square-grid, hexagonal, ladder and all-to-all connected devices. We show that even moderate increments in connectivity can yield significant efficiency improvements and reach the proven optimum for specific cases. Furthermore, we demonstrate a practical performance advantage of this approach for a wide range of compilation problems and quantum hardware. |
| title | Connectivity-aware Synthesis of Quantum Algorithms |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2501.14020 |