Quantum Algorithm for Appointment Scheduling

Wenbin Yu, Yinsong Xu, Wenjie Liu, Alex Xiangyang Liu, Baoyu Zheng
2019 Journal of Quantum Computing  
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
more » ... communication cost will be quadratic times smaller than the conventional case if we apply a quantum algorithm in the appointment-scheduling problem. Keywords: Quantum algorithm, appointment scheduling, quantum speed-up. Introduction Communication complexity mainly deals with the following problems: Two independent parties want to calculate a common task based on their input, and make the communication between them as little as possible. This model was first proposed by Yao [Yao (1979) ]. Subsequent studies show that the communication complexity of some bilateral and tripartite computational problems will be reduced when quantum computing and communication are allowed, which is proved impossible by classical algorithms [Yao (1993); Brassard (2003) ]. In addition, in the field of quantum algorithm research, Shor [Shor (1997) ] proposed a quantum algorithm for decomposition of large number prime factors, which transformed the classical NP problem into P problem. Grover [Grover (1996 [Grover ( , 1998 [Grover ( , 2005 ] proposed that the quadratic polynomial acceleration of classical algorithms could be achieved by applying quantum mechanism to the search
doi:10.32604/jqc.2019.07412 fatcat:nwakv6lv7vhkhc76htwnnpsigy