Muzzle the Shuttle: Efficient Compilation for Multi-Trap Trapped-Ion Quantum Computers

Abstract

Trapped-ion systems can have a limited number of ions (qubits) in a single trap. Increasing the qubit count to run meaningful quantum algorithms would require multiple traps where ions need to shuttle between traps to communicate. The existing compiler has several limitations which result in a high number of shuttle operations and degraded fidelity. In this paper, we target this gap and propose compiler optimizations to reduce the number of shuttles. Our technique achieves a maximum reduction of $51.17\%$ in shuttles (average $\approx 33\%$) tested over $125$ circuits. Furthermore, the improved compilation enhances the program fidelity up to $22.68$X with a modest increase in the compilation time.

arXiv comment6 pages, 8 figures, and 3 tables. Accepted in the 2022 Design Automation and Test in Europe (DATE) Conference

References in corpus (4)

• Benchmarking an 11-qubit quantum computer
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• Robust two-qubit gates in a linear ion crystal using a frequency-modulated driving force
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors

Cited by in corpus (5)

• Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
• Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer
• Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer
• beSnake: A routing algorithm for scalable spin-qubit architectures
• Architecting Scalable Trapped Ion Quantum Computers using Surface Codes