Information for

Quantum algorithms

John watrous in classroomThe field of quantum computing was kick-started in the 1980s when it was discovered that certain computational problems can be tackled more efficiently with quantum algorithms than with their classical counterparts.

The most prominent such breakthrough came when Massachusetts Institute of Technology (MIT) researcher Peter Shor (then at AT&T) unveiled an algorithm that could efficiently factor very large numbers — a feat believed to be impossible for classical computers.

Michele Mosca at computerSince then, an increasing number of difficult computing tasks, such as “needle-in-haystack” search problems, have been shown to be sped up with quantum algorithms. Andrew Childs, Richard Cleve, Michele Mosca, Ashwin Nayak and John Watrous are contributing to this field.

Michele Mosca, bottom left and John Watrous, top right