Optimized compiler for Distributed Quantum Computing

Abstract

Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario, telegates represent the fundamental remote (inter-processor) operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming and fault-prone. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of that resource. Specifically, we provide a parametric ILP formulation, where the parameter denotes a time horizon (or time availability); the objective function count the number of used resources. To minimize the time, a binary search solves the subject ILP by iterating over the parameter. Ultimately, to enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegates' tasks.

References in corpus (14)

• The Quantum Internet
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Experimental Comparison of Two Quantum Computing Architectures
• Quantum circuits of T-depth one
• Efficient Distributed Quantum Computing
• Doubling the size of quantum simulators by entanglement forging
• Compiler Design for Distributed Quantum Computing
• Quantum Circuit Placement
• Optically-Heralded Entanglement of Superconducting Systems in Quantum Networks
• A magic state's fidelity can be superior to the operations that created it
• ZX-calculus for the working quantum computer scientist
• Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
• A dynamic programming approach for distributing quantum circuits by bipartite graphs
• Entanglement Across Separate Silicon Dies in a Modular Superconducting Qubit Device

Cited by in corpus (12)

• Distributed Quantum Computing: a Survey
• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Distributing circuits over heterogeneous, modular quantum computing network architectures
• Mapping quantum circuits to modular architectures with QUBO
• Entanglement-efficient bipartite-distributed quantum computing
• Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
• Generalised Circuit Partitioning for Distributed Quantum Computing
• A Multilevel Framework for Partitioning Quantum Circuits
• Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
• Service Differentiation and Fair Sharing in Distributed Quantum Computing
• Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
• Efficient simulation of noisy entanglement generation