Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915382516776960 |
|---|---|
| author | Escofet, Pau Semenov, Andrii Murphy, Niall Blokhina, Elena Abadal, Sergi Alarcón, Eduard Almudéver, Carmen G. |
| author_facet | Escofet, Pau Semenov, Andrii Murphy, Niall Blokhina, Elena Abadal, Sergi Alarcón, Eduard Almudéver, Carmen G. |
| contents | In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during shuttling operations while reducing the overall execution time of quantum circuits. We propose and evaluate five mapping algorithms using benchmarks from quantum algorithms. The Swap Return strategy emerged as the most robust solution, offering a superior balance between execution time and error minimization by considering future qubit interactions. Additionally, we assess the importance of initial qubit placement, demonstrating that an informed placement strategy can significantly enhance the performance of dynamic mapping approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_06263 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture Escofet, Pau Semenov, Andrii Murphy, Niall Blokhina, Elena Abadal, Sergi Alarcón, Eduard Almudéver, Carmen G. Quantum Physics In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during shuttling operations while reducing the overall execution time of quantum circuits. We propose and evaluate five mapping algorithms using benchmarks from quantum algorithms. The Swap Return strategy emerged as the most robust solution, offering a superior balance between execution time and error minimization by considering future qubit interactions. Additionally, we assess the importance of initial qubit placement, demonstrating that an informed placement strategy can significantly enhance the performance of dynamic mapping approaches. |
| title | Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.06263 |