Distributing circuits over heterogeneous, modular quantum computing network architectures

Abstract

We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck and they are likely to add more noise to the computation than operations performed within a module. We introduce several techniques for transforming a given quantum circuit into one implementable on a network of the aforementioned type, minimising the number of Bell states required to do so. We extend previous works on circuit distribution over fully connected networks to the case of heterogeneous networks. On the one hand, we extend the hypergraph approach of [Andres-Martinez & Heunen. 2019] to arbitrary network topologies. We additionally make use of Steiner trees to find efficient realisations of the entanglement sharing within the network, reusing already established connections as often as possible. On the other hand, we extend the embedding techniques of [Wu, et al. 2022] to networks with more than two modules. Furthermore, we discuss how these two seemingly incompatible approaches can be made to cooperate. Our proposal is implemented and benchmarked; the results confirming that, when orchestrated, the two approaches complement each other's weaknesses.

arXiv comment30 pages, 18 figures, comments welcome; v2 - Add link to experiment data; v3 - 31 pages, small updates to discussion and references

References in corpus (24)

• Emergence of scaling in random networks
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Efficient Behavior of Small-World Networks
• A variational eigenvalue solver on a quantum processor
• Validating quantum computers using randomized model circuits
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• Optimal local implementation of non-local quantum gates
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Doubling the size of quantum simulators by entanglement forging
• A quantum network stack and protocols for reliable entanglement-based networks
• Designing a Quantum Network Protocol
• PyZX: Large Scale Automated Diagrammatic Reasoning
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Automated distribution of quantum circuits via hypergraph partitioning
• Circuit knitting with classical communication
• Phase Gadget Synthesis for Shallow Circuits
• Optimized compiler for Distributed Quantum Computing
• Minimally complex ion traps as modules for quantum communication and computing
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Entanglement-efficient bipartite-distributed quantum computing

Cited by in corpus (10)

• Distributed Quantum Computing: a Survey
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Generalised Circuit Partitioning for Distributed Quantum Computing
• Networked Quantum Services
• A Multilevel Framework for Partitioning Quantum Circuits
• On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
• Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
• Fidelity and Entanglement of Random Bipartite Pure States: Insights and Applications
• A dataflow programming framework for linear optical distributed quantum computing