Context-Sensitive and Duration-Aware Qubit Mapping for Various NISQ Devices
arXiv:2001.06887
Abstract
Quantum computing (QC) technologies have reached a second renaissance in the last decade. Some fully programmable QC devices have been built based on superconducting or ion trap technologies. Although different quantum technologies have their own parameter indicators, QC devices in the NISQ era share common features and challenges such as limited qubits and connectivity, short coherence time and high gate error rates. Quantum programs written by programmers could hardly run on real hardware directly since two-qubit gates are usually allowed on few pairs of qubits. Therefore, quantum computing compilers must resolve the mapping problem and transform original programs to fit the hardware limitation. To address the issues mentioned above, we summarize different quantum technologies and abstractly define Quantum Abstract Machine (QAM); then propose a COntext-sensitive and Duration-Aware Remapping algorithm (Codar) based on the QAM. By introducing lock for each qubit, Codar is aware of gate duration difference and program context, which bring it abilities to extract more program's parallelism and reduce program execution time. Compared to the best-known algorithm, Codar halves the total execution time of several quantum algorithms and cut down 17.5% - 19.4% total execution time on average in different architectures.
9 pages,5 figures, 2 tables. This is the extended abstract of the talk accepted by the First International Workshop on Programming Languages for Quantum Computing (PLanQC 2020), Jan 19, 2020, New Orleans, Louisiana, USA. (https://popl20.sigplan.org/home/planqc-2020#program)
References in corpus (11)
- Experimental Comparison of Two Quantum Computing Architectures
- Benchmarking an 11-qubit quantum computer
- Resource-Aware Quantum Programming with General Recursion and Quantum Control
- A Rydberg blockade CNOT gate and entanglement in a 2D array of neutral atom qubits
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Compiling quantum circuits to realistic hardware architectures using temporal planners
- Free-space lossless state-detection of a single trapped atom
- High Fidelity Single-qubit Gates of a Single Neutral Atom in the Magic-Intensity Optical Dipole Trap
- Fast non-destructive parallel readout of neutral atom registers in optical potentials
- Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning
- Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies