# Andrea W. Coladangelo

### I am a postdoc at UC Berkeley and a Quantum Postdoctoral Fellow at the Simons Institute, advised by Umesh Vazirani.

### Previously, I was a Research Fellow at the Simons Institute for the semester "the Quantum Wave in Computing". I received my PhD from Caltech in 2020, under the wonderful supervision of Thomas Vidick. Before that, I received a B.A. in Mathematics from the University of Oxford and a Master in Mathematics from the University of Cambridge.

I am broadly interested in quantum computation. Recently, I have been most excited

about understanding the interplay between quantum computation and cryptography.

Previously, I have studied foundational questions about entanglement and quantum correlations, inspired by the question of certifying quantum devices.

### Since August 2020, I am an editor for the journal Quantum.

### I am a co-founder of qBraid, a cloud-based platform for learning quantum computing

and developing quantum algorithms.

**Contact Information**

andrea (dot) coladangelo (at) gmail (dot) com

**Publications and preprints**

(See my Google Scholar page for a more reliably up-to-date list)

- Deniable Encryption in a Quantum World [arXiv]

**STOC**

**202**

**2**.

- Hidden Cosets and Applications to Unclonable Cryptography [arXiv]

**CRYPTO 2021**. Contributed talk at

**QIP 2022**and

**QCrypt 2021**.

- One-way Functions Imply Secure Computation in a Quantum World [arXiv]

**CRYPTO 2021**.

**Long plenary talk**at

**QIP 2021**, and

**invited talk**at

**QCrypt 2021**(merged with arXiv:2011.14980).

- On the Round Complexity of Secure Quantum Computation [arXiv]

**CRYPTO 2021**. Contributed talk at

**QIP 2021**and

**QCrypt 2021**.

- Device-independent quantum key distribution from computational assumptions [arXiv]

**QIP 2021**and

**QCrypt 2021**(merged with arXiv:2001.09161).

- Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [arXiv]

**QIP 2021**(merged with arXiv 2101.12739).

- A quantum money solution to the blockchain scalabilty problem [arXiv]

**Quantum**4, 297. Contributed talk at

**QCrypt 2020**.

- Non-interactive zero-knowledge arguments for QMA, with preprocessing [arXiv]

**CRYPTO 2020**. Contributed talk at

**QIP 2021**.

- Additive entanglement measures cannot be more than asymptotically continuous [arXiv]

- A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure

**Quantum**4, 282.

- Smart-contracts meet quantum cryptography [arXiv]

- Unconditional separation of finite and infinite-dimensional quantum correlations [arXiv]

**Nature Communications**, 11, 1-6 (2020).

**Long plenary talk**and

**best student paper award**at

**QIP 2019**.

- Generalization of the Clauser-Horne-Shimony-Holt inequality self-testing maximally entangled states of any local dimension [arXiv]

**Physical Review A**, 98 (5), 052115 (2018).

- Robust self-testing for linear constraint system games [arXiv]

**QIP 2018**.

- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources [arXiv]

**EUROCRYPT 2019**. Contributed talk at

**QIP 2018**.

- Separation of finite and infinite-dimensional quantum correlations, with infinite question or answer sets [arXiv]

- Self-testing multipartite entangled state through projections onto two systems [arXiv]

**New Journal of Physics**20 (8), 083041 (2018).

- All pure bipartite entangled states can be self-tested [arXiv]

**Nature Communications**8, 15485 (2017). Contributed talk at

**QIP 2018**.

- Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH and the magic square game [arXiv]

**Quantum Information and Computation**Vol. 17, 9&10 (2017). Contributed talk at

**QIP 2017**.

**Talks**

- Deniable encryption in a quantum world --
*UC Santa Barbara Theory Seminar**,*December 2021 - One-way functions imply secure computation in a quantum world --
*Quantum Wave in Computing Reunion, Simons Institute,*July 2021 (video) - Non-interactive zero-knowledge arguments for QMA, with preprocessing --
*Quantum Information Seminar, Perimeter Institute,*September 2020 - Non-interactive zero-knowledge arguments for QMA, with preprocessing --
*Workshop on Quantum Information, Computation, and Foundation, Yukawa Institute for Theoretical Physics, Kyoto University*, September 2020 (video) - A quantum money solution to the blockchain scalability problem --
*QCrypt 2020*, August 2020 (video) - Self-testing as an approach to certifying quantum systems --
*Workshop on Quantum Protocols: Testing & Quantum PCPs, Simons Institute,*March 2020 (video) - Non-interactive zero-knowledge arguments for QMA, with preprocessing --
*Quantum Seminar, Simons Institute*, March 2020 - A two-player dimension witness based on embezzlement --
*QuICS, University of Maryland,*October 2019 (video) - A two-player dimension witness based on embezzlement --
*IQC Waterloo*, June 2019 - A two-player dimension witness based on embezzlement --
*UC Berkeley quantum lunch*, May 2019 - Unconditional separation of finite and infinite-dimensional quantum correlations --
*Caltech IQIM Seminar*, January 2019 - Unconditional separation of finite and infinite-dimensional quantum correlations --
*QIP 2019 (plenary), University of Colorado, Boulder,*January 2019 (video) - Unconditional separation of finite and infinite-dimensional quantum correlations --
*Quantum Innovators Workshop, IQC Waterloo,*October 2018 - All pure bipartite entangled states can be self-tested --
*QIP 2018, Delft,*January 2018 (video) - Verifier-on-a-leash: New schemes for two-prover verifiable delegated quantum computation --
*QIP 2018, Delft*, January 2018 (video) - Verifier-on-a-leash: New schemes for two-prover verifiable delegated quantum computation --
*ICFO Seminar*, July 2017 - Verifier-on-a-leash: New schemes for two-prover verifiable delegated quantum computation --
*ETH Zurich*, July 2017 - All pure bipartite entangled states can be self-tested --
*TQC 2017, Paris,*June 2017 - Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH --
*QIP 2017, Seattle*, January 2017 (video)

**Teaching**

I was a teaching assistant for the following courses at Caltech:

- (Fall 2018) CS152a: Introduction to Cryptography
- (Fall 2016) CS/Ph120: Quantum Cryptography (also offered as an EdX course)

Other teaching:

- I am an author of a quantum computing course for high school students, based on recorded video lectures, and programming exercises.
- (2018-2019) Muir High School, Pasadena: I tutored high school students in Math and Science as part of an outreach initiative of the Caltech Y Rise Program
- (2012-13) St. Andrew’s Primary School, Headington, Oxford: I ran the weekly chess club for students aged 6 to 10.

**Professional Service**

*Editor*: Quantum (August 2020-present)

*Program Committees*: QIP 2020, QCrypt 2021, QIP 2022.

**Music**