CODAR: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices
arXiv:2002.10915 · doi:10.1109/DAC18072.2020.9218561
Abstract
Quantum computing devices in the NISQ era share common features and challenges like limited connectivity between qubits. Since two-qubit gates are allowed on limited qubit pairs, quantum compilers must transform original quantum programs to fit the hardware constraints. Previous works on qubit mapping assume different gates have the same execution duration, which limits them to explore the parallelism from the program. To address this drawback, we propose a Multi-architecture Adaptive Quantum Abstract Machine (maQAM) and a COntext-sensitive and Duration-Aware Remapping algorithm (CODAR). The CODAR remapper is aware of gate duration difference and program context, enabling it to extract more parallelism from programs and speed up the quantum programs by 1.23 in simulation on average in different architectures and maintain the fidelity of circuits when running on Origin Quantum noisy simulator.
arXiv admin note: substantial text overlap with arXiv:2001.06887
References in corpus (11)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Demonstration of a small programmable quantum computer with atomic qubits
- Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
- Experimental Comparison of Two Quantum Computing Architectures
- Benchmarking an 11-qubit quantum computer
- A Rydberg blockade CNOT gate and entanglement in a 2D array of neutral atom qubits
- Phase-tuned entangled state generation between distant spin qubits
- Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
- 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