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

Bulletin of the American Physical Society

Distributed Quantum Computing Architectures

Martin Suchara, Yuri Alexeev, Frederic T. Chong, Finkel, Hal, Henry Hoffmann, Jeffrey M. Larson, Osborn, James, Smith, Graeme

Published Jan 1, 2018• 0 citations
Publisher
DOI
10.13140/rg.2.2.17130.95686

Related papers

SDQC: Distributed Quantum Computing Architecture Utilizing Entangled Ion Qubit Shuttling

Seunghyun Baek, Seok-Hyung Lee, Dongmoon Min +1 more

We propose Shuttling-based Distributed Quantum Computing (SDQC), a hybrid architecture that combines the strengths of physical qubit shuttling and distributed quantum computing to enable scalable trapped-ion quantum computing. SDQC performs non-local quantum operations by distributing entangled ion qubits via deterministic shuttling, combining the high-fidelity and deterministic operations of shuttling-based architectures with the parallelism and pipelining advantages of distributed quantum computing. We present (1) a practical architecture incorporating quantum error correction (QEC), (2) pipelining strategies to exploit parallelism in entanglement distribution and measurement, and (3) a performance evaluation in terms of logical error rate and clock speed. For a 256-bit elliptic-curve discrete logarithm problem (ECDLP) instance, which requires 2,871 logical qubits at code distance 13, SDQC achieves a logical error rate which is $1.20^{+0.94}_{-0.45}\times10^{-8}$ of Photonic DQC error rate and $3.79^{+5.09}_{-2.84}\times10^{-3}$ of Quantum Charge-Coupled Device (QCCD) error rate, while providing 2.82 times faster logical clock speed than QCCD.

quant-pharXiv:2512.02890•Dec 3, 2025•0 citations

Architectures and Circuits for Distributed Quantum Computing

Daniele Cuomo

Springer theses•Jan 1, 2024•2 citations

Quantum Computing Architectures

Hansika Weerasena, Prabhat Mishra

Springer eBooks•Jan 1, 2026•0 citations

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

Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads

Nitish Kumar Chandra, Eneet Kaur, Kaushik P. Seshadreesan

Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.

quant-pharXiv:2511.13657•IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA)•Nov 18, 2025•1 citation

Distributed Quantum Computing

Harry Buhrman, Hein Röhrig

Lecture notes in computer science•Jan 1, 2003•95 citations
We propose Shuttling-based Distributed Quantum Computing (SDQC), a hybrid architecture that combines the strengths of physical qubit shuttling and distributed quantum computing to enable scalable trapped-ion quantum computing. SDQC performs non-local quantum operations by distributing entangled ion qubits via deterministic shuttling, combining the high-fidelity and deterministic operations of shuttling-based architectures with the parallelism and pipelining advantages of distributed quantum computing. We present (1) a practical architecture incorporating quantum error correction (QEC), (2) pipelining strategies to exploit parallelism in entanglement distribution and measurement, and (3) a performance evaluation in terms of logical error rate and clock speed. For a 256-bit elliptic-curve discrete logarithm problem (ECDLP) instance, which requires 2,871 logical qubits at code distance 13, SDQC achieves a logical error rate which is 1.20−0.45+0.94×10−81.20^{+0.94}_{-0.45}\times10^{-8}1.20−0.45+0.94​×10−8 of Photonic DQC error rate and 3.79−2.84+5.09×10−33.79^{+5.09}_{-2.84}\times10^{-3}3.79−2.84+5.09​×10−3 of Quantum Charge-Coupled Device (QCCD) error rate, while providing 2.82 times faster logical clock speed than QCCD.
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.
Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.