  Near-term large quantum computers are not able to operate as a single
processing unit. It is therefore required to partition a quantum circuit into
smaller parts, and then each part is executed on a small unit. This approach is
known as distributed quantum computation. In this study, a dynamic programming
algorithm is proposed to minimize the number of communications in a distributed
quantum circuit (DQC). This algorithm consists of two steps: first, the quantum
circuit is converted into a bipartite graph model, and then a dynamic
programming approach (DP) is proposed to partition the model into low-capacity
quantum circuits. The proposed approach is evaluated on some benchmark quantum
circuits with remarkable reduction in the number of required teleportations.
