Ashley Montanaro, University of Cambridge
Dr. Rainer Steinwandt, Florida Atlantic University
Subgroups of elliptic curves over binary fields are a popular mathematical platform to implement cryptographic primitives and protocols. Using Shor's algorithm to tackle the discrete logarithm problem in such groups leads to the question of efficiently implementing the underlying group arithmetic on a quantum computer.
Adam Paetznick, IQC
Vlad Gheorghiu, University of Calgary
Michal Bajcsy, Stanford University
George Noid, Indiana University
Sergey Bravyi, IBM Research
Ivette Fuentes - University of Nottingham, IQC
Amir Safevi-Naeini, California Institute of Technology
Maris Ozols, IBM TJ Watson Research Center
Richard Feynman is known for his quote "I think I can safely say that nobody understands quantum mechanics." In this talk I will establish a weaker result, namely "to fully understand something quantum, one has to at least know what the classical equivalent of it is."