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

Quantum Information Processing with Modular Networks

Clayton Crocker, I. V. Inlek, David Hucul, Ksenia Sosnova, Grahame Vittorini, Chris Monroe

Published Jun 11, 2015• 0 citations
OpenAlex

Related papers

modular quantum networks

Chenan Wei

•Aug 3, 2026•0 citations

Title: Modular Quantum Field Networks (MQFN)

Jincheng Zhang

Quantum field networks (QFNs) represent a promising avenue for quantum information processing, offering potential advantages over traditional qubit-based systems. However, the inherent complexity of managing and manipulating quantum fields presents a significant challenge. This paper introduces the concept of Modular Quantum Field Networks (MQFNs), a novel framework designed to address this challenge through the construction of interconnected, programmable quantum components. MQFNs leverage a system for assembling, combining, and re-configuring smaller, independent units, enabling rapid reconfiguration of quantum systems. We propose a methodology for creating and updating these units, focusing on the inherent modularity and programmability of the network. The design aims to create robust, scalable, and adaptable quantum systems, addressing key limitations of current QFN architectures. This work will explore the architectural implications of MQFNs and their potential to facilitate the development of complex quantum computations and distributed quantum sensing.

•Sep 1, 2026•0 citations

Quantum Information Processing

J. Dajka, J. Łuczka, P. Hänggi

Springer eBooks•Jan 1, 2009•0 citations

Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer

Ni-Ni Huang, Wei-Hao Huang, Che‐Ming Li

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.

arXiv:2002.08671•Scientific Reports•Feb 20, 2020•22 citations

Quantum Information Processing

Wiley eBooks•Feb 21, 2003•33 citations

Causal Boxes: Quantum Information-Processing Systems Closed under Composition

Christopher Portmann, Christian Matt, Ueli M. Maurer +2 more

Complex information-processing systems, for example, quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such systems requires a mathematical model of systems that is closed under composition, i.e., a network of these objects is again an object of the same type. We propose such a model and call the corresponding systems causal boxes. Causal boxes capture superpositions of causal structures, e.g., messages sent by a causal box A can be in a superposition of different orders or in a superposition of being sent to box B and box C. Furthermore, causal boxes can model systems whose behavior depends on time. By instantiating the abstract cryptography framework with causal boxes, we obtain the first composable security framework that can handle arbitrary quantum protocols and relativistic protocols.

arXiv:1512.02240•IEEE Transactions on Information Theory•Jan 1, 2017•64 citations
Quantum field networks (QFNs) represent a promising avenue for quantum information processing, offering potential advantages over traditional qubit-based systems. However, the inherent complexity of managing and manipulating quantum fields presents a significant challenge. This paper introduces the concept of Modular Quantum Field Networks (MQFNs), a novel framework designed to address this challenge through the construction of interconnected, programmable quantum components. MQFNs leverage a system for assembling, combining, and re-configuring smaller, independent units, enabling rapid reconfiguration of quantum systems. We propose a methodology for creating and updating these units, focusing on the inherent modularity and programmability of the network. The design aims to create robust, scalable, and adaptable quantum systems, addressing key limitations of current QFN architectures. This work will explore the architectural implications of MQFNs and their potential to facilitate the development of complex quantum computations and distributed quantum sensing.
Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.
Complex information-processing systems, for example, quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such systems requires a mathematical model of systems that is closed under composition, i.e., a network of these objects is again an object of the same type. We propose such a model and call the corresponding systems causal boxes. Causal boxes capture superpositions of causal structures, e.g., messages sent by a causal box A can be in a superposition of different orders or in a superposition of being sent to box B and box C. Furthermore, causal boxes can model systems whose behavior depends on time. By instantiating the abstract cryptography framework with causal boxes, we obtain the first composable security framework that can handle arbitrary quantum protocols and relativistic protocols.