This was part of Quantum Information for Mathematics, Economics, and Statistics

Running useful algorithms on near-term quantum hardware

Joel Wallman, University of Waterloo

Thursday, May 27, 2021

Abstract: Quantum computers have the potential to solve problems that are beyond the reach of conventional computers. However, near-term quantum computers are plagued by chaotic errors that render the output unreliable. In this talk, I will outline how quantum algorithms can be structured and executed with a predictable error profile, allowing users to determine what level of performance is required to run a specific algorithm with a specific error tolerance.