Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures

Distinct practical advantages of the one-way quantum computation (1WQC) have attracted the attention of many researchers. To physically realize a 1WQC pattern, its qubits should be mapped onto a quantum physical environment. The nearest-neighbor architectures are suitable for implementing 1WQC patterns because they provide nearest-neighbor sufficient interactions for full entanglement that are necessary for highly entangled configuration of 1WQC. To make a 1WQC nearest-neighbor compliant, swap gates are needed to bring the interacting qubits of a gate adjacent. More swap gates result in the higher latency and error probability. Therefore, an efficient mapping of qubits of a 1WQC pattern onto qubits provided by a nearest-neighbor architecture can dramatically reduce the number of swaps. This motivates us to propose an approach that maps qubits of a 1WQC pattern to qubits of a two-dimensional nearest-neighbor architecture. Our evaluations show that the proposed mapping approach reduces the number of swaps in the range of 0–96.2% in comparison with the best in the literature for the attempted benchmarks.