TY  - EJOU
AU  - Yu, Wenbin 
AU  - Xu, Yinsong 
AU  - Liu, Wenjie 
AU  - Liu, Alex Xiangyang 
AU  - Zheng, Baoyu 

TI  - Quantum Algorithm for Appointment Scheduling
T2  - Journal of Quantum Computing

PY  - 2019
VL  - 1
IS  - 2
SN  - 2579-0145

AB  - Suppose a practical scene that when two or more parties want to schedule an appointment, they need to share their calendars with each other in order to make it possible. According to the present result the whole communication cost to solve this problem should be their calendars’ length by using a classical algorithm. In this work, we investigate the appointment schedule issue made by N users and try to accomplish it in quantum information case. Our study shows that the total communication cost will be quadratic times smaller than the conventional case if we apply a quantum algorithm in the appointment-scheduling problem.
KW  - Quantum algorithm
KW  -  appointment scheduling
KW  -  quantum speed-up

DO  - 10.32604/jqc.2019.07412