Presentation

ON

Compiler Design for Distributed Quantum

Computing
BY
DAVIDE FERRARI1 (Graduate Student Member, IEEE),
ANGELA SARA CACCIAPUOTI2,3 (Senior Member, IEEE),
MICHELE AMORETTI1 (Senior Member, IEEE), AND
MARCELLO CALEFFI2,3 (Senior Member, IEEE)
 Nibir Hossain (221-15-5057)

Nasif Abdullah (221-15-

5240)
Team
members Mahfujur Rahman (221-15-
4691)

Sajjad Hossain Jim (221-15-

5364)
Introduction

What is Distributed Quantum Computing?

o Multiple quantum processors (QPUs) work together over a quantum network.
o Helps solve complex problems beyond a single quantum computer’s ability.

Why Do We Need a Special Compiler?

o Standard quantum compilers work for single processors only.
o Distributed systems need optimized qubit routing, communication, and error
handling.
o Without optimization, execution becomes slow and error-prone.
 Quantum computing is evolving rapidly, but the
lack of efficient compilers for distributed
quantum architectures poses significant
challenges. Traditional quantum compilers are
designed for single-device execution and struggle
Problem with inter-QPU communication, qubit routing, and
statement entanglement management. This research aims
to develop an optimized quantum compiler that
minimizes latency, error rates, and computational
overhead in a distributed quantum computing
environment.
 Literature Review

1. Title: Cacciapuoti et al., proposed "Quantum

Internet: Networking Challenges in Distributed
Quantum Computing" [1]
Contributions:
• Analyzed key networking challenges in distributed quantum computing.
• Explored entanglement distribution, quantum error correction, and scalability for large-scale quantum networks.
• Proposed a quantum network model for integrating quantum processors using teleportation and entanglement swapping.
Limitations:
• Did not address practical compiler implementations for distributed quantum circuits.
• Assumes ideal entanglement generation rates, which may not be feasible in real-world scenarios.
 Literature Review(Contd.)

2. Title: Caleffi et al., proposed "Quantum Internet:

From Communication to Distributed Computing!" [2]
Contributions:
• Investigated how quantum networking protocols can facilitate distributed computing.
• Proposed a framework for routing entanglement in quantum networks to optimize multi-QPU collaboration.
• Emphasized the importance of quantum memory and error correction in distributed quantum computing.
Limitations:
• The proposed model does not account for hardware constraints in near-term quantum devices.
• Lacks an efficient quantum circuit compiler for mapping algorithms onto distributed architectures.
 Literature Review(Contd.)
3. Title: Caleffi et al., proposed "The Rise of the Quantum Internet" [3]
Contributions:
• Provided a roadmap for the Quantum Internet, emphasizing its role in secure
communication and computing.
• Discussed entanglement-assisted communication for long-distance quantum
networks.
• Proposed a layered quantum network model to optimize distributed quantum
operations.
Limitations:
• Did not propose concrete compiler optimizations for distributed quantum computing.
• The scalability of entanglement distribution remains an open challenge in real-world
implementations.
 Literature Review(Contd.)

4. Title: Meter & Devitt, proposed "The Path to

Scalable Distributed Quantum Computing" [4]
Contributions:
• Outlined architectural requirements for scalable distributed quantum computing.
• Explored quantum error correction techniques to improve the fidelity of remote operations.
• Proposed a networking model to interconnect multiple quantum processors efficiently.
Limitations:
• The study assumes perfect quantum memories, which are not yet available in real devices.
• Did not provide practical compiler implementations for distributed quantum circuits.
 Literature Review(Contd.)
5. Title: Pirandola & Braunstein, proposed "Physics: Unite to Build a Quantum
Internet" [5]
Contributions:
• Proposed a unified framework for quantum communication and computing.
• Discussed the role of quantum teleportation in enabling secure distributed quantum
networks.
• Highlighted hardware challenges in implementing global-scale quantum networking.
Limitations:
• The study is theoretical and lacks experimental validation on quantum processors.
• Does not consider compiler-level optimizations for distributed quantum computing.
Paper Objective Algorithm Dataset Evaluation Metrics Accuracy

Long-distance
Report on China’s quantum Quantum entanglement Real-world
[6] Gibney (2016) entanglement success Not specified
satellite experiments distribution experimental data
rate

Examine potential of global Quantum network expansion Real-world Scalability of quantum

[7] Simon (2017) Not applicable
quantum networks models experimental data communication

[8] Wehner et al. Roadmap for the Quantum Quantum repeaters, Real-world Fault tolerance, Quantum
Not applicable
(2018) Internet Entanglement purification experimental data link efficiency

[9] Zomorodi- Optimize teleportation cost

Graph partitioning for Reduction in
Moghadam et al. in distributed quantum Not specified Not specified
quantum circuits teleportation cost
(2018) circuits

[10] Zomorodi- Optimize teleportation cost

Graph partitioning for Real-world Reduction in
Moghadam et al. in distributed quantum Not applicable
quantum circuits experimental data teleportation cost
(2018) circuits
Objectives

Develop a compiler framework optimized for distributed quantum

architectures.

Optimize qubit mapping and routing to reduce communication overhead.

Improve error correction mechanisms to enhance execution fidelity.

Reduce compilation time through heuristic and AI-based optimizations.

Evaluate performance metrics across real quantum hardware and simulations.

Research Questions?

How can a quantum What are the most How does compiler What are the trade-offs How can machine
compiler efficiently effective error optimization impact the between classical pre- learning techniques
handle qubit allocation correction techniques performance of quantum processing and real- enhance quantum
and routing in for reducing execution circuits across multiple time quantum compilation efficiency?
distributed quantum errors in a distributed QPUs? execution?
systems? setup?
Dataset

• IBM Q Experience dataset (real-world quantum circuit execution

logs).
• Rigetti Forest and Amazon Braket quantum simulations for multi-
QPU experiments.
• QASM benchmark circuits (used for evaluating compilation
performance).
• Quantum error correction datasets (for assessing noise mitigation
strategies).
Preprocessing

• Circuit optimization: Removing redundant gates and

reducing quantum depth.
• Noise-aware mapping: Assigning qubits to minimize error
propagation.
• Qubit partitioning: Dividing workloads across multiple
QPUs efficiently.
• Gate reordering: Minimizing costly inter-QPU operations.
Regular
Compiler
Proposed Compiler Workflow
Layer by layer workflow
Proposed Algorithm Architecture
Quantum Circuit Analysis • Parses input quantum circuits (QASM-based).
Module • Identifies critical operations requiring inter-QPU
communication.

Qubit Allocation & Routing • Implements topology-aware qubit mapping.

Module • Uses graph-based algorithms to minimize communication
overhead.

Error Mitigation & Optimization

Module • Applies noise-aware error correction strategies.
• Reduces logical errors via LDPC-based fault tolerance.

Compilation & Execution • Translates circuits into an optimized gate-level

Scheduler representation.
• Schedules execution on distributed quantum hardware.
 • High Communication
Overhead – Frequent qubit
communication between QPUs
increases latency and errors.
• Assumption of Ideal QPU
Connectivity – The approach
Limitations assumes strong connectivity,
which is not always practical.
• Scalability Issues – Performance
on large-scale quantum systems
remains uncertain.
Conclusion

• This research presents a novel compiler architecture for

distributed quantum computing that optimizes qubit
routing, error correction, and execution scheduling.
The proposed approach enhances circuit fidelity, reduces
latency, and improves scalability for future quantum
networks. Experimental evaluations on IBM Q, Rigetti, and
Amazon Braket demonstrate significant performance gains,
paving the way for more efficient distributed quantum
computing frameworks.
Reference
• [1] A. S. Cacciapuoti, M. Caleffi, F. Tafuri, F. S. Cataliotti, S. Gherardini, and G. Bianchi, “Quantum Internet:
Networking challenges in distributed quantum computing,” IEEE Netw., vol. 34, no. 1, pp. 137–143,
Jan./Feb. 2020, doi: 10.1109/MNET.001.1900092.
• [2] M. Caleffi, A. S. Cacciapuoti, and G. Bianchi, “Quantum Internet: From communication to distributed
computing!” in Proc. 5th ACM Int. Conf. Nanoscale Comput. Commun., 2018, Art. no. 3, doi:
10.1145/3233188.3233224.
• [3] M. Caleffi, D. Chandra, D. Cuomo, S. Hassanpour, and A. S. Cacciapuoti, “The rise of the quantum
Internet,” Computer, vol. 53, no. 6, pp. 67–72, 2020, doi: 10.1109/MC.2020.2984871.
• [4] R. V. Meter and S. J. Devitt, “The path to scalable distributed quantum computing,” Computer, vol. 49,
no. 9, pp. 31–42, Sep. 2016, doi: 10.1109/MC.2016.291.
• [5] S. Pirandola and S. L. Braunstein, “Physics: Unite to build a quantum internet,” Nature, vol. 532, no.
7598, pp. 169–171, Apr. 2016, doi: 10.1038/532169a.
Reference
• [6] E. Gibney, “Chinese satellite is one giant step for the quantum Internet,” Nature, vol.
535, no. 7613, pp. 478–479, Jul. 2016, doi: 10.1038/535478a.
• [7] W. D, R. Lamprecht, and S. Heusler, “Towards a quantum Internet,” Eur. J. Phys., vol. 38,
no. 4, May 2017, Art. no. 043001, doi: 10.1088/1361-6404/aa6df7.
• [8] C. Simon, “Towards a global quantum network,” Nat. Photon., vol. 11, no. 11, pp. 678–
680, 2017, doi: 10.1038/s41566-017-0032-0.
• [9] S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,”
Science, vol. 362, no. 6412, 2018, Art. no. eaam9288,doi: 10.1126/science.aam9288.
• [10] M. Zomorodi-Moghadam, M. Houshmand, and M. Houshmand, “Optimizing teleportation
cost in distributed quantum circuits,” Int. J. Theor.Phys., vol. 57, pp. 848–861, 2018, doi:
10.1007/s10773-017-3618-x.
THANK YOU