Quantum Algorithm for Appointment Scheduling

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.