计算机科学
Boosting(机器学习)
人工神经网络
量子密钥分配
树遍历
最优化问题
优化算法
量子计算机
机器学习
人工智能
算法
数据挖掘
作者
Qin Dong,Guoqi Huang,Wei Cui,Rongzhen Jiao
标识
DOI:10.1007/s11128-022-03579-6
摘要
Twin-field quantum key distribution (TF-QKD) can overcome the basic limits of QKD without repeaters. In practice, TF-QKD needs to optimize all parameters when limited data sets are considered. The traditional exhaustive traversal or local search algorithm can’t meet the time and resource requirements of the real-time communication system. Combined with machine learning, parameter optimization prediction of QKD has become the mainstream of parameter optimization. Random forest (RF) is a classical algorithm of the bagging class in integrated learning, and back-propagation neural network (BPNN) is an important algorithm in the neural network. This paper uses the extreme gradient boosting (XGBoost) of boosting class to predict the optimization parameters of TF-QKD and compares it with RF and BPNN. The results show that XGBoost can efficiently and accurately predict optimization parameters, and its performance is slightly better than RF and BPNN in parameter prediction, which can provide a reference for future real-time QKD networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI