REVIEW 1 cited by
A dynamic programming approach for distributing quantum circuits by bipartite graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors
A window-based circuit partitioning heuristic with dynamic one-way teleportation reduces EPR pairs versus a static baseline, and a structured QFT distribution uses nm/2 EPR pairs on m processors.
Discussion (0). Continue with ORCID to comment.