Heuristic Reordering Strategy for Quantum Circuit Mapping on LNN Architectures

Because of the connection constraints of quantum devices, the quantum gate cannot operate directly on nonadjacent qubits. Quantum circuit mapping transforms a logical quantum circuit to a circuit that satisfies the connection constraints by adding SWAP gates for nonadjacent qubits. Global and local heuristic reordering strategies are proposed in this paper for quantum circuit mapping over linear nearest neighbor (LNN) architectures, which are one-dimensional topology structures, to reduce the number of SWAP gates added. Experiment results show that the average improvements of the two methods are 13.19% and 15.46%, respectively. In this paper, we consider the quantum circuit mapping problem for linear nearest neighbor (LNN) architectures. We propose a global heuristic qubit reordering optimization algorithm and a local heuristic qubit reordering optimization algorithm. Compared with the other algorithm results, the average improvements of the two methods for quantum cost are 13.19% and 15.46%, respectively. The two methods apply to the realization of quantum circuit neighboring over one-dimensional quantum architectures and can be extended to algorithms that work for other quantum architectures of different topologies.