Compiler Design for Distributed Quantum Computing
arXiv:2012.09680 · doi:10.1109/TQE.2021.3053921
Abstract
In distributed quantum computing architectures, with the network and communications functionalities provided by the Quantum Internet, remote quantum processing units (QPUs) can communicate and cooperate for executing computational tasks that single NISQ devices cannot handle by themselves. To this aim, distributed quantum computing requires a new generation of quantum compilers, for mapping any quantum algorithm to any distributed quantum computing architecture. With this perspective, in this paper, we first discuss the main challenges arising with compiler design for distributed quantum computing. Then, we analytically derive an upper bound of the overhead induced by quantum compilation for distributed quantum computing. The derived bound accounts for the overhead induced by the underlying computing architecture as well as the additional overhead induced by the sub-optimal quantum compiler -- expressly designed through the paper to achieve three key features, namely, general-purpose, efficient and effective. Finally, we validate the analytical results and we confirm the validity of the compiler design through an extensive performance analysis.
References in corpus (21)
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Characterizing Quantum Supremacy in Near-Term Devices
- Extending the computational reach of a noisy superconducting quantum processor
- Experimental Comparison of Two Quantum Computing Architectures
- Quantum Internet: Networking Challenges in Distributed Quantum Computing
- Towards a global quantum network
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
- Towards a Distributed Quantum Computing Ecosystem
- Learning the quantum algorithm for state overlap
- Natural two-qubit gate for quantum computation using the XY interaction
- Efficient Distributed Quantum Computing
- Local and Distributed Quantum Computation
- Fast Quantum Modular Exponentiation
- Challenges and Opportunities of Near-Term Quantum Computing Systems
- Quantum Internet: from Communication to Distributed Computing!
- Automated distribution of quantum circuits via hypergraph partitioning
- Arithmetic on a Distributed-Memory Quantum Multicomputer
- Efficient and Effective Quantum Compiling for Entanglement-based Machine Learning on IBM Q Devices
- On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
Cited by in corpus (34)
- Distributed Quantum Computing: a Survey
- Quantum Internet Protocol Stack: a Comprehensive Survey
- Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
- A Modular Quantum Compilation Framework for Distributed Quantum Computing
- Multicore Quantum Computing
- Optimized compiler for Distributed Quantum Computing
- Quantum NETwork: from theory to practice
- Entanglement-efficient bipartite-distributed quantum computing
- Generalised Circuit Partitioning for Distributed Quantum Computing
- Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures
- Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States
- Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
- When Federated Learning Meets Quantum Computing: Survey and Research Opportunities
- Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
- Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
- Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
- A Multilevel Framework for Partitioning Quantum Circuits
- TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
- Quantum Data Centers in the Presence of Noise
- A Design Framework for the Simulation of Distributed Quantum Computing
- Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
- The simulation of distributed quantum algorithms
- Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
- Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing
- Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
- Evolutionary-Based Circuit Optimization for Distributed Quantum Computing
- Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
- A dataflow programming framework for linear optical distributed quantum computing
- Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
- DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing
- Optimizing Compilation for Distributed Quantum Computing via Clustering and Annealing
- Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks
- RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks