Table of Content

Open Access iconOpen Access


Quantum Algorithm for Appointment Scheduling

Wenbin Yu1, 2, 3, *, Yinsong Xu1, 2, 3, Wenjie Liu1, 2, 3, Alex Xiangyang Liu4, Baoyu Zheng5

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 488241266, USA.
5 National Engineering Research Center for Communications and Network Technology, Nanjing University of Posts and Telecommunications, Nanjing, 210003, China.
* Corresponding Author: Wenbin Yu. Email:

Journal of Quantum Computing 2019, 1(2), 111-118.


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.


Cite This Article

APA Style
Yu, W., Xu, Y., Liu, W., Liu, A.X., , B.Z. (2019). Quantum algorithm for appointment scheduling. Journal of Quantum Computing, 1(2), 111-118.
Vancouver Style
Yu W, Xu Y, Liu W, Liu AX, BZ. Quantum algorithm for appointment scheduling. J Quantum Comput . 2019;1(2):111-118
IEEE Style
W. Yu, Y. Xu, W. Liu, A.X. Liu, and B.Z. "Quantum Algorithm for Appointment Scheduling," J. Quantum Comput. , vol. 1, no. 2, pp. 111-118. 2019.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2283


  • 1653


  • 0


Related articles

Share Link