Compiler Design for Distributed Quantum Computing

Ferrari, Davide; Cacciapuoti, Angela Sara; Amoretti, Michele; Caleffi, Marcello

doi:10.48550/arxiv.2012.09680

Cited by 2 publications

(3 citation statements)

References 33 publications

(74 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To achieve this, an optimal assignment of the logical qubits to the physical qubits of different cores is crucial. The literature on this topic is limited: some proposals focused on the quantum compilation for distributed quantum computing [11,29], whereas others focused only on the quantum circuit mapping part of compilation [8], which is closer to our work. In [8], the quantum circuit is split into smaller partitions.…”

Section: Background and Related Workmentioning

confidence: 74%

“…To address this challenge, various mapping algorithms have been proposed [10]. However, due to the early-stage development of modular quantum computing architectures, just a few quantum circuit mapping techniques [8,11] have been explored, and they are only tested on architectures with a small number of qubits and simple, unrealistic all-to-all connectivity between qubits with limited benchmark sets.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mapping Quantum Circuits to Modular Architectures with QUBO

Bandic,

Prielinger,

Nüßlein

et al. 2023

2023 IEEE International Conference on Quantum Computing and Engineering (QCE)

View full text Add to dashboard Cite

Modular quantum computing architectures are a promising alternative to monolithic QPU (Quantum Processing Unit) designs for scaling up quantum devices. They refer to a set of interconnected QPUs or cores consisting of tightly coupled quantum bits that can communicate via quantum-coherent and classical links. In multi-core architectures, it is crucial to minimize the amount of communication between cores when executing an algorithm. Therefore, mapping a quantum circuit onto a modular architecture involves finding an optimal assignment of logical qubits (qubits in the quantum circuit) to different cores with the aim to minimize the number of expensive inter-core operations while adhering to given hardware constraints. In this paper, we propose for the first time a Quadratic Unconstrained Binary Optimization (QUBO) technique to encode the problem and the solution for both qubit allocation and inter-core communication costs in binary decision variables. To this end, the quantum circuit is split into slices, and qubit assignment is formulated as a graph partitioning problem for each circuit slice. The costly inter-core communication is reduced by penalizing inter-core qubit communications. The final solution is obtained by minimizing the overall cost across all circuit slices. To evaluate the effectiveness of our approach, we conduct a detailed analysis using a representative set of benchmarks having a high number of qubits on two different multi-core architectures. Our method showed promising results and performed exceptionally well with very dense and highly-parallelized circuits that require on average 0.78 inter-core communications per two-qubit gate.

show abstract

Section: Background and Related Workmentioning

confidence: 74%

Section: Introductionmentioning

confidence: 99%

Mapping Quantum Circuits to Modular Architectures with QUBO

Bandic,

Prielinger,

Nüßlein

et al. 2023

2023 IEEE International Conference on Quantum Computing and Engineering (QCE)

View full text Add to dashboard Cite

show abstract

“…Distributed quantum architectures have been proposed in [24][25][26]. Related works present techniques for targeting a network of quantum chips for unified computing tasks [27,28]. Major players in quantum computing have noted the potential of distribution for scaling quantum computers [15,29].…”

Section: Introductionmentioning

confidence: 99%

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

LaRacuente¹,

Smith²,

Imany³

et al. 2022

Preprint

View full text Add to dashboard Cite

A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributing a quantum computer across nearby small qubit arrays, known as chiplets, could solve many problems associated with size. We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware. We model and evaluate the chiplet architecture in a way that bridges the physical and network layers. We find concrete evidence that distributed quantum computing may accelerate the path toward useful and ultimately scalable quantum computers. In the long-term, short-range networks may underlie quantum computers just as local area networks underlie classical datacenters and supercomputers today.

show abstract

Compiler Design for Distributed Quantum Computing

Cited by 2 publications

References 33 publications

Mapping Quantum Circuits to Modular Architectures with QUBO

Mapping Quantum Circuits to Modular Architectures with QUBO

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

Contact Info

Product

Resources

About