News
Bowen Yang receives IQC Achievement Award for quantum materials research
IQC Achievement Award winner Bowen Yang sat down with us to discuss his PhD research in quantum materials, the opportunities he’s received while at IQC, and his recommendations for students interested in learning and gaining more experience with quantum.
Xi Dai, IQC Achievement Award winner discusses superconducting circuits research
IQC Achievement Award winner Xi Dai sat down with us to discuss his PhD research with superconducting circuits, the challenges he overcame, and his plans for the future following graduation.
IQC Achievement Award recipient Shayan Majidy shares research insights
IQC Achievement Award winner Shayan Majidy sat down with us to discuss his current and future research on noncommuting conserved quantities, the award, and his advice for current and aspiring students interested in quantum information.
Events
Quantum Today: Noise Limits in Atomic Qubit Control
Join us for Quantum Today, where we sit down with researchers from the University of Waterloo’s Institute for Quantum Computing (IQC) to talk about their work, its impact and where their research may lead.
Quantum Innovators in Science and Engineering
The Quantum Innovators in science and engineering workshop brings together the most promising young researchers in quantum physics and engineering. Guests are invited for a three-day conference aimed at exploring the frontier of our field.
Monday, October 3 QNC 0101
Tuesday, October 4 RAC1 2009
Wednesday, October 5 QNC 0101
Multidimensional Quantum Walks, with Application to k-Distinctness
Stacey Jefferey - QuSoft
While the quantum query complexity of k-distinctness is known to be O(n^{3/4−1/4(2k−1)}) for any constant k≥4, the best previous upper bound on the time complexity was ~O(n^{1−1/k}). We give a new upper bound of ~O(n^{3/4−1/4(2k−1)}) on the time complexity, matching the query complexity up to polylogarithmic factors. In order to achieve this upper bound, we give a new technique for designing quantum walk search algorithms, which is an extension of the electric network framework. We also show how to solve the welded trees problem in O(n) queries and O(n^2) time using this new technique, showing that the new quantum walk framework can achieve exponential speedups.
