default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Bouland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Adam Bouland
, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. CCC 2024: 21:1-21:23- [c14]Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Quantum Pseudoentanglement. ITCS 2024: 2:1-2:21 - [i23]Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Patrick Hayden:
Efficient Unitary T-designs from Random Sums. CoRR abs/2402.09335 (2024) - [i22]Chi-Fang Chen, Adam Bouland, Fernando G. S. L. Brandão, Jordan Docter, Patrick Hayden, Michelle Xu:
Efficient unitary designs and pseudorandom unitaries from permutations. CoRR abs/2404.16751 (2024) - 2023
- [c13]Adam Bouland, Yosheb M. Getachew, Yujia Jin, Aaron Sidford, Kevin Tian:
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. ICML 2023: 2932-2952 - [i21]Adam Bouland, Yosheb Getachew, Yujia Jin, Aaron Sidford, Kevin Tian:
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. CoRR abs/2301.03763 (2023) - [i20]Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure. CoRR abs/2311.12017 (2023) - [i19]Adam Bouland, Daniel Jost Brod, Ishaun Datta, Bill Fefferman, Daniel Grier, Felipe Hernandez, Michal Oszmaniec:
Complexity-theoretic foundations of BosonSampling with a linear number of modes. CoRR abs/2312.00286 (2023) - [i18]Tudor Giurgica-Tiron, Adam Bouland:
Pseudorandomness from Subset States. CoRR abs/2312.09206 (2023) - 2022
- [i17]Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Zixin Zhou:
Quantum Pseudoentanglement. CoRR abs/2211.00747 (2022) - 2021
- [c12]Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu:
Noise and the Frontier of Quantum Supremacy. FOCS 2021: 1308-1317 - [i16]Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu:
Noise and the frontier of quantum supremacy. CoRR abs/2102.01738 (2021) - [i15]Adam Bouland, Tudor Giurgica-Tiron:
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm. CoRR abs/2112.02040 (2021) - 2020
- [j2]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49(4) (2020) - [c11]Adam Bouland, Bill Fefferman, Umesh V. Vazirani:
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). ITCS 2020: 63:1-63:2
2010 – 2019
- 2019
- [c10]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
"Quantum Supremacy" and the Complexity of Random Circuit Sampling. ITCS 2019: 15:1-15:2 - [i14]Adam Bouland, Bill Fefferman, Umesh V. Vazirani:
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality. CoRR abs/1910.14646 (2019) - 2018
- [c9]Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh:
Complexity Classification of Conjugated Clifford Circuits. CCC 2018: 21:1-21:25 - [c8]Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari:
Classical Lower Bounds from Quantum Upper Bounds. FOCS 2018: 339-349 - [c7]Adam Bouland, Maris Ozols:
Trading Inverses for an Irrep in the Solovay-Kitaev Theorem. TQC 2018: 6:1-6:15 - [i13]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
Quantum Supremacy and the Complexity of Random Circuit Sampling. CoRR abs/1803.04402 (2018) - [i12]Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari:
Classical lower bounds from quantum upper bounds. CoRR abs/1807.06256 (2018) - 2017
- [b1]Adam Bouland:
Space around bounded-error quantum polynomial time. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c6]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. FOCS 2017: 708-719 - [c5]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The computational complexity of ball permutations. STOC 2017: 317-327 - [i11]Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh:
Quantum Advantage from Conjugated Clifford Circuits. CoRR abs/1709.01805 (2017) - 2016
- [j1]Adam Bouland:
Establishing quantum advantage. XRDS 23(1): 40-44 (2016) - [c4]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity Classification of Two-Qubit Commuting Hamiltonians. CCC 2016: 28:1-28:33 - [c3]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The Space "Just Above" BQP. ITCS 2016: 271-280 - [c2]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - [i10]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity classification of two-qubit commuting hamiltonians. CoRR abs/1602.04145 (2016) - [i9]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR abs/1606.03585 (2016) - [i8]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. CoRR abs/1609.02888 (2016) - [i7]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The Computational Complexity of Ball Permutations. CoRR abs/1610.06646 (2016) - [i6]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. Electron. Colloquium Comput. Complex. TR16 (2016) - [i5]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity Classification of Two-Qubit Commuting Hamiltonians. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [i4]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The space "just above" BQP. CoRR abs/1412.6507 (2014) - [i3]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The space "just above" BQP. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i2]Adam Bouland, Scott Aaronson:
Any Beamsplitter Generates Universal Quantum Linear Optics. CoRR abs/1310.6718 (2013) - [i1]Adam Bouland, Scott Aaronson:
Any Beamsplitter Generates Universal Quantum Linear Optics. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c1]Adam Bouland, Anuj Dawar, Eryk Kopczynski:
On Tractable Parameterizations of Graph Isomorphism. IPEC 2012: 218-230
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 2024-10-07 22:23 CEST 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:
