Practical Subarchitectures for Optimal Quantum Layout Synthesis
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913945877479424 |
|---|---|
| author | Milkevych, Kostiantyn V. van de Pol, Jaco Shaik, Irfansha |
| author_facet | Milkevych, Kostiantyn V. van de Pol, Jaco Shaik, Irfansha |
| contents | Quantum Layout Synthesis (QLS) maps a logical quantum circuit to a physical quantum platform. Optimal QLS minimizes circuit size and depth, which is essential to reduce the noise on current quantum platforms. Optimal QLS is an NP-hard problem, so in practice, one maps a quantum circuit to a subset of the complete quantum platform. However, to guarantee optimality, one still has to consider exponentially many subarchitectures.
We introduce an effective method to enumerate relevant subarchitectures. This reduces the number of considered subarchitectures, as well as the number of expensive subgraph isomorphism checks, thus boosting Optimal QLS with subarchitectures. To do so, we assume a fixed number of ancilla qubits that can be used in the mapping. We guarantee optimality of the quantum layout, for the selected ancilla bound.
We evaluate our technique on a number of benchmarks and compare it with state-of-the-art Optimal QLS tools with and without using subarchitectures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12976 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Practical Subarchitectures for Optimal Quantum Layout Synthesis Milkevych, Kostiantyn V. van de Pol, Jaco Shaik, Irfansha Quantum Physics Quantum Layout Synthesis (QLS) maps a logical quantum circuit to a physical quantum platform. Optimal QLS minimizes circuit size and depth, which is essential to reduce the noise on current quantum platforms. Optimal QLS is an NP-hard problem, so in practice, one maps a quantum circuit to a subset of the complete quantum platform. However, to guarantee optimality, one still has to consider exponentially many subarchitectures. We introduce an effective method to enumerate relevant subarchitectures. This reduces the number of considered subarchitectures, as well as the number of expensive subgraph isomorphism checks, thus boosting Optimal QLS with subarchitectures. To do so, we assume a fixed number of ancilla qubits that can be used in the mapping. We guarantee optimality of the quantum layout, for the selected ancilla bound. We evaluate our technique on a number of benchmarks and compare it with state-of-the-art Optimal QLS tools with and without using subarchitectures. |
| title | Practical Subarchitectures for Optimal Quantum Layout Synthesis |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.12976 |