Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Photonics Conference

Distributed quantum computation – how does it scale?

Kae Nemoto, Michael Hanks, Nicoló Lo Piparo, William J. Munro

Published Sep 1, 2020• 0 citations
Publisher

Abstract

We explore the concept of distributed quantum computation, discussing the advantages and disadvantages of this approach. We divide its development into three layers and highlight the challenges we face in each stage. With a few examples we explore the scalability of such disturbed quantum systems. © 2020 The Author(s)
DOI
10.1109/ipc47351.2020.9252393

Related papers

Distributed quantum information processing (Conference Presentation)

Kae Nemoto

This talk explores distributed quantum information processing. In the recent years, the monolithic design of quantum computers has been investigated and huge efforts to realize such designs have been undertaken worldwide. By contrast, distributed quantum information processing relies on quantum signalling between quantum devices and systems. We begin by introducing the concept of distributed quantum information processing, detailing it's advantages and disadvantages. We further discuss the feasibility of quantum devices and systems to perform distributed quantum information processing, including recent developments using NV centers in diamond.

Quantum Nanophotonic Materials, Devices, and Systems•Sep 10, 2019•0 citations

Distributed quantum computation for near-term quantum environments

László Gyöngyösi, Sándor Imre

A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from smaller quantum devices to large-scale quantum computers. Here, we define a scalable distributed model of gate-model quantum computation in near-term quantum systems.

•Apr 9, 2021•4 citations

Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation

Teague Tomesh, Zain H. Saleem, Michael A. Perlin +3 more

Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. The QDCA, an example of application-compiler co-design, alters the structure of the variational ansatz to tame the exponential compilation overhead incurred by quantum circuit cutting. The result of this cross-layer co-design is a highly flexible algorithm which can be tuned to the amount of classical or quantum computational resources that are available, and can be applied to both near- and long-term distributed quantum ar-chitectures. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms. We also evaluate an 8-qubit QDCA ansatz on a superconducting quantum computer and show that circuit cutting can help to mitigate the effects of noise. Our work demonstrates how many small-scale quantum computers canwork together to solve problems 85 % larger than their own qubit count, motivating the development and potential of large-scale distributed quantum computing.

arXiv:2107.07532•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•26 citations

Distributed quantum computing: A survey

Marcello Caleffi, Michele Amoretti, Davide Ferrari +3 more

Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundreds of noisy qubits. Yet – to fully unveil the potential of quantum computing out of the labs into the business reality – the challenge ahead is to substantially scale the qubit number, reaching orders of magnitude exceeding thousands of fault-tolerant qubits. To this aim, the distributed quantum computing paradigm is recognized as the key solution for scaling the number of qubits. Indeed, accordingly to such a paradigm, multiple small-to-moderate-scale quantum processors communicate and cooperate for executing computational tasks exceeding the computational power of single processing devices. The aim of this survey is to provide the reader with an overview about the main challenges and open problems arising with distributed quantum computing from a computer and communications engineering perspective. Furthermore, this survey provides an easy access and guide towards the relevant literature and the prominent results in the field.

arXiv:2212.10609•Computer Networks•Aug 8, 2024•271 citations

The Path to Scalable Distributed Quantum Computing

Rodney Van Meter, Simon J. Devitt

Researchers are fabricating quantum processors powerful enough to execute small instances of quantum algorithms. Scalability concerns are motivating distributed-memory multicomputer architectures, and experimental efforts have demonstrated some of the building blocks for such a design. Numberous systems are emerging with the goal of enabling local and distributed quantum computing.

arXiv:1605.06951•Computer•Sep 1, 2016•200 citations

A Comparative Review of Quantum Computing: From Foundational Algorithms to Strategic Global Dominance and Real World Applications.

Palla Sravani, K. Satyanarayana

A paradigm shift in computation is being brought about by quantum computing, which uses the concepts of quantum mechanics to tackle problems that even the most powerful conventional supercomputers cannot solve. This review provides an in-depth overview of the field, covering everything from basic concepts to the cutting edge. The three fundamental building blocks of quantum processing—the qubit, superposition, and entanglement—are first described.These ideas enable quantum computers to concurrently explore large computational domains. After that, the paper examines the various physical implementations, highlighting the advantages and disadvantages of the top hardware platforms, such as neutral atoms, trapped ions, photonic systems, and superconducting circuits, in terms of coherence and scalability. Shor's method for integer factorization and Grover's algorithm for unstructured search are two examples of groundbreaking quantum algorithms that are highlighted for their potential to achieve exponential and quadratic speedups over their classical counterparts. We also examine how programming languages that bridge the gap between abstract algorithms and physical hardware are being developed, as well as the new quantum software stack. The paper also explores how quantum computing can revolutionize a number of fields, such as machine learning, materials research, medication development, and cryptography. subsequently, we discuss two of the biggest challenges impeding the development of large-scale, fault-tolerant quantum computers: the requirement for robust quantum error correction and decoherence. In the end, a view of the current period of Noisy Intermediate-Scale Quantum (NISQ) and the path towards quantum advantage is presented. Researchers, students, and professionals looking for a comprehensive grasp of this quickly developing and revolutionary topic are expected to find this review to be an invaluable asset.

INTERNATIONAL JOURNAL OF CURRENT SCIENCE•Jan 1, 2025•0 citations
This talk explores distributed quantum information processing. In the recent years, the monolithic design of quantum computers has been investigated and huge efforts to realize such designs have been undertaken worldwide. By contrast, distributed quantum information processing relies on quantum signalling between quantum devices and systems. We begin by introducing the concept of distributed quantum information processing, detailing it's advantages and disadvantages. We further discuss the feasibility of quantum devices and systems to perform distributed quantum information processing, including recent developments using NV centers in diamond.
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. The QDCA, an example of application-compiler co-design, alters the structure of the variational ansatz to tame the exponential compilation overhead incurred by quantum circuit cutting. The result of this cross-layer co-design is a highly flexible algorithm which can be tuned to the amount of classical or quantum computational resources that are available, and can be applied to both near- and long-term distributed quantum ar-chitectures. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms. We also evaluate an 8-qubit QDCA ansatz on a superconducting quantum computer and show that circuit cutting can help to mitigate the effects of noise. Our work demonstrates how many small-scale quantum computers canwork together to solve problems 85 % larger than their own qubit count, motivating the development and potential of large-scale distributed quantum computing.
Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundreds of noisy qubits. Yet – to fully unveil the potential of quantum computing out of the labs into the business reality – the challenge ahead is to substantially scale the qubit number, reaching orders of magnitude exceeding thousands of fault-tolerant qubits. To this aim, the distributed quantum computing paradigm is recognized as the key solution for scaling the number of qubits. Indeed, accordingly to such a paradigm, multiple small-to-moderate-scale quantum processors communicate and cooperate for executing computational tasks exceeding the computational power of single processing devices. The aim of this survey is to provide the reader with an overview about the main challenges and open problems arising with distributed quantum computing from a computer and communications engineering perspective. Furthermore, this survey provides an easy access and guide towards the relevant literature and the prominent results in the field.
A paradigm shift in computation is being brought about by quantum computing, which uses the concepts of quantum mechanics to tackle problems that even the most powerful conventional supercomputers cannot solve. This review provides an in-depth overview of the field, covering everything from basic concepts to the cutting edge. The three fundamental building blocks of quantum processing—the qubit, superposition, and entanglement—are first described.These ideas enable quantum computers to concurrently explore large computational domains. After that, the paper examines the various physical implementations, highlighting the advantages and disadvantages of the top hardware platforms, such as neutral atoms, trapped ions, photonic systems, and superconducting circuits, in terms of coherence and scalability. Shor's method for integer factorization and Grover's algorithm for unstructured search are two examples of groundbreaking quantum algorithms that are highlighted for their potential to achieve exponential and quadratic speedups over their classical counterparts. We also examine how programming languages that bridge the gap between abstract algorithms and physical hardware are being developed, as well as the new quantum software stack. The paper also explores how quantum computing can revolutionize a number of fields, such as machine learning, materials research, medication development, and cryptography. subsequently, we discuss two of the biggest challenges impeding the development of large-scale, fault-tolerant quantum computers: the requirement for robust quantum error correction and decoherence. In the end, a view of the current period of Noisy Intermediate-Scale Quantum (NISQ) and the path towards quantum advantage is presented. Researchers, students, and professionals looking for a comprehensive grasp of this quickly developing and revolutionary topic are expected to find this review to be an invaluable asset.