• Quantum Pseudorandomness:
  Can even low-complexity quantum processes seem highly complex? What can the cryptographic notion of pseudorandomness teach us about how chaotic quantum systems evolve in time, and how they scramble information?
  
  
• Verifiable Quantum Advantage:
  Can quantum computers solve certain computational problems faster than classical computers? Can we design cryptographic tests of quantumness which can be implemented on near-term quantum computers?
  
  
• Post-Quantum Cryptography:
  Do quantum computers threaten cryptographic protocols we use on the internet today? How secure is the current international hash function standard in a quantum world? Can we design new cryptographic protocols from the hardness of lattice problems?

I was a long-term visitor at the Simons Institute for the Theory of Computing at the University of California, Berkeley, to attend the 2020 spring program The Quantum Wave in Computing. In the summer of 2018, I was awarded a Quantum Computing Summer Fellowship to work at Los Alamos National Laboratory, New Mexico. Before I came to Caltech, I was also a long-term visitor at the University of Copenhagen, where I was fortunate to work with Gorjan Alagic at the Centre for the Mathematics of Quantum Theory.

A detailed academic CV is available upon request.

• Fall 2025: CS 599 P1: Introduction to Quantum Computation
  

• Srishti Nautiyal (Graduate Student, Physics)
  

• Hamiltonian Decoded Quantum Interferometry (2025)
  Alexander Schmidhuber, Jonathan Z. Lu, Noah Shutty, Stephen Jordan, Alexander Poremba, Yihui Quek
  Featured talk at QIP 2026. Manuscript in submission.

• Average-Case Complexity of Quantum Stabilizer Decoding (2025)
  Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba, Akshar Ramkumar, Vinod Vaikuntanathan
  Featured talk at QIP 2026 as part of a joint submission. Manuscript in submission.

• Cloning Games, Black Holes and Cryptography (2024)
  Alexander Poremba, Seyoon Ragavan and Vinod Vaikuntanathan
  Proceedings of ITCS 2026. Featured talk at QIP 2026.

• The Learning Stabilizers with Noise Problem (2024)
  Alexander Poremba, Yihui Quek and Peter Shor
  Proceedings of ITCS 2026. Featured talk at QIP 2026 as part of a joint submission.

• (Quantum) Indifferentiability and Pre-Computation (2024)
  Joseph Carolan, Alexander Poremba and Mark Zhandry
  Featured talk at QIP 2025 as part of a joint submission.

• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security (2024)
  Prabhanjan Ananth, Saachi Mutreja and Alexander Poremba
  Proceedings of ITC 2025.

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States (2024)
  John Bostanci, Jonas Haferkamp, Dominik Hangleiter, Alexander Poremba
  Proceedings of TQC 2025.

• Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries (2024)
  Tony Metger, Alexander Poremba, Makrand Sinha and Henry Yuen
  Proceedings of FOCS 2024.

• Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations (2024)
  Joseph Carolan and Alexander Poremba
  Proceedings of CRYPTO 2024. Featured talk at QIP 2025 as part of a joint submission.

• Revocable Quantum Digital Signatures (2023)
  Tomoyuki Morimae, Alexander Poremba and Takashi Yamakawa
  Proceedings of TQC 2024.

• On the Two-sided Permutation Inversion Problem (2023)
  Gorjan Alagic, Chen Bai, Alexander Poremba and Kaiyan Shi
  Published in Communications in Cryptology, Vol. 1, No. 1, 2024.

• Unitary Complexity and the Uhlmann Transformation Problem (2023)
  John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian and Henry Yuen
  Proceedings of ITCS 2026. Plenary talk at QIP 2024.

• Weakening Assumptions for Publicly-Verifiable Deletion (2023)
  James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba and Michael Walter
  Proceedings of TCC 2023.

• Publicly-Verifiable Deletion via Target-Collapsing Functions (2023)
  James Bartusek, Dakshita Khurana and Alexander Poremba
  Proceedings of CRYPTO 2023.

• Revocable Cryptography from Learning with Errors (2023)
  Prabhanjan Ananth, Alexander Poremba and Vinod Vaikuntanathan
  Proceedings of TCC 2023.

• Improved Quantum Algorithms for Fidelity Estimation (2022)
  András Gilyén and Alexander Poremba
  Contributed talk at TQC 2022.

• Quantum Proofs of Deletion for Learning with Errors (2022)
  Alexander Poremba
  Proceedings of ITCS 2023.
  Short plenary talk at QIP 2022 and contributed talk at QCrypt 2022 and ASIACRYPT Quantum Cryptography Workshop, QCW 2022.

• Quantum Cryptography with Classical Communication:
  Parallel Remote State Preparation for Copy-Protection, Verification, and more (2022)
  Alexandru Gheorghiu, Tony Metger and Alexander Poremba
  Proceedings of ICALP 2023.
  Contributed talk at TQC 2022, QCrypt 2022 and ASIACRYPT Quantum Cryptography Workshop, QCW 2022.

• Quantum Copy-Protection of Compute-and-Compare Programs in the Quantum Random Oracle Model (2020)
  Andrea Coladangelo, Christian Majenz and Alexander Poremba
  Published in in Quantum 8, 1330 (2024).
  Contributed talk at QIP 2021, Munich, Germany.

• Variational Quantum Fidelity Estimation (2019)
  Marco Cerezo, Alexander Poremba, Lukasz Cincio and Patrick J. Coles
  Published in Quantum 4, 248 (2020).

• On Quantum Chosen-Ciphertext Attacks and Learning with Errors (2018)
  Gorjan Alagic, Stacey Jeffery, Maris Ozols and Alexander Poremba.
  Published in Cryptography 4 (1), 10 (2020): Special Issue on Quantum Cryptography and Cyber Security.
  Contributed talk at QCrypt 2018, Shanghai, China, and TQC 2019 at the University of Maryland, USA. [Talk]

• Quantum-Assisted Quantum Compiling (2018)
  Sumeet Khatri, Ryan LaRose, Alexander Poremba, Lukasz Cincio, Andrew T. Sornborger and Patrick J. Coles
  Published in Quantum 3, 140 (2019).