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 (40)

• The Quantum Internet
• Improved Simulation of Stabilizer Circuits
• A Theory of Fault-Tolerant Quantum Computation
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Experimental Comparison of Two Quantum Computing Architectures
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• Entanglement Distillation between Solid-State Quantum Network Nodes
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Methodology for quantum logic gate constructions
• Single ion-qubit exceeding one hour coherence time
• High-rate, high-fidelity entanglement of qubits across an elementary quantum network
• When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Towards a Distributed Quantum Computing Ecosystem
• Quantum circuits of T-depth one
• Efficient Distributed Quantum Computing
• Local and Distributed Quantum Computation
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
• Doubling the size of quantum simulators by entanglement forging
• Compiler Design for Distributed Quantum Computing
• Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach
• Quantum Circuit Placement
• The ZX-calculus is complete for stabilizer quantum mechanics
• Automated distribution of quantum circuits via hypergraph partitioning
• A quantum-classical cloud platform optimized for variational hybrid algorithms
• Optically-Heralded Entanglement of Superconducting Systems in Quantum Networks
• Heralded Generation and Detection of Entangled Microwave--Optical Photon Pairs
• Topological Quantum Compiling with Reinforcement Learning
• A magic state's fidelity can be superior to the operations that created it
• Optimized Quantum Circuit Partitioning
• Universal gate-set for trapped-ion qubits using a narrow linewidth diode laser
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Designing Quantum Networks Using Preexisting Infrastructure
• Quantum advantage of unitary Clifford circuits with magic state inputs
• ZX-calculus for the working quantum computer scientist
• Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
• Entanglement Across Separate Silicon Dies in a Modular Superconducting Qubit Device
• A dynamic programming approach for distributing quantum circuits by bipartite graphs

Cited by in corpus (14)

• 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
• Generalised Circuit Partitioning for Distributed Quantum Computing
• Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
• 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
• Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
• Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks