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 Control Conference (CCC)

Quantum network coding based on remote state preparation of arbitrary two-qubit states

Jiang Min, Shuai Zhou, MengXiao Ding

Published Jul 1, 2017• 6 citations
Publisher

Abstract

As a specific example of network coding, the butterfly network often represents the networks with bottlenecks. In this paper, we propose a typical butterfly quantum network coding scheme based on remote state preparation of arbitrary two-qubit states with the assistance of GHZ channels. Firstly, in a butterfly network, each source node simultaneously performs two appropriate projective measurements under suitable measurement basis on their own qubits. Next, their measurement results would be distributed to mid-side nodes. In the following, midside nodes perform encoded operations and send their encoded information to destination nodes. Finally, two destination nodes obtain the target state according to all information they receive with the success probability 1.

DOI
10.23919/chicc.2017.8028913

Related papers

Quantum Network Coding For Remote State Preparation of Multi-qudit States

Xu Wang, Chen Chen, Min Jiang +1 more

the purpose of this paper is to promote a butterfly quantum network coding scheme for remote state preparation of multi-qudit states. Firstly, we perform channel preparation and amplitude modulation; secondly, each sender simultaneously performs projection measurement; thirdly, both senders send measurement results as precoding information and auxiliary information to the intermediate node and the neighboring receivers respectively; fourthly, the first intermediate node performs encoding operation and sends the encoded information to both receivers via next intermediate node. Finally, by decoding the coded information with auxiliary information, two receivers perform corresponding unitary operations to recover the target multi-qudit quantum states. Compared with other schemes, our scheme can enhance the throughput and transmission efficiency of communication network for remote state preparation of multi-qudit states.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2019•5 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

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 network coding based on butterfly network

Ying Guo

Based on the typical example of butterfly network,this paper promoted a quantum network coding scheme including the transmission of classical information and the unknown qubit.It improved effectively the overall performance of the network which could achieve the maximizing information transmission in quantum network.Remarkably,here it did not require classic channel,only had quantum channel.It mad use of qubit as register to transmit classical information.No matter what send was unknown qubit or classical bit,both could be encoded with register and decoded without classical assistant information.It's effective to improve security of this scheme.

Jisuanji yingyong yanjiu•Jan 1, 2011•0 citations

Joint remote preparation of an arbitrary two-qubit state via GHZ-type states

Kui Hou, Yi-Bao Li, Gou-Hong Liu +1 more

For M -sender independently share the classical knowledge of a quantum state, a scheme for joint remote preparation of an arbitrary two-qubit state by GHZ-type states as the quantum channel is presented. It is shown that the receiver can reconstruct the original state with certain probability under the condition that only and only if all the senders collaborate with each other. The single-qubit and two-qubit projective measurements are needed in our scheme. We also discuss some information-splitting methods which can make the receiver obtain the unknown state.

Journal of Physics A Mathematical and Theoretical•May 23, 2011•43 citations

Flexible Quantum Network Coding by Using Quantum Multiplexing

Yu‐Guang Yang, Bing‐Xin Liu, Guang‐Bao Xu +4 more

Abstract Quantum network coding (QNC) aims at alleviating quantum communication congestion in quantum networks. Although several QNC protocols have been presented, they cannot meet the practical requirements that part of source nodes intend to transmit their quantum states with same or different qubit numbers via the bottleneck network simultaneously. Here, the study presents a flexible QNC protocol by using quantum multiplexing. First, the entangled pairs are generated between adjacent nodes in a heralded way by using quantum multiplexing. Then the quantum memories of the source nodes and the ones of the corresponding target nodes are entangled when the intermediate nodes execute multiple rounds of entanglement swapping operations on their quantum memories. Finally, the quantum states are transmitted from the source nodes to their corresponding target nodes by means of quantum teleportation. Compared with the existing protocols, the protocol allows an arbitrary part of the source nodes to transmit their quantum states with same or different qubit numbers via the bottleneck network simultaneously, thereby exhibiting its flexibility.

Advanced Quantum Technologies•Jun 4, 2024•9 citations
As a specific example of network coding, the butterfly network often represents the networks with bottlenecks. In this paper, we propose a typical butterfly quantum network coding scheme based on remote state preparation of arbitrary two-qubit states with the assistance of GHZ channels. Firstly, in a butterfly network, each source node simultaneously performs two appropriate projective measurements under suitable measurement basis on their own qubits. Next, their measurement results would be distributed to mid-side nodes. In the following, midside nodes perform encoded operations and send their encoded information to destination nodes. Finally, two destination nodes obtain the target state according to all information they receive with the success probability 1.
the purpose of this paper is to promote a butterfly quantum network coding scheme for remote state preparation of multi-qudit states. Firstly, we perform channel preparation and amplitude modulation; secondly, each sender simultaneously performs projection measurement; thirdly, both senders send measurement results as precoding information and auxiliary information to the intermediate node and the neighboring receivers respectively; fourthly, the first intermediate node performs encoding operation and sends the encoded information to both receivers via next intermediate node. Finally, by decoding the coded information with auxiliary information, two receivers perform corresponding unitary operations to recover the target multi-qudit quantum states. Compared with other schemes, our scheme can enhance the throughput and transmission efficiency of communication network for remote state preparation of multi-qudit states.
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.
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.
Based on the typical example of butterfly network,this paper promoted a quantum network coding scheme including the transmission of classical information and the unknown qubit.It improved effectively the overall performance of the network which could achieve the maximizing information transmission in quantum network.Remarkably,here it did not require classic channel,only had quantum channel.It mad use of qubit as register to transmit classical information.No matter what send was unknown qubit or classical bit,both could be encoded with register and decoded without classical assistant information.It's effective to improve security of this scheme.
For M -sender independently share the classical knowledge of a quantum state, a scheme for joint remote preparation of an arbitrary two-qubit state by GHZ-type states as the quantum channel is presented. It is shown that the receiver can reconstruct the original state with certain probability under the condition that only and only if all the senders collaborate with each other. The single-qubit and two-qubit projective measurements are needed in our scheme. We also discuss some information-splitting methods which can make the receiver obtain the unknown state.
Abstract Quantum network coding (QNC) aims at alleviating quantum communication congestion in quantum networks. Although several QNC protocols have been presented, they cannot meet the practical requirements that part of source nodes intend to transmit their quantum states with same or different qubit numbers via the bottleneck network simultaneously. Here, the study presents a flexible QNC protocol by using quantum multiplexing. First, the entangled pairs are generated between adjacent nodes in a heralded way by using quantum multiplexing. Then the quantum memories of the source nodes and the ones of the corresponding target nodes are entangled when the intermediate nodes execute multiple rounds of entanglement swapping operations on their quantum memories. Finally, the quantum states are transmitted from the source nodes to their corresponding target nodes by means of quantum teleportation. Compared with the existing protocols, the protocol allows an arbitrary part of the source nodes to transmit their quantum states with same or different qubit numbers via the bottleneck network simultaneously, thereby exhibiting its flexibility.