A Multicast Scheme Based on Fidelity Metrics in Quantum Networks

Wang, Xiaojun; An, Long-Xi; Meng, Fanxu; Yu, Xutao; Zhang, Zaichen

doi:10.1109/access.2019.2915931

Cited by 3 publications

(9 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Table 1, our scheme and Refs. [14,20,23] have the same perfect success probability to obtain the desired information, which is better than the determinacy in Ref. [28].…”

Section: Performance Comparison and Analysismentioning

confidence: 96%

“…Existing quantum multicast protocols [14,20,23,28] introduce quantum information technologies widely. Apart from our scheme, Xu's protocol [28] is the first quantum cooperative multicast scheme, while Shi's protocol [20] is about the lossless compression of special multicast quantum states.…”

Section: Performance Comparison and Analysismentioning

confidence: 99%

“…Apart from our scheme, Xu's protocol [28] is the first quantum cooperative multicast scheme, while Shi's protocol [20] is about the lossless compression of special multicast quantum states. Kobayashi's protocol [14] represents the quantum simulation of a classical linear network coding scheme in the N-to-N multicast model, and Wang's protocol [23] involves quantum approximate cloning technology.…”

Section: Performance Comparison and Analysismentioning

confidence: 99%

“…However, it should be under the condition that source nodes can generate enough copies of quantum states. Since the quantum no-cloning theorem [21] forbids the quantum information to be copied as the classical information, the quantum approximate cloning technique [13,22,23] has been proposed for preparing sufficient target states. In 2015, Wang et al [23] utilized an asymmetric quantum cloning mechanism to achieve point-to-multipoint multicast communication, but the fidelity loss remains a problem.…”

Section: Introductionmentioning

confidence: 99%

“…Since the quantum no-cloning theorem [21] forbids the quantum information to be copied as the classical information, the quantum approximate cloning technique [13,22,23] has been proposed for preparing sufficient target states. In 2015, Wang et al [23] utilized an asymmetric quantum cloning mechanism to achieve point-to-multipoint multicast communication, but the fidelity loss remains a problem. Under the quantum cloning mechanism, no matter what approach is taken to copy unknown quantum states, the output must differ from the initial state, resulting in lower fidelity.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Quantum Cooperative Multicast in a Quantum Hybrid Topology Network

Chen

Xu²,

Chen³

et al. 2022

Front. Phys.

View full text Add to dashboard Cite

Quantum multicast is a significant transmission mode in a multiparty communication scenario. Multisource collaboration can further enhance the efficient multicast. However, it remains a challenge to realize quantum multicast with a cooperative way in a complex topology network. In this article, we propose a scheme of quantum cooperative multicast in a hybrid topology network. It provides information aggregation and simultaneous multipoint transmission services. First, collaborative information aggregation allows central network data to be integrated into the aggregation node. By exploiting the quantum multicast mode, the aggregation node can simultaneously deliver integrated quantum states to multiple targets. Second, our scheme is feasible for dynamic network expansion. It is capable of extending the network architecture iteratively, while the peer network requests can be handled in parallel. Finally, the new scheme shows great application potential in the distributed quantum network. It is a promising candidate for the implementation of quantum data disaster backup in future.

show abstract

“…In Table 1, our scheme and Refs. [14,20,23] have the same perfect success probability to obtain the desired information, which is better than the determinacy in Ref. [28].…”

Section: Performance Comparison and Analysismentioning

confidence: 96%

Section: Performance Comparison and Analysismentioning

confidence: 99%

Section: Performance Comparison and Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Quantum Cooperative Multicast in a Quantum Hybrid Topology Network

Chen

Xu²,

Chen³

et al. 2022

Front. Phys.

View full text Add to dashboard Cite

show abstract

Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

et al. 2023

View full text Add to dashboard Cite

A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multiobjective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-toend entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest-path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.INDEX TERMS Quantum networks, quantum repeaters, path-finding algorithm, end-to-end fidelity, multiobjective routing.The associate editor coordinating the review of this manuscript and approving it for publication was Bijoy Chand Chatterjee .

show abstract