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

Chinese Physics B

Network-topology-adaptive quantum conference protocols

Sheng Zhang, Jian Wang, Chaojing Tang, Quan Zhang

Published Aug 1, 2011• 0 citations
Publisher

Abstract

As an important application of the quantum network communication, quantum multiparty conference has made multiparty secret communication possible. Previous quantum multiparty conference schemes based on quantum data encryption are insensitive to network topology. However, the topology of the quantum network significantly affects the communication efficiency, e.g., parallel transmission in a channel with limited bandwidth. We have proposed two distinctive protocols, which work in two basic network topologies with efficiency higher than the existing ones. We first present a protocol which works in the reticulate network using Greeberger—Horne—Zeilinger states and entanglement swapping. Another protocol, based on quantum multicasting with quantum data compression, which can improve the efficiency of the network, works in the star-like network. The security of our protocols is guaranteed by quantum key distribution and one-time-pad encryption. In general, the two protocols can be applied to any quantum network where the topology can be equivalently transformed to one of the two structures we propose in our protocols.

DOI
10.1088/1674-1056/20/8/080306

Related papers

Multiparty Quantum Remote Secret Conference

Xihan Li, Chunyan Li, Deng Fu-Guo +3 more

We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger–Horne–Zeilinger (GHZ) states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key, a sequence of GHZ states shared among all the conferees and used repeatedly after confirming their security. Both these schemes are optimal as their intrinsic efficiency for qubits approaches the maximal value.

arXiv:quant-ph/0612017•Chinese Physics Letters•Jan 1, 2007•30 citations

Bounds for multi-end communication over quantum networks

Stefano Pirandola

Abstract Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multiend scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication.

arXiv:1905.12677•Quantum Science and Technology•Sep 24, 2019•55 citations

Adaptive Quantum Topology Quantum Network Topology

Jincheng Zhang

This paper introduces a novel algorithm for quantum network topology optimization based on adaptive quantum topology. Traditional methods rely on manual design, limiting the flexibility of network configurations. Our approach dynamically incorporates quantum topology to optimize network pathways, leading to improved quantum network transmission efficiency and security. The core mechanism leverages the inherent properties of quantum topology to create robust and adaptable network structures. This work presents a new framework for designing quantum networks with enhanced performance characteristics. We detail the algorithm's implementation, demonstrating its effectiveness through simulations and preliminary experimental validation. The paper concludes with a discussion of the potential implications of this technology for future quantum communication networks.

•Aug 31, 2026•0 citations

Quantum Adaptive Topology Adaptive Quantum Cryptography

Jincheng Zhang

Quantum Adaptive Topology Adaptive Quantum Cryptography addresses the limitations of traditional quantum computation by introducing a novel approach centered around dynamic adjustment of quantum topology. This design proposes a method to enhance quantum key distribution and quantum secure communication through a strategically manipulated topology, offering significant potential improvements in efficiency and security compared to existing techniques. The core mechanism involves utilizing quantum topology to guide the evolution of quantum states, enabling faster computations and enhanced cryptographic capabilities. This paper explores the theoretical framework and preliminary implementation of this algorithm, highlighting its potential impact on the field of quantum cryptography.

•Sep 4, 2026•0 citations

Sharing Classical Secrets with Continuous-Variable Entanglement: Composable Security and Network Coding Advantage

Nathan Walk, Jens Eisert

Secret sharing is a multiparty cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bipartite quantum key distribution (QKD) and those that exploit multipartite entanglement.The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime, which has become the gold standard for QKD security.Given this-and the fact that distributing multipartite entanglement is typically challenging-one might well ask is there any virtue in pursuing multipartite entanglement-based schemes?Here, we answer this question in the affirmative for a class of secret-sharing protocols based on continuous-variable graph states.We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present-day experiments for which a multipartite scheme outperforms the corresponding QKD-based method in the asymptotic and finite-size setting.Finally, we establish experimental parameters where the multipartite schemes outperform any possible QKD-based protocol.This is one of the first concrete compelling examples of multipartite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.

arXiv:2104.10659•PRX Quantum•Nov 22, 2021•23 citations

Quantum Entanglement Adaptive Topology Networks

Jincheng Zhang

Quantum entanglement offers a revolutionary approach to quantum information processing, potentially surpassing the limitations of classical communication. This paper explores the design of a novel quantum entanglement network utilizing adaptive topology to optimize quantum state transmission and manipulation. We propose a dynamic architecture based on entangled pairs, where the network topology adjusts to maintain entanglement fidelity and robustness. The core mechanism centers around exploiting the inherent properties of quantum entanglement to automatically reconfigure the network's structure, enhancing data transfer efficiency and security. This work introduces a framework for creating robust quantum networks capable of dynamically adapting to complex environments, promising significant advancements in quantum information technologies.

•Sep 1, 2026•0 citations
As an important application of the quantum network communication, quantum multiparty conference has made multiparty secret communication possible. Previous quantum multiparty conference schemes based on quantum data encryption are insensitive to network topology. However, the topology of the quantum network significantly affects the communication efficiency, e.g., parallel transmission in a channel with limited bandwidth. We have proposed two distinctive protocols, which work in two basic network topologies with efficiency higher than the existing ones. We first present a protocol which works in the reticulate network using Greeberger—Horne—Zeilinger states and entanglement swapping. Another protocol, based on quantum multicasting with quantum data compression, which can improve the efficiency of the network, works in the star-like network. The security of our protocols is guaranteed by quantum key distribution and one-time-pad encryption. In general, the two protocols can be applied to any quantum network where the topology can be equivalently transformed to one of the two structures we propose in our protocols.
We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger–Horne–Zeilinger (GHZ) states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key, a sequence of GHZ states shared among all the conferees and used repeatedly after confirming their security. Both these schemes are optimal as their intrinsic efficiency for qubits approaches the maximal value.
Abstract Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multiend scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication.
This paper introduces a novel algorithm for quantum network topology optimization based on adaptive quantum topology. Traditional methods rely on manual design, limiting the flexibility of network configurations. Our approach dynamically incorporates quantum topology to optimize network pathways, leading to improved quantum network transmission efficiency and security. The core mechanism leverages the inherent properties of quantum topology to create robust and adaptable network structures. This work presents a new framework for designing quantum networks with enhanced performance characteristics. We detail the algorithm's implementation, demonstrating its effectiveness through simulations and preliminary experimental validation. The paper concludes with a discussion of the potential implications of this technology for future quantum communication networks.
Quantum Adaptive Topology Adaptive Quantum Cryptography addresses the limitations of traditional quantum computation by introducing a novel approach centered around dynamic adjustment of quantum topology. This design proposes a method to enhance quantum key distribution and quantum secure communication through a strategically manipulated topology, offering significant potential improvements in efficiency and security compared to existing techniques. The core mechanism involves utilizing quantum topology to guide the evolution of quantum states, enabling faster computations and enhanced cryptographic capabilities. This paper explores the theoretical framework and preliminary implementation of this algorithm, highlighting its potential impact on the field of quantum cryptography.
Secret sharing is a multiparty cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bipartite quantum key distribution (QKD) and those that exploit multipartite entanglement.The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime, which has become the gold standard for QKD security.Given this-and the fact that distributing multipartite entanglement is typically challenging-one might well ask is there any virtue in pursuing multipartite entanglement-based schemes?Here, we answer this question in the affirmative for a class of secret-sharing protocols based on continuous-variable graph states.We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present-day experiments for which a multipartite scheme outperforms the corresponding QKD-based method in the asymptotic and finite-size setting.Finally, we establish experimental parameters where the multipartite schemes outperform any possible QKD-based protocol.This is one of the first concrete compelling examples of multipartite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.
Quantum entanglement offers a revolutionary approach to quantum information processing, potentially surpassing the limitations of classical communication. This paper explores the design of a novel quantum entanglement network utilizing adaptive topology to optimize quantum state transmission and manipulation. We propose a dynamic architecture based on entangled pairs, where the network topology adjusts to maintain entanglement fidelity and robustness. The core mechanism centers around exploiting the inherent properties of quantum entanglement to automatically reconfigure the network's structure, enhancing data transfer efficiency and security. This work introduces a framework for creating robust quantum networks capable of dynamically adapting to complex environments, promising significant advancements in quantum information technologies.