SpinQ: Compilation strategies for scalable spin-qubit architectures

Abstract

Despite NISQ devices being severely constrained, hardware- and algorithm-aware quantum circuit mapping techniques have been developed to enable successful algorithm executions. Not so much attention has been paid to mapping and compilation implementations for spin-qubit quantum processors due to the scarce availability of experimental devices and their small sizes. However, based on their high scalability potential and their rapid progress it is timely to start exploring solutions on such devices. In this work, we discuss the unique mapping challenges of a scalable crossbar architecture with shared control and introduce SpinQ, the first native compilation framework for scalable spin-qubit architectures. At the core of SpinQ is the Integrated Strategy that addresses the unique operational constraints of the crossbar while considering compilation scalability and obtaining a O(n) computational complexity. To evaluate the performance of SpinQ on this novel architecture, we compiled a broad set of well-defined quantum circuits and performed an in-depth analysis based on multiple metrics such as gate overhead, depth overhead, and estimated success probability, which in turn allowed us to create unique mapping and architectural insights. Finally, we propose novel mapping techniques that could increase algorithm success rates on this architecture and potentially inspire further research on quantum circuit mapping for other scalable spin-qubit architectures.

arXiv comment18 pages, 16 figures

References in corpus (37)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Computation with Quantum Dots
• Quantum Computing
• Spins in few-electron quantum dots
• Trapped-Ion Quantum Computing: Progress and Challenges
• Silicon Quantum Electronics
• An addressable quantum dot qubit with fault-tolerant control fidelity
• 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
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
• Interfacing spin qubits in quantum dots and donors - hot, dense and coherent
• Quantum advantage in learning from experiments
• A four-qubit germanium quantum processor
• Silicon CMOS architecture for a spin-based quantum computer
• Semiconductor Qubits In Practice
• The Future of Quantum Computing with Superconducting Qubits
• A Crossbar Network for Silicon Quantum Dot Qubits
• Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
• A hole spin qubit in a fin field-effect transistor above 4 kelvin
• A Reconfigurable Gate Architecture for Si/SiGe Quantum Dots
• Spiderweb array: A sparse spin-qubit array
• Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation
• High Fidelity Single-qubit Gates of a Single Neutral Atom in the Magic-Intensity Optical Dipole Trap
• Timing and resource-aware mapping of quantum circuits to superconducting processors
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Quantum Computing: An Overview Across the System Stack
• A Cryogenic Interface for Controlling Many Qubits
• Electrical control of uniformity in quantum dot devices
• Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
• Quantum error correction in crossbar architectures
• Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
• Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
• Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers

Cited by in corpus (7)

• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• beSnake: A routing algorithm for scalable spin-qubit architectures
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
• Compiling the surface code to crossbar spin qubit architectures
• Improving Figures of Merit for Quantum Circuit Compilation
• Limitations of the $g$-tensor formalism of semiconductor spin qubits
• Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture