Adam Bouland

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 36

Top Venues

CoRR

ITCS

FOCS

Electron. Colloquium Comput. Complex.

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

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 (2024)
Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou
Quantum Pseudoentanglement. ITCS (2024)
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)
Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Patrick Hayden
Efficient Unitary T-designs from Random Sums. CoRR (2024)
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 (2023)
Adam Bouland, Yosheb Getachew, Yujia Jin, Aaron Sidford, Kevin Tian
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. CoRR (2023)
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 (2023)
Adam Bouland, Yosheb M. Getachew, Yujia Jin, Aaron Sidford, Kevin Tian
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. ICML (2023)
Tudor Giurgica-Tiron, Adam Bouland
Pseudorandomness from Subset States. CoRR (2023)
Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu
Noise and the Frontier of Quantum Supremacy. FOCS (2022)
Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Zixin Zhou
Quantum Pseudoentanglement. CoRR (2022)
Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu
Noise and the frontier of quantum supremacy. CoRR (2021)
Adam Bouland, Tudor Giurgica-Tiron
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm. CoRR (2021)
Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu
Noise and the Frontier of Quantum Supremacy. FOCS (2021)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49 (4) (2020)
Adam Bouland, Bill Fefferman, Umesh V. Vazirani
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). ITCS (2020)
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani
"Quantum Supremacy" and the Complexity of Random Circuit Sampling. ITCS (2019)
Adam Bouland, Bill Fefferman, Umesh V. Vazirani
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality. CoRR (2019)
Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari
Classical Lower Bounds from Quantum Upper Bounds. FOCS (2018)
Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh
Complexity Classification of Conjugated Clifford Circuits. Computational Complexity Conference (2018)
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani
Quantum Supremacy and the Complexity of Random Circuit Sampling. CoRR (2018)
Adam Bouland, Maris Ozols
Trading Inverses for an Irrep in the Solovay-Kitaev Theorem. TQC (2018)
Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari
Classical lower bounds from quantum upper bounds. CoRR (2018)
Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh
Quantum Advantage from Conjugated Clifford Circuits. CoRR (2017)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On the Power of Statistical Zero Knowledge. FOCS (2017)
Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban
The computational complexity of ball permutations. STOC (2017)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS (2016)
Adam Bouland
Establishing quantum advantage. XRDS 23 (1) (2016)
Adam Bouland, Laura Mancinska, Xue Zhang
Complexity Classification of Two-Qubit Commuting Hamiltonians. Computational Complexity Conference (2016)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On SZK and PP. CoRR (2016)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On SZK and PP. Electron. Colloquium Comput. Complex. 23 (2016)
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR (2016)
Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee
The Space "Just Above" BQP. ITCS (2016)
Adam Bouland, Laura Mancinska, Xue Zhang
Complexity classification of two-qubit commuting hamiltonians. CoRR (2016)
Adam Bouland, Laura Mancinska, Xue Zhang
Complexity Classification of Two-Qubit Commuting Hamiltonians. Electron. Colloquium Comput. Complex. 23 (2016)
Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban
The Computational Complexity of Ball Permutations. CoRR (2016)
Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee
The space "just above" BQP. CoRR (2014)
Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee
The space "just above" BQP. Electron. Colloquium Comput. Complex. 21 (2014)
Adam Bouland, Scott Aaronson
Any Beamsplitter Generates Universal Quantum Linear Optics. Electron. Colloquium Comput. Complex. 20 (2013)
Adam Bouland, Scott Aaronson
Any Beamsplitter Generates Universal Quantum Linear Optics. CoRR (2013)
Adam Bouland, Anuj Dawar, Eryk Kopczynski
On Tractable Parameterizations of Graph Isomorphism. IPEC (2012)

Adam Bouland.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Adam Bouland