A dynamic programming approach for distributing quantum circuits by bipartite graphs

Understand

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).