beSnake: A routing algorithm for scalable spin-qubit architectures
arXiv:2403.16090 · doi:10.1109/TQE.2024.3429451
Abstract
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 SWAP 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 qubits, showing an average improvement of up to in gate overhead and in depth overhead, and up to times faster routing times.
References in corpus (35)
- Quantum Computing in the NISQ era and beyond
- Quantum Computation with Quantum Dots
- Spins in few-electron quantum dots
- Trapped-Ion Quantum Computing: Progress and Challenges
- Silicon Quantum Electronics
- A Two Qubit Logic Gate in Silicon
- A >99.9%-fidelity quantum-dot spin qubit with coherence limited by charge noise
- A programmable two-qubit quantum processor in silicon
- Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
- Interfacing spin qubits in quantum dots and donors - hot, dense and coherent
- Computing with spin qubits at the surface code error threshold
- Fast universal quantum control above the fault-tolerance threshold in silicon
- Universal control of a six-qubit quantum processor in silicon
- tket : A Retargetable Compiler for NISQ Devices
- A four-qubit germanium quantum processor
- Semiconductor Qubits In Practice
- A Crossbar Network for Silicon Quantum Dot Qubits
- Additive Pattern Database Heuristics
- Quantum computing with Qiskit
- A hole spin qubit in a fin field-effect transistor above 4 kelvin
- MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
- A Reconfigurable Gate Architecture for Si/SiGe Quantum Dots
- A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
- Operating semiconductor quantum processors with hopping spins
- Timing and resource-aware mapping of quantum circuits to superconducting processors
- Graph-Based Multi-Robot Path Finding and Planning
- Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
- Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
- rustworkx: A High-Performance Graph Library for Python
- Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
- Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
- Muzzle the Shuttle: Efficient Compilation for Multi-Trap Trapped-Ion Quantum Computers
- Quantum error correction in crossbar architectures
- SpinQ: Compilation strategies for scalable spin-qubit architectures
- Circuit decompositions and scheduling for neutral atom devices with limited local addressability