Starting October 1st 2022, I will be an Assistant Professor at Chalmers University of Technology in the Department of Computer Science and Engineering. Currently, I am a Junior Research Fellow at the Institute for Theoretical Studies at ETH Zürich. Prior to my current fellowship, I was a postdoc at the Institute for Quantum Information and Matter at Caltech, working under the supervision of Thomas Vidick. I obtained my PhD in Computer Science in 2018 from the University of Edinburgh, under the supervision of Elham Kashefi. Office: ETH In­sti­tute for The­or­et­ical Stud­ies, Clausi­usstrasse 47, CLV E1. Email: andru at agheorghiu dot com I am currently looking to hire a postdoc at Chalmers. Contact me for details.

Research Interests

My research is broadly in the area of quantum computation and quantum cryptography. Specifically, I work on quantum verification (designing protocols for efficiently verifying quantum computations), proofs of quantumness (designing protocols for efficiently certifying quantum advantage) and quantum complexity theory (understanding the potential and limitations of efficient quantum computation).

Teaching and Talks

In April 2020, I taught a special topics course on Quantum Algorithms and Programming at Caltech. The goal of the course was to teach the fundamentals of quantum computation through a combination of theory and programming in quantum programming languages. The material used in the course can be found here.

I was a teaching assistant within the School of Informatics in the University of Edinburgh for: Introduction to Quantum Computing, Introduction to Theoretical Computer Science, Algorithms and Data Structures, Computation and Logic, Object-Oriented Programming.

I have organized three workshops on the basics of quantum computation and cryptography at the Politehnica University of Bucharest. The latest edition of the workshop (from 2018) can be found here.

You can find some of my talks here:

• Interactive Protocols for Classically-Verifiable Quantum Advantage with an Ion-Trap Quantum Computer

• Estimating the entropy of shallow circuit outputs is hard

• Computationally-secure and composable remote state preparation

Selected Papers

The full list of my publications and preprints can be found on Google Scholar. Below is a list of selected papers that are representative of my work.

• Quantum cryptography with classical communication
  With Tony Metger and Alexander Poremba.

• Depth-efficient proofs of quantumness
  With Zhenning Liu.

• Estimating the entropy of shallow circuit outputs is hard
  With Matty J. Hoban.

• Computationally-secure and composable remote state preparation
  With Thomas Vidick. Published in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

• Ontological models for quantum theory as functors
  With Chris Heunen. Published in Proceedings Quantum Physics and Logic (QPL) 2019. EPTCS 318, 2020, pp. 196-212.

• Verification of Quantum Computation: An overview of existing approaches
  With Theodoros Kapourniotis and Elham Kashefi. Published in Theory of Computing Systems, Vol. 63, Issue 4, pp 715–808.

• Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
  With Scott Aaronson, Alexandru Cojocaru, and Elham Kashefi. Published in Proceedings International Colloquium on Automata, Languages, and Programming (ICALP) 2019.

• Robustness and device independence of verifiable blind quantum computing
  With Elham Kashefi and Petros Wallden. Published in New Journal of Physics, Vol. 17, No. 8, 2015. Winner of QCrypt 2015 Best Student Paper Award.