| 2026 | STOC | A Meta-complexity Characterization of Minimal Quantum Cryptography. | Bruno Cavalar, Boyang Chen, Andrea Coladangelo, Matthew Gray, Zihan Hu, Zhengfeng Ji, Xingjian Li |
| 2026 | STOC | The Power of Two Bases: Robust and Copy-Optimal Certification of Nearly All Quantum States with Few-Qubit Measurements. | Andrea Coladangelo, Jerry Li, Joseph Slote, Ellen Wu |
| 2025 | EuroCrypt | The Power of a Single Haar Random State: Constructing and Separating Quantum Pseudorandomness. | Boyang Chen, Andrea Coladangelo, Or Sattath |
| 2024 | FOCS | A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness. | Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo |
| 2024 | STOC | How to Use Quantum Indistinguishability Obfuscation. | Andrea Coladangelo, Sam Gunn |
| 2024 | TCC | On Black-Box Separations of Quantum Digital Signatures from Pseudorandom States. | Andrea Coladangelo, Saachi Mutreja |
| 2023 | STOC | Quantum Depth in the Random Oracle Model. | Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner |
| 2022 | STOC | Deniable encryption in a Quantum world. | Andrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani |
| 2021 | CRYPTO | On the Round Complexity of Secure Quantum Computation. | James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma |
| 2021 | CRYPTO | One-Way Functions Imply Secure Computation in a Quantum World. | James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma |
| 2021 | CRYPTO | Hidden Cosets and Applications to Unclonable Cryptography. | Andrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark Zhandry |
| 2020 | CRYPTO | Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. | Andrea Coladangelo, Thomas Vidick, Tina Zhang |
| 2019 | EuroCrypt | Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. | Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick |