HKUEMS :: Event Details

Time Complexity of Quantum Algorithm is Physical
posted by Department of Physics for HKU and Public
Event Type: Public Lecture/Forum/Seminar/Workshop/Conference/Symposium
Event Nature: Science & Technology

Event Details


Time Complexity of Quantum Algorithm is Physical

by Prof. Biao Wu
(International Center for Quantum Materials, Peking University)


There are two paradigms of quantum algorithm: one is quantum circuit algorithm (QCA) and the other is quantum adiabatic algorithm (QAA). We show that these two different types of quantum algorithms are exactly equivalent to each other in terms of time complexity. Our result shows that how fast you can solve a problem on quantum computer is essentially a physics problem. Our proof also implies a new way to generalize QAA. We show that this generalization of QAA can lead to faster quantum algorithm.

Reference: Hongye Yu, Yuliang Huang and Biao Wu, arXiv 1706.07646 (2017)

Coffee and tea will be served 20 minutes prior to the seminar.
Anyone interested is welcome to attend.

Date/Time25/01/2018 16:30-17:30
VenueRm 522, 5/F, Chong Yuet Ming Physics Building, HKU

Registration Instruction

Registration is not required.

Contact Information

Should you have any enquiries, please feel free to contact Ms Eva Wong by email at or by phone at 2859 2360 or by fax at 2559 9152.