A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
arXiv:2010.03397 · doi:10.1109/TQE.2020.3026544
Abstract
Due to several physical limitations in the realisation of quantum hardware, today's quantum computers are qualified as Noisy Intermediate-Scale Quantum (NISQ) hardware. NISQ hardware is characterized by a small number of qubits (50 to a few hundred) and noisy operations. Moreover, current realisations of superconducting quantum chips do not have the ideal all-to-all connectivity between qubits but rather at most a nearest-neighbour connectivity. All these hardware restrictions add supplementary low-level requirements. They need to be addressed before submitting the quantum circuit to an actual chip. Satisfying these requirements is a tedious task for the programmer. Instead, the task of adapting the quantum circuit to a given hardware is left to the compiler. In this paper, we propose a Hardware-Aware mapping transition algorithm (HA) that takes the calibration data into account with the aim to improve the overall fidelity of the circuit. Evaluation results on IBM quantum hardware show that our HA approach can outperform the state of the art both in terms of the number of additional gates and circuit fidelity.
arXiv commentIEEE Transactions on Quantum Engineering, 2020
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Quantum Chemistry in the Age of Quantum Computing
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Quantum gradient descent for linear systems and least squares
- Qiskit Backend Specifications for OpenQASM and OpenPulse Experiments
- Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
- On the qubit routing problem
- Two-step approach to scheduling quantum circuits
- Randomized Row and Column Iterative Methods with a Quantum Computer
Cited by in corpus (22)
- Noisy intermediate-scale quantum (NISQ) algorithms
- Distributed Quantum Computing: a Survey
- Quantum Software Engineering: Roadmap and Challenges Ahead
- Suppressing quantum circuit errors due to system variability
- Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers
- Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era
- NetQASM -- A low-level instruction set architecture for hybrid quantum-classical programs in a quantum internet
- Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
- Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
- Optimizing Quantum Algorithms on Bipotent Architectures
- Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
- Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
- Calibration-Aware Transpilation for Variational Quantum Optimization
- Exploring ab initio machine synthesis of quantum circuits
- beSnake: A routing algorithm for scalable spin-qubit architectures
- Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping
- Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
- Qubit assignment using time reversal
- Optimized Noise Suppression for Quantum Circuits
- Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
- QSteed: A Resource-Virtualized and Hardware-Aware Quantum Compilation Framework for Real Quantum Computing Processors
- Predict and Conquer: Navigating Algorithm Trade-offs with Quantum Design Automation