Publications
2026
- Local transformations of bipartite entanglement are rigid. John Bostanci, Tony Metger, and Henry Yuen.
[pdf, arXiv]
2025
Pseudorandom Unitaries in the Haar Random Oracle Model. Prabhanjan Ananth, John Bostanci, Aditya Gulati, and Yao-Ting Lin.
CRYPTO 2025.Learning the closest product state. Ainesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li, Allen Liu, Ryan O’Donnell, and Ewin Tang.
STOC 2025, QIP 2025 short plenary talk.
[pdf, arXiv, slides]A General Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. John Bostanci, Barak Nehoran, and Mark Zhandry.
STOC 2025, QIP 2025 contributed talk, QCrypt 2025 invited plenary talk.
[pdf, arXiv, eprint]Pseudorandomness in the (Inverseless) Haar Random Oracle Model. Prabhanjan Ananth, John Bostanci, Aditya Gulati, and Yao-Ting Lin.
Eurocrypt 2025.
[pdf, arXiv, eprint]Commuting Local Hamiltonians Beyond 2D. John Bostanci and Yeongwoo Hwang.
TQC 2025 contributed talk.
[pdf, arXiv, eccc]Efficient Quantum Pseudorandomness from Hamiltonian Phase States. John Bostanci, Jonas Haferkamp, Dominik Hangleiter, and Alexander Poremba.
TQC 2025.
[pdf, arXiv, eprint]Oracle Separation Between Quantum Commitments and Quantum One-wayness. John Bostanci, Boyang Chen, Barak Nehoran.
Eurocrypt 2025.
[pdf, arXiv, eprint]
2024
An efficient quantum parallel repetition theorem and applications. John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen.
STOC 2024, QIP 2024 short plenary talk.
[pdf, arXiv, eprint, eccc, slides]Unitary Complexity and the Uhlmann Transformation Problem. John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, Henry Yuen.
QIP 2024 long plenary talk.
[pdf, arXiv]Quantum Event Learning and Gentle Random Measurements. Adam Bene Watts and John Bostanci.
ITCS 2024.
[pdf, arXiv, slides, talk].
2022
- Quantum game theory and the complexity of approximating quantum Nash equilibria. John Bostanci and John Watrous.
Quantum 6, 2022.
[pdf, arXiv]
2021
- Finding the disjointness of stabilizer codes is NP-complete. John Bostanci and Aleksander Kubica.
Physical Review Research 3, 2021.
[pdf, arXiv]