Welcome to the Institute for Quantum Computing
The Institute for Quantum Computing (IQC) is a scientific research institute at the University of Waterloo. The research happening at IQC harnesses the quantum laws of nature in order to develop powerful new technologies and drive future economies.
What is quantum computing?
Start with our Quantum computing 101 page. It's a quick start guide on quantum computing to help you understand some of the basic principles of quantum mechanics.
Delivering on the quantum promise
The Transformative Quantum Technologies (TQT) program at the University of Waterloo aims to advance the use of quantum mechanics from laboratory curiosity to an impactful device.
News
- Dec. 20, 2019New research puts a spin on environmental defects
Magnetic fields are all around us—and even in us—all the time, and they often prove useful in technologies we rely on, like hard drives, MRI scanners and the power plants that provide us electricity.
Measuring small magnetic fields at an atomic scale would allow even more applications in areas of physics, materials science, data storage and biomedical science, including characterizing the magnetic properties of thin-film materials, performing magnetic resonance imaging of single proteins and measuring neural activity at the level of single dendrites.
- Dec. 12, 2019Building a better clock
The best clocks in the world can keep time so accurately that they only lose one second in millions or even billions of years. Yet, researchers are still fervently pursuing ever better clocks. Once a certain threshold of clock accuracy and stability is crossed, it will open up tremendous opportunities to understand the universe and to develop quantum technologies like accelerometers, gravimeters, and communication systems.
- Dec. 4, 2019A new carbon nanotube-based filter for quantum computing applications
Events
- Jan. 28, 2020New Insights About Quantum Approximate Counting
Special Colloquium Featuring Scott Aaronson University of Texas, Austin
Approximate counting -- given a black-box function f:[N]->{0,1}, multiplicatively estimate the number of x's such that f(x)=1 -- is one of the most basic problems in quantum algorithms.? In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a fully quadratic quantum speedup for the problem, while Nayak and Wu showed that this speedup was optimal.? What else is there to say?? In this talk:
