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

AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES

Earl T. Campbell, Joseph F. Fitzsimons

Published Feb 1, 2010• 13 citations
OpenAlex

Abstract

This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.

Related papers

AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES

Earl T. Campbell, JOSEPH FITZSIMONS

This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.

arXiv:0906.2725•International Journal of Quantum Information•Feb 1, 2010•14 citations

QUANTUM COMPUTING MEETS DISTRIBUTED SYSTEMS IN AI: A TECHNICAL OVERVIEW

Ankush Singhal

The convergence of quantum computing and distributed artificial intelligence systems represents a transformative advancement in computational science.This article explores the architectural frameworks, implementation strategies, and practical applications of quantum-distributed systems in AI.The article examines quantum cloud

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY•Feb 11, 2025•1 citation

Distributed quantum computing models: Study of architectures and models for the distribution of quantum computing tasks across multiple quantum nodes

Akaash Vishal Hazarika, Mahak Shah

The exploration of distributed quantum computing (DQC) represents a significant frontier in quantum information science, aiming to harness the unique properties of quantum mechanics to solve complex computational problems effectively. This paper discusses the diverse architectures and models that facilitate the distribution of quantum computing tasks across multiple quantum nodes, thereby addressing the limitations inherent in single quantum devices. DQC systems exploit the principles of superposition and entanglement to enhance computational capabilities beyond what classical computing systems can achieve. We examine various DQC architectures, including both quantum-classical hybrid systems and fully quantum distributed systems, highlighting their respective benefits and challenges. Key issues such as coherence, communication overhead, and error correction are discussed in detail, and we analyze specific use cases where DQC demonstrates superior performance relative to classical computing approaches, including optimization problems in logistics and finance, as well as quantum simulations for material science. Furthermore, we identify future research directions aimed at overcoming existing barriers to the practical implementation of DQC systems. By assessing the current landscape and future possibilities of DQC, this paper underscores the transformative potential of distributed quantum computing in various fields, paving the way for realizing more complex quantum algorithms and applications.

International Journal of Science and Research Archive•Dec 30, 2024•5 citations

QUANTUM COMPUTING: A COMPREHENSIVE REVIEW OF PRINCIPLES, TECHNOLOGIES AND EMERGING APPLICATIONS

Sudipta Bhanja, Tanmay Kumar Behera, Subhadip Das +4 more

Quantum computing represents a transformative approach to computation leveraging fundamental principles of quantum mechanics such as superposition, entanglement and interference to store and process information in ways that classical computers cannot achieve.This paper attempts to provide a bona fide bibliographic overview of the principles, computational models, hardware technologies, and potential applications of quantum computing.It analyses how quantum algorithms could outperform classical algorithms in cryptographic analysis, optimization, and big data analysis.The survey integrates viewpoints from recent works; it presents system architectures, software development challenges, and quantum-assisted applications in healthcare, artificial intelligence, cybersecurity, and industrial optimization.Meanwhile, it examines hybrid quantum-classical systems that would allow quantum technologies to be deployed in the near term skirted by the limitations currently posed by quantum hardware.Moreover, the paper discusses foremost hurdles in scaling, error-correction, and maintaining coherence.From reviewing the recent developments and whether possible, this present review work informs researchers, engineers, and practitioners alike on the current state, as well as on the long-run viability, of quantum computing.

•Mar 29, 2026•0 citations

Architectures and circuits for distributed quantum computing

Daniele Cuomo

This thesis treats networks providing quantum computation based on distributed paradigms. Compared to architectures relying on one processor, a network promises to be more scalable and less fault-prone. Developing a distributed system able to provide practical quantum computation comes with many challenges, each of which need to be faced with careful analysis in order to create a massive integration of several components properly engineered. In accordance with hardware technologies, currently under construction around the globe, telegates represent the fundamental inter-processor operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generation and distribution is an expensive resource, as it is time-consuming. The main contribution of this thesis is on the definition of compilers that minimize the impact of telegates on the overall fidelity. Specifically, we give rigorous formulations of the subject problem, allowing us to identify the inter-dependence between computation and communication. With the support of some of the best tools for reasoning -- i.e. network optimization, circuit manipulation, group theory and ZX-calculus -- we found new perspectives on the way a distributed quantum computing system should evolve.

arXiv:2307.07908•Jul 16, 2023•0 citations

One-way Quantum Computation - a tutorial introduction

Dan E. Browne, Hans J. Briegel

In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations.

arXiv:quant-ph/0603226•Mar 24, 2006•47 citations
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.
The exploration of distributed quantum computing (DQC) represents a significant frontier in quantum information science, aiming to harness the unique properties of quantum mechanics to solve complex computational problems effectively. This paper discusses the diverse architectures and models that facilitate the distribution of quantum computing tasks across multiple quantum nodes, thereby addressing the limitations inherent in single quantum devices. DQC systems exploit the principles of superposition and entanglement to enhance computational capabilities beyond what classical computing systems can achieve. We examine various DQC architectures, including both quantum-classical hybrid systems and fully quantum distributed systems, highlighting their respective benefits and challenges. Key issues such as coherence, communication overhead, and error correction are discussed in detail, and we analyze specific use cases where DQC demonstrates superior performance relative to classical computing approaches, including optimization problems in logistics and finance, as well as quantum simulations for material science. Furthermore, we identify future research directions aimed at overcoming existing barriers to the practical implementation of DQC systems. By assessing the current landscape and future possibilities of DQC, this paper underscores the transformative potential of distributed quantum computing in various fields, paving the way for realizing more complex quantum algorithms and applications.
Quantum computing represents a transformative approach to computation leveraging fundamental principles of quantum mechanics such as superposition, entanglement and interference to store and process information in ways that classical computers cannot achieve.This paper attempts to provide a bona fide bibliographic overview of the principles, computational models, hardware technologies, and potential applications of quantum computing.It analyses how quantum algorithms could outperform classical algorithms in cryptographic analysis, optimization, and big data analysis.The survey integrates viewpoints from recent works; it presents system architectures, software development challenges, and quantum-assisted applications in healthcare, artificial intelligence, cybersecurity, and industrial optimization.Meanwhile, it examines hybrid quantum-classical systems that would allow quantum technologies to be deployed in the near term skirted by the limitations currently posed by quantum hardware.Moreover, the paper discusses foremost hurdles in scaling, error-correction, and maintaining coherence.From reviewing the recent developments and whether possible, this present review work informs researchers, engineers, and practitioners alike on the current state, as well as on the long-run viability, of quantum computing.
This thesis treats networks providing quantum computation based on distributed paradigms. Compared to architectures relying on one processor, a network promises to be more scalable and less fault-prone. Developing a distributed system able to provide practical quantum computation comes with many challenges, each of which need to be faced with careful analysis in order to create a massive integration of several components properly engineered. In accordance with hardware technologies, currently under construction around the globe, telegates represent the fundamental inter-processor operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generation and distribution is an expensive resource, as it is time-consuming. The main contribution of this thesis is on the definition of compilers that minimize the impact of telegates on the overall fidelity. Specifically, we give rigorous formulations of the subject problem, allowing us to identify the inter-dependence between computation and communication. With the support of some of the best tools for reasoning -- i.e. network optimization, circuit manipulation, group theory and ZX-calculus -- we found new perspectives on the way a distributed quantum computing system should evolve.
In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations.