1. Aaronson, S.: BQP and the polynomial hierarchy. In: STOC 2010, pp. 141–150 (2010). arXiv:0910.4698
2. Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. (2017). arXiv:1704.04487
3. Alagic, G., et al.: Status report on the first round of the NIST post-quantum cryptography standardization process (2019)
4. Alagic, G., Childs, A.M., Grilo, A.B., Hung, S.-H.: Non-interactive classical verification of quantum computation (2019). arXiv:1911.08101
5. Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: FOCS 2014, pp. 474–483 (2014). https://eprint.iacr.org/2014/296 Cryptology ePrint Archive Report 2014/296