Placeholder Profile Image

Peter Hoyer

Positions

Contact information

Web presence

Phone number

Office: +1 (403) 210-9468

Location

Office: ICT653

Background

Educational Background

B.S. Computer Science, Odense University, 1995

Doctor of Philosophy Computer Science, Odense University, 2000

M.S. Computer Science, Odense University, 1997

Biography

Peter Høyer is an associate professor in the Department of Computer Science at the University of Calgary. He obtained his PhD in computer science from the University of Southern Denmark under the supervision of Joan Boyar and Gilles Brassard. His PhD thesis is on quantum algorithms and amplitude amplification. He has held an Alberta Ingenuity Associateship award and a fellowship from the Pacific Institute of Mathematical Sciences. His research interests include quantum algorithms, algorithms, complexity theory, cryptography, and foundational computer science.

Research

Areas of Research

Quantum algorithms , Quantum computing, Data structures, Data structures, Quantum cryptography, Quantum complexity theory

Courses

Course number Course title Semester
CPSC 251 Theoretical Foundations of Computer Science I Winter
CPSC 413 Design and Analysis of Algorithms I Fall

Awards

  • Students' Union Teaching Excellence Award (Science), 2020
  • Students' Union Teaching Excellence Awards - Science Honorable Mention, Students’ Union at the University of Calgary. 2019
  • Students' Union Teaching Award Nomination, 2017, 2017
  • Students' Union Teaching Excellence Awards - Science Honorable Mention, 2015
  • Students' Union Teaching Award Nomination, 2014, 2014
  • Students' Union Teaching Award Nomination, 2012, 2012
  • Students' Union Teaching Award Nomination, 2008, 2008
  • Students' Union Teaching Award Nomination, 2007, 2007

Publications

  • Simplification of a quantum walk circuit. Xining Chen; Peter Hoyer; Shang Li; Arta Seify; Dante Bencivenga. University of Calgary Students' Union Undergraduate Research Symposium (URS 2017). (2017)
  • Controlled quantum amplification. Peter Hoyer; Cătălin Dohotaru. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs) series.. 18:1-18:13. (2017)
  • Provably secure key establishment against quantum adversaries. Sophie Laplante; Gilles Brassard; Marc Kaplan; Aleksandrs Belovs; Peter Hoyer; Louis Salvail. 7th International Conference on Quantum Cryptography (QCrypt 2017). 22 pages. (2017)
  • Contextuality in multipartite pseudo-telepathy graph games. Anshu Anurag; Peter Hoyer; Simon Perdrix; Mehdi Mhalla. 21st International Symposium on Fundamentals of Computation Theory (FCT 2017). LNCS vol. 10472, Springer-Verlag. 41-55. (2017)