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

arXiv:1801.03306 · IEEE Transactions on Information Theory

Secure Quantum Network Code Without Classical Communication

Seunghoan Song, Masahito Hayashi

Published Aug 6, 2019• 27 citations
arXivHTMLPDF

Abstract

We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of the network transmission rate m0(i.e., m10/2), our code implements secret and correctable quantum communication of the rate m0- 2m1by using the network asymptotic number of times. Our code is universal in the sense that the code is constructed without the knowledge of the specific node operations and the network topology, but instead, every node operation is constrained to the application of an invertible matrix to the basis states. Moreover, our code requires no classical communication. Our code can be thought of as a generalization of the quantum secret sharing.

DOI
10.1109/tit.2019.2933422

Related papers

Secure Quantum Network Code without Classical Communication

Seunghoan Song, Masahito Hayashi

We consider the secure quantum communication over a network with the presence of the malicious adversary who can eavesdrop and contaminate the states. The network consists of the noiseless quantum channels with unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of network transmission rate m0(i.e., m10/2), our protocol implements secret and correctable quantum communication of rate m0- 2m1by using the network asymptotic number of times. Our protocol requires no classical communication and no knowledge of network structure, but instead, a node operation is limited to the application of an invertible matrix to the basis states. Our protocol can be thought of as a generalization of honest-dealer verifiable quantum secret sharing. A full version of this paper is accessible at: https://arxiv.org/pdf/1801.03306.pdf.

IEEE Information Theory Workshop (ITW)•Nov 1, 2018•4 citations

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network With Free One-Way Public Communication

Go Kato, Masaki Owari, Masahito Hayashi

It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. In the protocol, some nodes may share secret randomness as resources in advance. Our secure network code can be applied to several networks including the butterfly network.

arXiv:2003.13293•IEEE Transactions on Information Theory•May 10, 2021•15 citations

Approaches to Developing Key Distribution Protocols Based on Quantum Key Distribution

Yenlik Begimbayeva

Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements

Journal of Electrical Systems•May 4, 2024•0 citations

Limits on secure communication over quantum networks via extendibility

Vishal Singh

A quantum network promises unconditionally secure transmission of data between its nodes by utilizing its ability to distribute entanglement across distant nodes. However, for most practical purposes, the distribution of entanglement is affected by environmental noise. We study the limits of secure communication between two parties sharing an arbitrary bipartite state or an arbitrary quantum channel under the one-way local operations and classical communication (one-way LOCC) setting, particularly for the non-asymptotic case. We use the ideas of unextendibility of entanglement to quantify the resourcefulness of a bipartite state or a quantum channel for forward-assisted private communication between its bearers, which we use to establish limits on the number of secret bits that can be established between the two parties either exactly, or probabilistically, or approximately. Our results surpass several previously known limits on secure communication under the considered setting. Additionally, several bounds presented in our work are efficiently computable, including the bounds on the one-shot private capacity of a channel, which are the first efficiently computable bounds on these quantities to the best of our knowledge.

•Jan 1, 2025•0 citations

Quantum Network Code for Multiple-Unicast Network with Quantum Invertible Linear Operations

Seunghoan Song, Masahito Hayashi

This paper considers the communication over a quantum multiple-unicast network where r sender-receiver pairs communicate independent quantum states. We concretely construct a quantum network code for the quantum multiple-unicast network as a generalization of the code [Song and Hayashi, arxiv:1801.03306, 2018] for the quantum unicast network. When the given node operations are restricted to invertible linear operations between bit basis states and the rates of transmissions and interferences are restricted, our code certainly transmits a quantum state for each sender-receiver pair by n-use of the network asymptotically, which guarantees no information leakage to the other users. Our code is implemented only by the coding operation in the senders and receivers and employs no classical communication and no manipulation of the node operations. Several networks that our code can be applied are also given.

arXiv:1805.10428•Leibniz international proceedings in informatics•Jan 1, 2018•6 citations

Perfect quantum network communication protocol based on classical network coding

Hirotada Kobayashi, François Le Gall, Harumichi Nishimura +1 more

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.

arXiv:0902.1299•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•79 citations
We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of the network transmission rate m0(i.e., m10/2), our code implements secret and correctable quantum communication of the rate m0- 2m1by using the network asymptotic number of times. Our code is universal in the sense that the code is constructed without the knowledge of the specific node operations and the network topology, but instead, every node operation is constrained to the application of an invertible matrix to the basis states. Moreover, our code requires no classical communication. Our code can be thought of as a generalization of the quantum secret sharing.
We consider the secure quantum communication over a network with the presence of the malicious adversary who can eavesdrop and contaminate the states. The network consists of the noiseless quantum channels with unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of network transmission rate m0(i.e., m10/2), our protocol implements secret and correctable quantum communication of rate m0- 2m1by using the network asymptotic number of times. Our protocol requires no classical communication and no knowledge of network structure, but instead, a node operation is limited to the application of an invertible matrix to the basis states. Our protocol can be thought of as a generalization of honest-dealer verifiable quantum secret sharing. A full version of this paper is accessible at: https://arxiv.org/pdf/1801.03306.pdf.
It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. In the protocol, some nodes may share secret randomness as resources in advance. Our secure network code can be applied to several networks including the butterfly network.
Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements
A quantum network promises unconditionally secure transmission of data between its nodes by utilizing its ability to distribute entanglement across distant nodes. However, for most practical purposes, the distribution of entanglement is affected by environmental noise. We study the limits of secure communication between two parties sharing an arbitrary bipartite state or an arbitrary quantum channel under the one-way local operations and classical communication (one-way LOCC) setting, particularly for the non-asymptotic case. We use the ideas of unextendibility of entanglement to quantify the resourcefulness of a bipartite state or a quantum channel for forward-assisted private communication between its bearers, which we use to establish limits on the number of secret bits that can be established between the two parties either exactly, or probabilistically, or approximately. Our results surpass several previously known limits on secure communication under the considered setting. Additionally, several bounds presented in our work are efficiently computable, including the bounds on the one-shot private capacity of a channel, which are the first efficiently computable bounds on these quantities to the best of our knowledge.
This paper considers the communication over a quantum multiple-unicast network where r sender-receiver pairs communicate independent quantum states. We concretely construct a quantum network code for the quantum multiple-unicast network as a generalization of the code [Song and Hayashi, arxiv:1801.03306, 2018] for the quantum unicast network. When the given node operations are restricted to invertible linear operations between bit basis states and the rates of transmissions and interferences are restricted, our code certainly transmits a quantum state for each sender-receiver pair by n-use of the network asymptotically, which guarantees no information leakage to the other users. Our code is implemented only by the coding operation in the senders and receivers and employs no classical communication and no manipulation of the node operations. Several networks that our code can be applied are also given.
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that classical communication is free. The task is to perfectly transfer an unknown quantum state from a source subsystem to a target subsystem, where both source and target are formed by ordered sets of some of the nodes. It is proved that a lower bound of the rate at which this quantum communication task is possible is given by the classical min-cut max-flow theorem of network coding, where the capacities in question are the quantum capacities of the edges of the network.