Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication
- URL: http://arxiv.org/abs/2003.13293v1
- Date: Mon, 30 Mar 2020 09:25:13 GMT
- Title: Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication
- Authors: Go Kato, Masaki Owari, Masahito Hayashi
- Abstract summary: We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
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.
- Score: 56.678354403278206
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. Our secure network code can be applied to
several networks including the butterfly network.
Related papers
- Guarantees on the structure of experimental quantum networks [109.08741987555818]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements.
Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
arXiv Detail & Related papers (2023-12-10T05:36:49Z) - Quantum walk-based protocol for secure communication between any two
directly connected nodes on a network [2.501693072047969]
This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network.
It paves the way for private inter-node quantum communication channels in the network.
We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible.
arXiv Detail & Related papers (2022-11-23T13:19:41Z) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - An Evolutionary Pathway for the Quantum Internet Relying on Secure
Classical Repeaters [64.48099252278821]
We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle.
In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes.
We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
arXiv Detail & Related papers (2022-02-08T03:24:06Z) - The Computational and Latency Advantage of Quantum Communication
Networks [70.01340727637825]
This article summarises the current status of classical communication networks.
It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Anonymous and secret communication in quantum networks [0.0]
We implement an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network.
We demonstrate the protocol with four parties and establish keys in subsets of the network.
We additionally show that the protocol is verifiable and run multiple key generation and verification routines.
arXiv Detail & Related papers (2021-03-15T21:07:25Z) - Aggregating Quantum Networks [0.0]
Single packets of information can now be split and transmitted in a coherent way over different routes.
This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network.
It is a quantum phenomenon not available in conventional telecommunication networks either.
arXiv Detail & Related papers (2020-08-10T01:53:10Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.