量子无标度网络在随机攻击与蓄意故障下的纠缠渗流

量子电子学报

量子无标度网络在随机攻击与蓄意故障下的纠缠渗流

王语晗，马雷

华东师范大学物理与材料学院，上海 200241

出版日期:2017-09-28 发布日期:2019-06-13
通讯作者: 马雷（1965- ），山东人，副教授，主要研究方向为量子信息与量子通讯。 E-mail:lma@phy.ecnu.edu.cn
作者简介:王语晗(1990- )，吉林人，研究生，主要研究方向为量子信息与量子通讯。Email: 51140602117@ecnu.cn
基金资助:
Supported by National Natural Science Foundation of China(国家自然科学基金, 11174081）

Entanglement percolation of quantum scale-free network under random attack and targeted failure

WANG Yuhan，MA Lei

Institute of Physics and Materials, East China Normal University, Shanghai 200241, China

Published:2017-09-28 Online:2019-06-13

摘要/Abstract

摘要： 通过在节点间建立成对纠缠态，构造了一个量子无标度网络。通过局域化纠缠交换的方式对网络中的节点进行随机攻击以及等概率地使网络中的节点发生蓄意故障，对比其纠缠渗流阈值变化。结果表明随机攻击下的阈值明显变小，蓄意故障下的阈值明显增大，体现了量子无标度网络的鲁棒性与脆弱性；纠缠浓缩下的量子无标度网络在随机攻击与蓄意故障下仍具有鲁棒性与脆弱性，但较纠缠浓缩前的鲁棒性变弱，说明真实网络具有较好的鲁棒性。

关键词: 量子无标度网络, 纠缠渗流, 鲁棒性, 脆弱性, 纠缠浓缩

Abstract: A quantum scale-free network is built up by establishing pairwise entanglement state. The entanglement percolation threshold values change is compared by random attacking on nodes in network by the way of localization entanglement swapping, and making the nodes targeted failure with the same probability. Results show that the threshold values decrease significantly under random attack and increase significantly under targeted failure, which reflects robustness and fragility of the quantum scale-free network. The scale-free quantum network with entanglement distillation is still robust and fragile under random attack and targeted failure, but which is relatively weaker than that without distillation. It indicates that the real network has a better robustness.

Key words: quantum scale-free network, entanglement percolation, robustness , fragility, entanglement distillation

王语晗，马雷 . 量子无标度网络在随机攻击与蓄意故障下的纠缠渗流[J]. 量子电子学报.

WANG Yuhan，MA Lei. Entanglement percolation of quantum scale-free network under random attack and targeted failure[J]. Chinese Journal of Quantum Electronics.

参考文献

[1] Amiri I S, Vahedi G, Shojaei A, et al. Secured transportation of quantum codes using integrated PANDA-add/drop and TDMA systems[J]. International Journal of Engineering Research and Technology (IJERT), 2012, 1(5) : 1-46. [2]Devetak I, Winter A. Distillation of secret key and entanglement from quantum states[C]. Proceedings of the Royal Society of London Series A, 2005, 461:207-235 [3]Wang X F, Chen G. Synchronization in scale-free dynamical networks: robustness and fragility[J]. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 2002, 49(1): 54-62. [4]Bollobás B, Riordan O. Robustness and vulnerability of scale-free random graphs[J]. Internet Mathematics, 2004, 1(1):1-35. [5]Wang B, Tang H, Guo C, et al. Entropy optimization of scale-free networks’ robustness to random failures[J]. Physica A: Statistical Mechanics and its Applications, 2006, 363(2): 591-596. [6] Bachor H A. Entanglement distillation: Pick the best and ignore the rest[J]. Nature Physics, 2008, 4(4): 909-910. [7]Acín A, Cirac J I, Lewenstein M. Entanglement percolation in quantum networks[J]. Nature Physics, 2007, 3(4): 256-259. [8]Vidal G. Entanglement of pure states for a single copy[J]. Physical Review Letters, 1999, 83(5): 1046-1049. [9]Barabási A L, Albert R, Jeong H. Scale-free characteristics of random networks: The topology of the world-wide web[J]. Physica A: Statistical Mechanics and its Applications, 2000, 281(1): 69-77. [10]Barabási A L, Albert R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-512. [11]Zhou D, Gao J, Stanley H E, et al. Percolation of partially interdependent scale-free networks[J]. Physical Review E, 2013, 87(5): 052812. [12]Boguná M, Pastor-Satorras R, Vespignani A. Cut-offs and finite size effects in scale-free networks[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2004, 38(2): 205-209. [13]Liu C, Du W B, Wang W X. Particle swarm optimization with scale-free interactions[J]. PloS one, 2014, 9(5): 399-402. [14]Li P, Zhang K, Xu X, et al. Reexamination of explosive synchronization in scale-free networks: The effect of disassortativity[J]. Physical Review E, 2013, 87(4): 042803. [15]Yeh W C. A modified universal generating function algorithm for the acyclic binary-state network reliability[J]. IEEE Transactions on Reliability, 2012, 61(3): 702-709. [16]Sun Xinmei, Zha Xinwei, Li Ning. Scheme of quantum private comparison via Bell states and Bell entanglement swapping[J]. Chinese Journal of Quantum Electronics(量子电子学报), 2013, 30(5): 579-585. [17]Cuquet M, Calsamiglia J. Entanglement percolation in quantum complex networks[J]. Physical Review Letters, 2009, 103(24): 240503. [18] Bianconi G, Dorogovtsev S N, Mendes J F F. Mutually connected component of networks of networks with replica nodes[J]. Physical Review E, 2015, 91(1): 012804. [19]Serrano M á, Boguná M. Percolation and epidemic thresholds in clustered networks[J]. Physical Review Letters, 2006, 97(8): 088701. [20]Lin K Y, Atkinson M P, Chung T H, et al. A graph patrol problem with random attack times[J]. Operations Research, 2013, 61(3): 694-710. [21]Zhang Wanhang, Ma Lei. Influence of entanglement swapping on quantun random networks robustness[J]. Chinese Journal of Quantum Electronics(量子电子学报), 2015, 32(6): 700-705. [22]Verstraete F, Dehaene J, DeMoor B. Local filtering operations on two qubits[J]. Physical Review A, 2001, 64(1): 010101. [23]Broadfoot S, Dorner U, Jaksch D. Entanglement percolation with bipartite mixed states[J]. Europhysics Letters, 2009, 88(5): 50002. [24]Cuquet M, Calsamiglia J. Entanglement percolation in quantum complex networks[J]. Physical Review Letters, 2009, 103(24): 240503.