I am a Leverhulme Early Career Fellow at the Centre for Quantum Information and Foundations at the University of Cambridge and my research is on quantum computing. I am partially supported by the Isaac Newton Trust and I also hold a post-doctoral research associateship with Trinity Hall, Cambridge. Before coming to Cambridge I was a post-doctoral researcher at the IBM T.J. Watson Research Center. Currently I am looking for a permanent position!

Research interests

My research interests lie very broadly in the field of quantum computing (e.g., quantum algorithms and complexity, quantum information theory, and quantum error correction). I have previously worked on topics such as quantum walks and quantum query complexity, quantum Shannon theory, zero-error quantum information, LOCC, and Hamiltonian complexity. I am currently interested in representation theory and its applications to quantum information. I typically approach problems from the perspective of a mathematician.

Research visits and internships

In 2016 I was a long-term visitor at the CTP in MIT. I have also been a long-term visitor at QuICS in University of Maryland and twice a summer intern with the quantum group at NEC Labs in Princeton.

Education

I have a PhD in mathematics from University of Waterloo where I was affiliated with the Institute for Quantum Computing and supervised by Andrew Childs and Debbie Leung. I did my undergraduate degree in computer science at University of Latvia.

Selected publications (full list)

• Quantum walks can find a marked element on any graph
  Algorithmica 74(2), pp. 851–907 (2016) [arXiv:1002.2419]
• Unbounded number of channel uses may be required to detect quantum capacity
  Nat. Commun. 6, article 6739 (2015) [arXiv:1408.5115]
• Everything you always wanted to know about LOCC (but were afraid to ask)
  Commun. Math. Phys. 328(1), pp. 303–326 (2014) [arXiv:1210.4583]
• Quantum rejection sampling
  ACM Transactions on Computation Theory 5(3), article 11 (2013) [arXiv:1103.2774]
• A framework for bounding nonlocality of state discrimination
  Commun. Math. Phys. 323(3), pp. 1121–1153 (2013) [arXiv:1206.5822]
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
  Commun. Math. Phys. 311(1), pp. 97–111 (2012) [arXiv:1009.1195]

Service

• Program committee member: QIP 2017 ◦ QCrypt 2016 ◦ AQIS 2015
• Refereed for conferences: AQIS 2016 ◦ TQC 2016 ◦ QCrypt 2016 ◦ ICALP 2016 ◦ QIP 2016 ◦ SOFSEM 2016 ◦ AQIS 2015 ◦ ICALP 2015 ◦ QIP 2015 ◦ TQC 2015 ◦ QCrypt 2014 ◦ QIP 2014
• Refereed for journals: Algorithmica ◦ Designs, Codes and Cryptography ◦ IEEE Transactions on Information Theory ◦ Journal of Mathematical Physics ◦ New Journal of Physics ◦ Physical Review A ◦ Quantum Information & Computation ◦ Quantum Information Processing ◦ The ACM Transactions on Computation Theory

Patent

• Quantum rejection sampling (US 8892857 B2)

Other

• My wife Amandine Lassalle is a researcher at Harvard
• Persiešu valodas vārdnīca
• Anima dziesmu krātuve
• Quaternions