default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Bostanci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c8]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandom Unitaries in the Haar Random Oracle Model. CRYPTO (2) 2025: 301-333- [c7]John Bostanci
, Boyang Chen, Barak Nehoran:
Oracle Separation Between Quantum Commitments and Quantum One-Wayness. EUROCRYPT (7) 2025: 3-22 - [c6]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandomness in the (Inverseless) Haar Random Oracle Model. EUROCRYPT (7) 2025: 138-166 - [c5]John Bostanci, Barak Nehoran, Mark Zhandry:
A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. STOC 2025: 201-212 - [c4]Ainesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li, Allen Liu, Ryan O'Donnell, Ewin Tang:
Learning the Closest Product State. STOC 2025: 1212-1221 - [c3]John Bostanci, Jonas Haferkamp, Dominik Hangleiter, Alexander Poremba:
Efficient Quantum Pseudorandomness from Hamiltonian Phase States. TQC 2025: 9:1-9:18 - [i20]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandom Unitaries in the Haar Random Oracle Model. CoRR abs/2509.24432 (2025) - [i19]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries. CoRR abs/2510.04085 (2025) - [i18]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandom Unitaries in the Haar Random Oracle Model. IACR Cryptol. ePrint Arch. 2025: 1784 (2025) - [i17]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries. IACR Cryptol. ePrint Arch. 2025: 1889 (2025) - 2024
- [c2]Adam Bene Watts, John Bostanci:
Quantum Event Learning and Gentle Random Measurements. ITCS 2024: 97:1-97:22 - [c1]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An Efficient Quantum Parallel Repetition Theorem and Applications. STOC 2024: 1478-1487 - [i16]John Bostanci, Boyang Chen, Barak Nehoran:
Oracle Separation Between Quantum Commitments and Quantum One-wayness. CoRR abs/2410.03358 (2024) - [i15]John Bostanci, Jonas Haferkamp, Dominik Hangleiter, Alexander Poremba:
Efficient Quantum Pseudorandomness from Hamiltonian Phase States. CoRR abs/2410.08073 (2024) - [i14]John Bostanci, Yeongwoo Hwang:
Commuting Local Hamiltonians Beyond 2D. CoRR abs/2410.10495 (2024) - [i13]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandomness in the (Inverseless) Haar Random Oracle Model. CoRR abs/2410.19320 (2024) - [i12]John Bostanci, Barak Nehoran, Mark Zhandry:
A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. CoRR abs/2411.00529 (2024) - [i11]John Bostanci, Yeongwoo Hwang:
Commuting Local Hamiltonians Beyond 2D. Electron. Colloquium Comput. Complex. TR24 (2024) - [i10]John Bostanci, Boyang Chen, Barak Nehoran:
Oracle Separation Between Quantum Commitments and Quantum One-wayness. IACR Cryptol. ePrint Arch. 2024: 1568 (2024) - [i9]John Bostanci, Jonas Haferkamp, Dominik Hangleiter, Alexander Poremba:
Efficient Quantum Pseudorandomness from Hamiltonian Phase States. IACR Cryptol. ePrint Arch. 2024: 1639 (2024) - [i8]Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin:
Pseudorandomness in the (Inverseless) Haar Random Oracle Model. IACR Cryptol. ePrint Arch. 2024: 1745 (2024) - [i7]John Bostanci, Barak Nehoran, Mark Zhandry:
A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. IACR Cryptol. ePrint Arch. 2024: 1785 (2024) - 2023
- [i6]John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, Henry Yuen:
Unitary Complexity and the Uhlmann Transformation Problem. CoRR abs/2306.13073 (2023) - [i5]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. CoRR abs/2311.10681 (2023) - [i4]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i3]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. IACR Cryptol. ePrint Arch. 2023: 1783 (2023) - 2022
- [j1]John Bostanci, John Watrous:
Quantum game theory and the complexity of approximating quantum Nash equilibria. Quantum 6: 882 (2022) - [i2]Adam Bene Watts, John Bostanci:
Quantum Event Learning and Gentle Random Measurements. CoRR abs/2210.09155 (2022) - 2021
- [i1]John Bostanci, John Watrous:
Quantum game theory and the complexity of approximating quantum Nash equilibria. CoRR abs/2102.00512 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-11 02:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
