Greg Kuperberg

Quantum computing, complexity theory, discrete mathematics

Kuperberg is interested in finding new quantum algorithms or complexity barriers for candidate problems for quantum and classical algorithms, as well as geometric properties of quantum error correcting codes and quantum entanglement problems. My work has had applications to post-quantum cryptography, which is the effort to find and designate new standards of public key encryption that are resistant to quantum attacks.