BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures
As quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10601342/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832586871643832320 |
|---|---|
| author | Nikiforos Paraskevopoulos Carmen G. Almudever Sebastian Feld |
| author_facet | Nikiforos Paraskevopoulos Carmen G. Almudever Sebastian Feld |
| author_sort | Nikiforos Paraskevopoulos |
| collection | DOAJ |
| description | As quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubit routing challenges in scalable spin-qubit architectures. Unlike traditional methods in superconducting architectures that solely rely on <sc>swap</sc> operations, beSnake also incorporates the shuttle operation to optimize the execution time and fidelity of quantum circuits and achieves fast computation times of the routing task itself. Employing a simple breadth-first search approach, beSnake effectively manages the restrictions created by diverse topologies and qubit positions acting as obstacles for up to 72% qubit density. It also has the option to adjust the level of optimization and to dynamically tackle parallelized routing tasks, all the while maintaining noise awareness. Our simulations demonstrate beSnake's advantage over an existing routing solution on random circuits and real quantum algorithms with up to 1000 qubits, showing an average improvement of up to 80% in gate overhead, 54% in depth overhead, and up to 8.33 times faster routing times. |
| format | Article |
| id | doaj-art-84561766ed0948a6aa64c659e164752a |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-84561766ed0948a6aa64c659e164752a2025-01-25T00:03:39ZengIEEEIEEE Transactions on Quantum Engineering2689-18082024-01-01512210.1109/TQE.2024.342945110601342BeSnake: A Routing Algorithm for Scalable Spin-Qubit ArchitecturesNikiforos Paraskevopoulos0https://orcid.org/0000-0002-6355-9317Carmen G. Almudever1https://orcid.org/0000-0002-3800-2357Sebastian Feld2https://orcid.org/0000-0003-2782-1469Department of Quantum and Computer Engineering, Delft University of Technology, Delft, The NetherlandsDepartment of Computer Engineering, Universitat Politècnica de València, València, SpainDepartment of Quantum and Computer Engineering, Delft University of Technology, Delft, The NetherlandsAs quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubit routing challenges in scalable spin-qubit architectures. Unlike traditional methods in superconducting architectures that solely rely on <sc>swap</sc> operations, beSnake also incorporates the shuttle operation to optimize the execution time and fidelity of quantum circuits and achieves fast computation times of the routing task itself. Employing a simple breadth-first search approach, beSnake effectively manages the restrictions created by diverse topologies and qubit positions acting as obstacles for up to 72% qubit density. It also has the option to adjust the level of optimization and to dynamically tackle parallelized routing tasks, all the while maintaining noise awareness. Our simulations demonstrate beSnake's advantage over an existing routing solution on random circuits and real quantum algorithms with up to 1000 qubits, showing an average improvement of up to 80% in gate overhead, 54% in depth overhead, and up to 8.33 times faster routing times.https://ieeexplore.ieee.org/document/10601342/Quantum compilationqubit mappingqubit routingrouting algorithmspin qubits |
| spellingShingle | Nikiforos Paraskevopoulos Carmen G. Almudever Sebastian Feld BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures IEEE Transactions on Quantum Engineering Quantum compilation qubit mapping qubit routing routing algorithm spin qubits |
| title | BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures |
| title_full | BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures |
| title_fullStr | BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures |
| title_full_unstemmed | BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures |
| title_short | BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures |
| title_sort | besnake a routing algorithm for scalable spin qubit architectures |
| topic | Quantum compilation qubit mapping qubit routing routing algorithm spin qubits |
| url | https://ieeexplore.ieee.org/document/10601342/ |
| work_keys_str_mv | AT nikiforosparaskevopoulos besnakearoutingalgorithmforscalablespinqubitarchitectures AT carmengalmudever besnakearoutingalgorithmforscalablespinqubitarchitectures AT sebastianfeld besnakearoutingalgorithmforscalablespinqubitarchitectures |