최적 큐빗 할당을 위한 정수계획 모형

Abstract

A qubit alocation problem is to find an asignment of logical qubits in a quantum algorithm to the physical qubitsof a quantum computing device. The physical qubits are often configured in a coupling map, which is a directedgraph that represents communication relationship betwen adjacent physical qubits. A proper qubit alocationsatisfies al logical qubit communication relationship in a quantum circuit by conforming to the coupling maprestriction. To find the proper qubit alocation, we often ned to change the quantum circuit by using aset of circuittransformations, which include reversal, bridge, and swap. Such atransformation results in the quantum circuit withnewly aded quantum gates and subsequenlty causes extra quantum erors. In this study, we propose an integerprogramming model that minimizes the sum of the quantum cost of the circuitransformation. In our model, althre circuitransformations are considered. Moreover, we presenthe results of the computational experiment inwhich our model is compared with heuristic procedures from previoustudies.