A Depth-Aware Swap Insertion Scheme for the Qubit Mapping Problem

SlackQ : Approaching the Qubit Mapping Problem with A Slack-aware Swap Insertion Scheme

The rapid progress of physical implementation of quantum computers paved the way for the design of tools to help users write quantum programs for any given quantum device. The physical constraints inherent in current NISQ architectures prevent most quantum algorithms from being directly executed on quantum devices. To enable two-qubit gates in the algorithm, existing works focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, their schemes lack consideration of the execution time of generated quantum circuits. In this work, we propose a slack-aware SWAP…

基于层权重分配与搜索空间缩减的高效迭代量子比特映射算法

An Efficient Iterative Algorithm for Qubit Mapping via Layer-Weight Assignment and Search Space Reduction

本文提出高效迭代量子比特映射算法 HAIL，通过层权重分配、子图同构、两阶段 SWAP 搜索及双向遍历减少 SWAP 门，并在 IBM Q20 与 Google Sycamore 上验证其门数和运行时间优势。

ForeSight: Reducing SWAPs in NISQ Programs via Adaptive Multi-Candidate Evaluations

Near-term quantum computers are noisy and have limited connectivity between qubits. Compilers are required to introduce SWAP operations in order to perform two-qubit gates between non-adjacent qubits. SWAPs increase the number of gates and depth of programs, making them even more vulnerable to errors. Moreover, they relocate qubits which affect SWAP selections for future gates in a program. Thus, compilers must select SWAP routes that not only minimize the overheads for the current operation, but also for future gates. Existing compilers tend to select paths with the fewest SWAPs for the curre…

Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing

Despite rapid advances in quantum computing technologies, the qubit connectivity limitation remains to be a critical challenge. Both near-term NISQ quantum computers and relatively long-term scalable quantum architectures do not offer full connectivity. As a result, quantum circuits may not be directly executed on quantum hardware, and a quantum compiler needs to perform qubit routing to make the circuit compatible with the device layout. During the qubit routing step, the compiler inserts SWAP gates and performs circuit transformations. Given the connectivity topology of the target hardware, …

2D Qubit Placement of Quantum Circuits using LONGPATH

In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but implementation involves realization of quantum circuits through physical synthesis of quantum gates. This requires decomposition of complex quantum gates into a cascade of simple one qubit and two qubit gates. The methodological framework for physical synthesis imposes a constraint regarding placement of operands (qubits) and operators. If physical qubits can be placed …

TANGO：一种基于两阶段搜索与双向前瞻的鲁棒量子比特映射算法

TANGO: A Robust Qubit Mapping Algorithm via Two-Stage Search and Bidirectional Look

TANGO算法通过层级权重分配、两阶段路由搜索和双向前瞻SWAP策略，在多种量子设备上协同优化门数量与电路深度，提升了量子电路映射的保真度。