Sotabase

Career

· Distinguished Engineer and Technical Director for Quantum Education, IBM2022–2025
· Faculty member, School of Computer Science and Institute for Quantum Computing; Interim Executive Director of the Institute for Quantum Computing, University of Waterloo2006–
· Professor, University of Waterloo2006–
· Faculty member, Department of Computer Science, University of Calgary1999–
· Postdoctoral fellow, Université de Montréal1998–
· PhD in Computer Science, University of Wisconsin–Madison1992–

Publications (92)

Quantum fingerprinting.
Physical Review Letters · 2001
1,051
cited
One-dimensional quantum walks
Symposium on the Theory of Computing · 2001
615
cited
Consequences and limits of nonlocal strategies
Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. · 2004
474
cited
On the power of quantum finite state automata
Proceedings 38th Annual Symposium on Foundations of Computer Science · 1997
376
cited
Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering.
Physical Review Letters · 2015
351
cited
Quantum Computational Complexity
Encyclopedia of Complexity and Systems Science · 2008
346
cited
Quantum Arthur–Merlin games
Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. · 2004
293
cited
Fast parallel circuits for the quantum Fourier transform
Proceedings 41st Annual Symposium on Foundations of Computer Science · 2000
282
cited
Zero-knowledge against quantum attacks
Symposium on the Theory of Computing · 2005
271
cited
Toward a general theory of quantum games
Symposium on the Theory of Computing · 2006
241
cited
Semidefinite Programs for Completely Bounded Norms
Theory of Computing · 2009
218
cited
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Symposium on the Theory of Computing · 2000
203
cited
Quantum simulations of classical random walks and undirected graph connectivity
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) · 1998
188
cited
On one-dimensional quantum cellular automata
Proceedings of IEEE 36th Annual Foundations of Computer Science · 1995
179
cited
Succinct quantum proofs for properties of finite groups
Proceedings 41st Annual Symposium on Foundations of Computer Science · 2000
176
cited
QIP = PSPACE
Symposium on the Theory of Computing · 2009
150
cited
PSPACE has constant-round quantum interactive proof systems
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · 1999
131
cited
All entangled states are useful for channel discrimination.
Physical Review Letters · 2009
128
cited
Simpler semidefinite programs for completely bounded norms
Chicago journal of theoretical computer science · 2012
123
cited
One-dimensional quantum walks with absorbing boundaries
Journal of computer and system sciences (Print) · 2002
122
cited
Sotabase