On Tractable Parameterizations of Graph Isomorphism. - Adam Bouland; Anuj Dawar; Eryk Kopczynski (IPEC, 2012)

Any Beamsplitter Generates Universal Quantum Linear Optics. - Adam Bouland; Scott Aaronson (Electron. Colloquium Comput. Complex., 2013)

The space "just above" BQP. - Scott Aaronson; Adam Bouland; Joseph F. Fitzsimons; Mitchell Lee (Electron. Colloquium Comput. Complex., 2014)

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. - Itai Arad; Adam Bouland; Daniel Grier; Miklos Santha; Aarthi Sundaram; Shengyu Zhang 002 (MFCS, 2016)

Establishing quantum advantage. - Adam Bouland (XRDS, 2016)

On SZK and PP. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2016)

Complexity Classification of Two-Qubit Commuting Hamiltonians. - Adam Bouland; Laura Mancinska; Xue Zhang (Electron. Colloquium Comput. Complex., 2016)

The computational complexity of ball permutations. - Scott Aaronson; Adam Bouland; Greg Kuperberg; Saeed Mehraban (STOC, 2017)

Quantum Advantage from Conjugated Clifford Circuits. - Adam Bouland; Joseph F. Fitzsimons; Dax Enshan Koh (CoRR, 2017)

Space around bounded-error quantum polynomial time. - Adam Bouland (2017)

Complexity Classification of Conjugated Clifford Circuits. - Adam Bouland; Joseph F. Fitzsimons; Dax Enshan Koh (CCC, 2018)

Classical Lower Bounds from Quantum Upper Bounds. - Shalev Ben-David; Adam Bouland; Ankit Garg; Robin Kothari (FOCS, 2018)

Trading Inverses for an Irrep in the Solovay-Kitaev Theorem. - Adam Bouland; Maris Ozols (TQC, 2018)

"Quantum Supremacy" and the Complexity of Random Circuit Sampling. - Adam Bouland; Bill Fefferman; Chinmay Nirkhe; Umesh V. Vazirani (ITCS, 2019)

Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality. - Adam Bouland; Bill Fefferman; Umesh V. Vazirani (CoRR, 2019)

Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). - Adam Bouland; Bill Fefferman; Umesh V. Vazirani (ITCS, 2020)

On the Power of Statistical Zero Knowledge. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (SIAM J. Comput., 2020)

Noise and the Frontier of Quantum Supremacy. - Adam Bouland; Bill Fefferman; Zeph Landau; Yunchao Liu 002 (FOCS, 2021)

Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm. - Adam Bouland; Tudor Giurgica-Tiron (CoRR, 2021)

Quantum Pseudoentanglement. - Adam Bouland; Bill Fefferman; Soumik Ghosh; Umesh V. Vazirani; Zixin Zhou (CoRR, 2022)

Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. - Adam Bouland; Yosheb M. Getachew; Yujia Jin; Aaron Sidford; Kevin Tian (ICML, 2023)

Complexity-theoretic foundations of BosonSampling with a linear number of modes. - Adam Bouland; Daniel Jost Brod; Ishaun Datta; Bill Fefferman; Daniel Grier; Felipe Hernandez; Michal Oszmaniec (CoRR, 2023)

Pseudorandomness from Subset States. - Tudor Giurgica-Tiron; Adam Bouland (CoRR, 2023)

Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. - Adam Bouland; Bill Fefferman; Soumik Ghosh; Tony Metger; Umesh V. Vazirani; Chenyi Zhang 003; Zixin Zhou (CCC, 2024)

Efficient Unitary Designs from Random Sums and Permutations. - Chi-Fang Chen; Jordan Docter; Michelle Xu; Adam Bouland; Fernando G. S. L. Brandão; Patrick Hayden (FOCS, 2024)

Quantum Pseudoentanglement. - Scott Aaronson; Adam Bouland; Bill Fefferman; Soumik Ghosh; Umesh V. Vazirani; Chenyi Zhang 003; Zixin Zhou (ITCS, 2024)

Efficient Unitary T-designs from Random Sums. - Chi-Fang Chen; Jordan Docter; Michelle Xu; Adam Bouland; Patrick Hayden (CoRR, 2024)

Efficient unitary designs and pseudorandom unitaries from permutations. - Chi-Fang Chen; Adam Bouland; Fernando G. S. L. Brandão; Jordan Docter; Patrick Hayden; Michelle Xu (CoRR, 2024)

On the hardness of learning ground state entanglement of geometrically local Hamiltonians. - Adam Bouland; Chenyi Zhang 003; Zixin Zhou (CoRR, 2024)

On the average-case hardness of BosonSampling. - Adam Bouland; Ishaun Datta; Bill Fefferman; Felipe Hernandez (CoRR, 2024)

The State Hidden Subgroup Problem and an Efficient Algorithm for Locating Unentanglement. - Adam Bouland; Tudor Giurgica-Tiron; John Wright 004 (STOC, 2025)