Wenbin Yu1, 2, 3, *, Yinsong Xu1, 2, 3, Wenjie Liu1, 2, 3, Alex Xiangyang Liu4, Baoyu Zheng5
Journal of Quantum Computing, Vol.1, No.2, pp. 111-118, 2019, DOI: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 More >
Login
Register
