Quantum network coding for multi-unicast problem based on 2D and 3D cluster states

Li, Jing; Chen, Xiu-Bo; Sun, Xingming; Li, Zongpeng; Yang, Yixian

doi:10.1007/s11432-016-5539-3

Cited by 29 publications

(22 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike the field of classical networks, the modeling and simulation in the field of QSCN have not drawn many attentions [20][21][22][23][24][25]. In order to reduce the cost of communication resources, some efforts in quantum network coding [20][21][22] have been made. However, the analysis of network performance was neglected in these researches.…”

Section: Introductionmentioning

confidence: 99%

Modeling and simulation of practical quantum secure communication network

Wang

et al. 2019

Quantum Inf Process

View full text Add to dashboard Cite

As the Quantum Key Distribution (QKD) technology supporting the pointto-point application matures, the need to build the Quantum Secure Communication Network (QSCN) to guarantee the security of a large scale of nodes becomes urgent. Considering the project time and expense control, it is the first choice to build the QSCN based on an existing classical network. Suitable modeling and simulation are very important to construct a QSCN successfully and efficiently. In this paper, a practical QSCN model, which can reflect the network state well, is proposed. The model considers the volatile traffic demand of the classical network and the real key generation capability of the QKD devices, which can enhance the accuracy of simulation to a great extent. In addition, two unique QSCN performance indicators, ITS (information-theoretic secure) communication capability and ITS communication efficiency, are proposed in the model, which are necessary supplements for the evaluation of a QSCN except for those traditional performance indicators of classical networks. Finally, the accuracy of the proposed QSCN model and the necessity of the proposed performance indicators are verified by plentiful simulations results. characteristics of QSCN. Sec. 3 describes the practical QSCN model by proposes traffic generation module, key generation module and two performance indicators. Sec. 4 designs a simulation to analyze the network performance in detail based on the QSCN model. Sec. 5 concludes this study and outlines the future works. Definition of quantum secure communication networkIn many studies, both terms of QSCN and QKD network are used to indicate the communication network based on QKD device. For the sake of better argument, QKD network is defined as a set of infrastructures for generating ITS key based on the laws of quantum mechanics [30] in this paper. The QSCN is defined as a network that provides the secure communication service utilizing the keys generated by QKD network. In order to achieve the ITS secure communication, the one-time-pad (OTP) encryption algorithm is adopted in the performance analysis in this paper. If ITS is not pursued in an application, the popular encryption algorithms, such as AES, DES and etc., are also acceptable. The QSCN consists of two parts: QKD network and classical network [31], shown as Fig. 1. Fig. 1 Hierarchical diagram of QSCN

show abstract

Section: Introductionmentioning

confidence: 99%

Modeling and simulation of practical quantum secure communication network

Wang

et al. 2019

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…An entanglement resource is a key quantum resource used for various quantum communication tasks such as quantum key distribution [24], quantum correlation generation [25], teleportation [26], remote state preparation [27], and quantum-state sharing [28]. Therefore, it is believed that with the assistance of prior entanglement, new breakthroughs in QNC [29][30][31][32][33][34][35][36][37][38][39] can be achieved. In 2007, Hayashi [29] first introduced prior entanglement into QNC, where two maximal entangled states are pre-shared between two source nodes over the butterfly network.…”

Section: Introductionmentioning

confidence: 99%

“…Mahdian et al [34] acquired the perfect k-pair QNC using k maximal states shared among the k source nodes in a solid-state system base. Li et al [35] analyzed the solvability of several typical quantum multi-unicast networks using global entangled two-dimensional (2D) and three-dimensional (3D) cluster states. Wang et al [36] achieved nearly perfect quantum k-pair transmission by means of an extended photonic entanglement with multiple degrees of freedom, such that the classical unsolvable network becomes quantum solvable.…”

Section: Introductionmentioning

confidence: 99%

Efficient quantum state transmission via perfect quantum network coding

Chen

et al. 2018

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum k-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only O(k) of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum k-pair networks. Through relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network.

show abstract

“…It is well known that the network solvability is closely related to its topology structure, and for general k -pair network, its determinant is still a challenge. Related to these studies, entanglement 33 , 35 – 39 is introduced to explore this problem. Kobayashi et al .…”

Section: Introductionmentioning

confidence: 99%

“…MB-QNC which can systematize the coding operations is a desirable way to design efficient communication schemes. The solvability of some special networks in Measurement-based have been examined 39 . However, no solvability conditions are presented yet for general k -pair network.…”

Section: Introductionmentioning

confidence: 99%

The solvability of quantum k-pair network in a measurement-based way

Chen

et al. 2017

Sci Rep

Self Cite

View full text Add to dashboard Cite

Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum k-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing k EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network , we show that MB-QNC allows higher error thresholds. Specially, for X error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.

show abstract

Quantum network coding for multi-unicast problem based on 2D and 3D cluster states

Cited by 29 publications

References 19 publications

Modeling and simulation of practical quantum secure communication network

Modeling and simulation of practical quantum secure communication network

Efficient quantum state transmission via perfect quantum network coding

The solvability of quantum k-pair network in a measurement-based way

Contact Info

Product

Resources

About