一种加速量子网络信息分布的研究方法
|
摘要
Gossip算法是描述自然网络中不可靠信息传播协议的常用术语,但并不是网络实体间通信的最佳设计。经典的Gossip算法主要针对数据比较稳定的场景,如果数据变化比较频繁,会对网络带宽、CPU资源造成很大的负载。该算法无法保证在某个时刻所有节点状态一致,比较适合小数据量的同步。由此考虑把Gossip算法应用在量子网络中,不考虑量子网络的初始配置,通过结构更新来加速量子网络信息分布,更新允许通过量子隐形传态来异化信息,这种处理方式是兼容量子网络游走的,可证明任何量子网络都可以更新到与本地操作和经典通信的最佳配置。Gossip算法具有多方面的应用,该研究方法可以作为量子网络计算中的一种参考模型。
Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks,which are not optimally designed for efficient communication between network entities. The classic Gossip algorithm mainly aims at the relatively stable scene of data. If the data changes more frequently,the network bandwidth and CPU resources will be heavily loaded. The algorithm can not guarantee the consistency of all nodes at a given moment,and is suitable for synchronization of small amount of data. So consider apply gossip algorithms to quantum networks and irrespective of the initial configuration of the quantum network,Structure updating is used to accelerate the information distribution of quantum networks. The update allows to dissimilate information by means of quantum teleportation.This approach is compatible with quantum network walk and it can be shown that any quantum network can be updated to optimal configuration with local operations and classical communication. Gossip algorithm has many applications,and the research method provided can be used as a reference model in quantum network calculation.
Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks,which are not optimally designed for efficient communication between network entities. The classic Gossip algorithm mainly aims at the relatively stable scene of data. If the data changes more frequently,the network bandwidth and CPU resources will be heavily loaded. The algorithm can not guarantee the consistency of all nodes at a given moment,and is suitable for synchronization of small amount of data. So consider apply gossip algorithms to quantum networks and irrespective of the initial configuration of the quantum network,Structure updating is used to accelerate the information distribution of quantum networks. The update allows to dissimilate information by means of quantum teleportation.This approach is compatible with quantum network walk and it can be shown that any quantum network can be updated to optimal configuration with local operations and classical communication. Gossip algorithm has many applications,and the research method provided can be used as a reference model in quantum network calculation.
引文
[1]Pw. Gossip[J]. Whole Earth,2016,34(Summer):43-46.
[2]Karp R, Schindelhauer C, Shenker S, etal.Randomize rumor spreading[C]London.Bob.2017:488-543.
[3]Leavitt H J. Some efforts of certain communication patterns on group performance[D].Massachusetts:Institute of Techonology,2014.
[4]韩正甫,张涛,郭光灿.量子网络寻址方法及量子网络路由器:CN,CN1567751[P]. 2015.
[5]Caruso F,Huelga S F,Plenio M B. Noise-enhanced classical and quantum capacities in communication networks.[J]. Physical Review Letters,2014,105(19):190-201.
[6]Jung K,Shah D. Fast Gossip via Non-reversible Random Walk[C].Los Angeles.Marey.2016.
[7]吴取劲,阳小华,鹿江春,等.一种基于图深度优先搜索的基本路径集自动生成优化算法[J].南华大学学报(自然科学版),2015(3):87-90.
[8]Mahler R N G,Weberru R N V A. Quantum networks[J]. Springer Berlin,1995,8(1-4):191-196.
[9]Chiribella G,D'Ariano G M,Perinotti P. Theoretical framework for quantum networks[J]. Physical Review A,2016,80(2):2554-2558
[10]Sanghavi S,Hajek B,Massoulie L. Gossiping with Multiple Messages[C]//IEEE INFOCOM 2007,IEEE International Conference on Computer Communications. IEEE,2016:2135-2143.
[11]Bahrani S,Razavi M,Salehi J A. Wavelength Assignment in Hybrid Quantum-Classical Networks[J]. 2017,23(12):212-217.
[12]王朋朋.多方量子通信协议研究[D].吉首:吉首大学,2012.
[13]Xu J. Information Dissemination in Wireless Networks[J]. Ifp. illinois. edu,2002,127(8):679-687.
[14]Bennett S E,Brassard G,Crepeau C,et al. Phys[J].Rev.Lett.70 1895(2013):211-218.
[15]Shah D. Found[J].&Trends in Networking,2016,3(1):671-680.
[16]VATSALA A,Nielsen,GJ M. Phil[J]. Trans.R.Soc.Lond.A361,2017(1655):89-112.
[2]Karp R, Schindelhauer C, Shenker S, etal.Randomize rumor spreading[C]London.Bob.2017:488-543.
[3]Leavitt H J. Some efforts of certain communication patterns on group performance[D].Massachusetts:Institute of Techonology,2014.
[4]韩正甫,张涛,郭光灿.量子网络寻址方法及量子网络路由器:CN,CN1567751[P]. 2015.
[5]Caruso F,Huelga S F,Plenio M B. Noise-enhanced classical and quantum capacities in communication networks.[J]. Physical Review Letters,2014,105(19):190-201.
[6]Jung K,Shah D. Fast Gossip via Non-reversible Random Walk[C].Los Angeles.Marey.2016.
[7]吴取劲,阳小华,鹿江春,等.一种基于图深度优先搜索的基本路径集自动生成优化算法[J].南华大学学报(自然科学版),2015(3):87-90.
[8]Mahler R N G,Weberru R N V A. Quantum networks[J]. Springer Berlin,1995,8(1-4):191-196.
[9]Chiribella G,D'Ariano G M,Perinotti P. Theoretical framework for quantum networks[J]. Physical Review A,2016,80(2):2554-2558
[10]Sanghavi S,Hajek B,Massoulie L. Gossiping with Multiple Messages[C]//IEEE INFOCOM 2007,IEEE International Conference on Computer Communications. IEEE,2016:2135-2143.
[11]Bahrani S,Razavi M,Salehi J A. Wavelength Assignment in Hybrid Quantum-Classical Networks[J]. 2017,23(12):212-217.
[12]王朋朋.多方量子通信协议研究[D].吉首:吉首大学,2012.
[13]Xu J. Information Dissemination in Wireless Networks[J]. Ifp. illinois. edu,2002,127(8):679-687.
[14]Bennett S E,Brassard G,Crepeau C,et al. Phys[J].Rev.Lett.70 1895(2013):211-218.
[15]Shah D. Found[J].&Trends in Networking,2016,3(1):671-680.
[16]VATSALA A,Nielsen,GJ M. Phil[J]. Trans.R.Soc.Lond.A361,2017(1655):89-112.