Quantum Algorithm for Appointment Scheduling  

作　　者：Wenbin Yu Yinsong Xu Wenjie Liu Alex Xiangyang Liu Baoyu Zheng 

机构地区：[1]Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology,Nanjing University of Information Science&Technology,Nanjing,210044,China [2]Jiangsu Engineering Center of Network Monitoring,Nanjing University of Information Science&Technology,Nanjing,210044,China [3]School of Computer and Software,Nanjing University of Information Science&Technology,Nanjing,210044,China [4]Department of Computer Science and Engineering,Michigan State University,East Lansing,MI 48824-1266,USA [5]National Engineering Research Center for Communications and Network Technology,Nanjing University of Posts and Telecommunications,Nanjing,210003,China

出　　处：《Journal of Quantum Computing》2019年第2期111-118,共8页量子计算杂志（英文）

基　　金：Supported by the National Natural Science Foundation of Chinaunder Grant Nos. 61501247, 61373131 and 61702277;the Six Talent Peaks Project ofJiangsu Province (Grant No. 2015-XXRJ-013);Natural Science Foundation of JiangsuProvince (Grant No. BK20171458);he Natural Science Foundation of the HigherEducation Institutions of Jiangsu Province (China under Grant No. 16KJB520030);theNUIST Research Foundation for Talented Scholars under Grant No. 2015r014, PAPDand CICAEET funds.

摘　　要：Suppose a practical scene that when two or more parties want to schedule anappointment, they need to share their calendars with each other in order to make itpossible. According to the present result the whole communication cost to solve thisproblem should be their calendars’ length by using a classical algorithm. In this work, weinvestigate the appointment schedule issue made by N users and try to accomplish it inquantum information case. Our study shows that the total communication cost will bequadratic times smaller than the conventional case if we apply a quantum algorithm in theappointment-scheduling problem.

关 键 词：Quantum algorithm appointment scheduling quantum speed-up 

分 类 号：O41[理学—理论物理]