I am an Assistant Professor at Chalmers University of Technology in the Department of Computer Science and Engineering. Before that I was a Junior Research Fellow at the ETH Institute for Theoretical Studies and 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: Chalmers University of Technology, EDIT building, Office 5468. |
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).
In March 2023, I taught a PhD course at Chalmers University titled Quantum Computing: Algorithms and Complexity. This course introduced the basics of quantum computation, with a focus on algorithmic capabilities and complexity. The first half of the course covered how quantum computation works (at an abstract level) and how it can be used to design efficient algorithms. The second half covered mostly research-level topics, at the forefront of our understanding about quantum computing. The course website is here.
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
Computationally-secure and composable remote state preparation
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.
Nonlocality under computational assumptions
With Khashayar Barooti, Grzegorz Głuch and Marc-Olivier Renou. To appear in STOC 2024.
Quantum Depth in the Random Oracle Model
With Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Uttam Singh and Hendrik Waldner. TQC 2023, STOC 2023. DOI: 10.1145/3564246.3585153.
Quantum cryptography with classical communication
With Tony Metger and Alexander Poremba. TQC 2022, QCrypt 2022, ICALP 2023. DOI: 10.4230/LIPIcs.ICALP.2023.67.
Depth-efficient proofs of quantumness
With Zhenning Liu. QIP 2022, Quantum Journal. DOI: 10.22331/q-2022-09-19-807.
Estimating the entropy of shallow circuit outputs is hard
With Matty J. Hoban.
Computationally-secure and composable remote state preparation
With Thomas Vidick. QCrypt 2019, QIP 2020, FOCS 2019. DOI: 10.1109/FOCS.2019.00066.
Ontological models for quantum theory as functors
With Chris Heunen. Quantum Physics and Logic (QPL)
2019. DOI: 10.4204/EPTCS.318.12.
Verification of Quantum Computation: An overview of existing approaches
With Theodoros Kapourniotis and Elham Kashefi. Theory of Computing Systems. DOI: 10.1007/s00224-018-9872-3.
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
With Scott Aaronson, Alexandru Cojocaru, and Elham Kashefi. QCrypt 2017, ICALP 2019. DOI: 10.4230/LIPIcs.ICALP.2019.6.
Robustness and device independence of verifiable blind quantum computing
With Elham Kashefi and Petros Wallden. New Journal of Physics. DOI: 10.1088/1367-2630/17/8/083040. Winner of QCrypt 2015 Best Student Paper Award.