Open Access iconOpen Access

ARTICLE

crossmark

A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution

Oliver Crampton1,*, Panagiotis Promponas1,2, Richard Chen1, Paul Polakos1, Leandros Tassiulas2, Louis Samuel1

1 Cisco Systems UK, Bedfont Lakes, London, TW14 8HA, UK
2 Department of Electrical Engineering, Yale University, New Haven, CT 06511, USA

* Corresponding Author: Oliver Crampton. Email: email

Journal of Quantum Computing 2025, 7, 1-15. https://doi.org/10.32604/jqc.2025.061275

Abstract

Distributed Quantum Computing (DQC) provides a means for scaling available quantum computation by interconnecting multiple quantum processor units (QPUs). A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs, a task known to be NP-hard. Traditional approaches, primarily focused on graph partitioning strategies, have sought to reduce the number of required Bell pairs for executing non-local CNOT operations, a form of gate teleportation. However, these methods have limitations in terms of efficiency and scalability. Addressing this, our work jointly considers gate and qubit teleportations introducing a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit. By allowing dynamic reallocation of qubits along with gate teleportations during circuit execution, our method significantly enhances the overall efficacy and potential scalability of DQC frameworks. In our numerical analysis, we demonstrate that integrating qubit teleportations into our genetic algorithm for optimizing circuit blocking reduces the required resources, specifically the number of EPR pairs, compared to traditional graph partitioning methods. Our results, derived from both benchmark and randomly generated circuits, show that as circuit complexity increases—demanding more qubit teleportations—our approach effectively optimises these teleportations throughout the execution, thereby enhancing performance through strategic circuit partitioning. This is a step forward in the pursuit of a global quantum compiler which will ultimately enable the efficient use of a ‘quantum data center’ in the future.

Keywords

Distributed quantum computing; optimisation; teleportation; heuristic

Cite This Article

APA Style
Crampton, O., Promponas, P., Chen, R., Polakos, P., Tassiulas, L. et al. (2025). A genetic approach to minimising gate and qubit teleportations for multi-processor quantum circuit distribution. Journal of Quantum Computing, 7(1), 1–15. https://doi.org/10.32604/jqc.2025.061275
Vancouver Style
Crampton O, Promponas P, Chen R, Polakos P, Tassiulas L, Samuel L. A genetic approach to minimising gate and qubit teleportations for multi-processor quantum circuit distribution. J Quantum Comput. 2025;7(1):1–15. https://doi.org/10.32604/jqc.2025.061275
IEEE Style
O. Crampton, P. Promponas, R. Chen, P. Polakos, L. Tassiulas, and L. Samuel, “A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution,” J. Quantum Comput., vol. 7, no. 1, pp. 1–15, 2025. https://doi.org/10.32604/jqc.2025.061275



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 95

    View

  • 43

    Download

  • 0

    Like

Share Link