Open Access

ARTICLE

Quantum Algorithm for Appointment Scheduling

Wenbin Yu^{1, 2, 3, *}, Yinsong Xu^{1, 2, 3}, Wenjie Liu^{1, 2, 3}, Alex Xiangyang Liu⁴, Baoyu Zheng⁵

¹ 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: ywb1518@126.com.

Journal of Quantum Computing 2019, 1(2), 111-118. https://doi.org/10.32604/jqc.2019.07412

Abstract

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.

---

Keywords

---