Optimized Quantum Circuit Partitioning

Abstract

The main objective of this paper is to improve the communication costs in distributed quantum circuits. To this end, we present a method for generating distributed quantum circuits from monolithic quantum circuits in such a way that communication between partitions of a distributed quantum circuit is minimized. Thus, the communication between distributed components is performed at a lower cost. Compared to existing works, our approach can effectively map a quantum circuit into an appropriate number of distributed components. Since teleportation is usually the protocol used to connect components in a distributed quantum circuit, our approach ultimately reduces the number of teleportations. The results of applying our approach to the benchmark quantum circuits determine its effectiveness and show that partitioning is a necessary step in constructing distributed quantum circuit.

arXiv comment12 pages, 11 figures

References in corpus (14)

• Elementary gates for quantum computation
• Synthesis of Quantum Logic Circuits
• Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
• Distributed Quantum Computation over Noisy Channels
• Complete quantum teleportation using nuclear magnetic resonance
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• Substituting Quantum Entanglement for Communication
• Realization of Deterministic Quantum Teleportation with Solid State Qubits
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Efficient Distributed Quantum Computing
• Local and Distributed Quantum Computation
• Quantum Internet: from Communication to Distributed Computing!
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Automated distribution of quantum circuits via hypergraph partitioning

Cited by in corpus (17)

• Distributed Quantum Computing: a Survey
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Optimized compiler for Distributed Quantum Computing
• Networked Quantum Services
• Distributed Quantum Computing for Chemical Applications
• Quantum Data Centers in the Presence of Noise
• TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
• A Multilevel Framework for Partitioning Quantum Circuits
• Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
• GTQCP: Greedy Topology-Aware Quantum Circuit Partitioning
• Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
• Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
• Circuit Partitioning for the Quantum Internet
• DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing
• Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
• Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks