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

Journal of quantum computing

Anti-Noise Quantum Network Coding Protocol Based on Bell States and Butterfly Network Model

Zhexi Zhang, Zhiguo Qu

Published Jan 1, 2019• 5 citations
Publisher

Abstract

How to establish a secure and efficient quantum network coding algorithm is one of important research topics of quantum secure communications. Based on the butterfly network model and the characteristics of easy preparation o... | Find, read and cite all the research you need on Tech Science Press
DOI
10.32604/jqc.2019.07415

Related papers

Controlled Quantum Network Coding Without Loss of Information

Xiu-Bo Pan, Xiu‐Bo Chen, Gang Xu +4 more

Quantum network coding is used to solve the congestion problem in quantum communication, which will promote the transmission efficiency of quantum information and the total throughput of quantum network. We propose a novel co... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2021•4 citations

Quantum Communication Networks and Trust Management: A Survey

Shibin Zhang, Yan Chang, Lili Yan +5 more

This paper summarizes the state of art in quantum communication networks and trust management in recent years. As in the classical networks, trust management is the premise and foundation of quantum secure communication and c... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2019•17 citations

Anti-noise Quantum Network Coding Protocol Based on Bell States and Butterfly Network Model

Zhiguo Qu, Zhexi Zhang, Zhenwen Cheng

Lecture notes in computer science•Jan 1, 2019•1 citation

Analysis and Improvement of Steganography Protocol Based on Bell States in Noise Environment

Zhiguo Qu, Shengyao Wu, Le Sun +1 more

In the field of quantum communication, quantum steganography is an important branch of quantum information hiding. In a realistic quantum communication system, quantum noises are unavoidable and will seriously impact the safe... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2019•25 citations

Quantum Network Coding for General Graphs

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1 more

Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottleneck channel of capacity one. So, if we consider conventional flow (of liquid, for instance), then the total amount of flow must be at most one in total, say 1/2 for each path. However, if we consider information flow, then we can send two bits (one for each path) at the same time by exploiting two side links, which are of no use for the liquid-type flow, and encoding/decoding operations at each node. This is known as network coding and has been quite popular since its introduction by Ahlswede, Cai, Li and Yeung in 2000. In QIP 2006, Hayashi et al showed that quantum network coding is possible for Butterfly, namely we can send two qubits simultaneously with keeping their fidelity strictly greater than 1/2. In this paper, we show that the result can be extended to a large class of general graphs by using a completely different approach. The underlying technique is a new cloning method called entanglement-free cloning which does not produce any entanglement at all. This seems interesting on its own and to show its possibility is an even more important purpose of this paper. Combining this new cloning with approximation of general quantum states by a small number of fixed ones, we can design a quantum network coding protocol which ``simulates'' its classical counterpart for the same graph.

arXiv:quant-ph/0611039•Nov 3, 2006•17 citations

Quantum Remote State Preparation Based on Quantum Network Coding

Zhenzhen Li, Zichen Li, Yiru Sun +3 more

As an innovative theory and technology, quantum network coding has become the research hotspot in quantum network communications. In this paper, a quantum remote state preparation scheme based on quantum network coding is proposed. Comparing with the general quantum remote state preparation schemes, our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network, by designing the appropriate encoding and decoding steps for quantum network coding. What is worth mentioning, from the network model, this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network. Accordingly, it can be treated as an efficient quantum network preparation scheme due to the characteristics of network coding, and it also makes the proposed scheme more applicable to the large-scale quantum networks. In addition, the fact of an arbitrary unknown quantum state remotely prepared means that the senders do not need to know the desired quantum state. Thus, the security of the proposed scheme is higher. Moreover, this scheme can always achieve the success probability of 1 and 1-max flow of value k. Thus, the communication efficiency of the proposed scheme is higher. Therefore, the proposed scheme turns out to be practicable, secure and efficient, which helps to effectively enrich the theory of quantum remote state preparation.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2022•2 citations
Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottleneck channel of capacity one. So, if we consider conventional flow (of liquid, for instance), then the total amount of flow must be at most one in total, say 1/2 for each path. However, if we consider information flow, then we can send two bits (one for each path) at the same time by exploiting two side links, which are of no use for the liquid-type flow, and encoding/decoding operations at each node. This is known as network coding and has been quite popular since its introduction by Ahlswede, Cai, Li and Yeung in 2000. In QIP 2006, Hayashi et al showed that quantum network coding is possible for Butterfly, namely we can send two qubits simultaneously with keeping their fidelity strictly greater than 1/2. In this paper, we show that the result can be extended to a large class of general graphs by using a completely different approach. The underlying technique is a new cloning method called entanglement-free cloning which does not produce any entanglement at all. This seems interesting on its own and to show its possibility is an even more important purpose of this paper. Combining this new cloning with approximation of general quantum states by a small number of fixed ones, we can design a quantum network coding protocol which ``simulates'' its classical counterpart for the same graph.
As an innovative theory and technology, quantum network coding has become the research hotspot in quantum network communications. In this paper, a quantum remote state preparation scheme based on quantum network coding is proposed. Comparing with the general quantum remote state preparation schemes, our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network, by designing the appropriate encoding and decoding steps for quantum network coding. What is worth mentioning, from the network model, this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network. Accordingly, it can be treated as an efficient quantum network preparation scheme due to the characteristics of network coding, and it also makes the proposed scheme more applicable to the large-scale quantum networks. In addition, the fact of an arbitrary unknown quantum state remotely prepared means that the senders do not need to know the desired quantum state. Thus, the security of the proposed scheme is higher. Moreover, this scheme can always achieve the success probability of 1 and 1-max flow of value k. Thus, the communication efficiency of the proposed scheme is higher. Therefore, the proposed scheme turns out to be practicable, secure and efficient, which helps to effectively enrich the theory of quantum remote state preparation.