Academic Reading List

Below is the collection of my academic reading lists; all papers/texts that have been on my academic reading list at some point or another should be documented here.

---

December 20th

• Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm, A. Bouland and T. Guirgica-Tiron. Arxiv preprint (2021). arXiv:2112.02040
• Quantum encryption with certified deletion, A. Broadbent and R. Islam. Arxiv preprint (2019). arXiv:1910.03551
• Deciding universality of quantum gates, G. Ivanyos. Journal of Algbera (2006). arXiv:0603009
• Universality in Quantum Computation, E. Jeandel. Automata, Languages, and Programming, ICALP (2004). link
• The Classification of Clifford Gates over Qubits, D. Grier and L. Schaeffer. Quantum (2022). arXiv:1603.03999
• Complexity Classification of Conjugated Clifford Circuits, A. Bouland, J.F. Fitzsimons, and D.E. Koh. Computational Complexity Conference (2018). arXiv:1709.01805
• Random regular graph states are complex at almost any depth, S. Ghosh, D. Hangleiter, and J. Helsen. Arxiv preprint (2024). arXiv:2412.07058
• The LU-LC conjecture is false, Z. Ji, J. Chen, Z. Wei, and M. Ying. Arxiv preprint (2008). arXiv:0709.1266
• Locality Bounds for Sampling Hamming Slices, D.M. Kane, A. Ostuni, and K. Wu. Arxiv preprint (2024). arXiv:2402.14278
• On the Pauli Spectrum of QAC0, S. Nadimpalli, N. Parham, F. Vasconcelos, and H. Yuen. STOC (2024). arXiv:2311.09631

September 8th

• The Classification of Reversible Bit Operations, S. Aaronson, D. Grier, and L. Shaeffer. Arxiv preprint (2015). arXiv:1504.05155
• Quantum encryption with certified deletion, A. Broadbent and R. Islam. Arxiv preprint (2019). arXiv:1910.03551
• Deciding universality of quantum gates, G. Ivanyos. Journal of Algbera (2006). arXiv:0603009
• Universality in Quantum Computation, E. Jeandel. Automata, Languages, and Programming, ICALP (2004). link
• The Classification of Clifford Gates over Qubits, D. Grier and L. Schaeffer. Quantum (2022). arXiv:1603.03999
• Univesal Quantum Gates, J. Brylinski and R. Brylinski. Arxiv preprint (2001). arXiv:0108062
• Complexity Classification of Conjugated Clifford Circuits, A. Bouland, J.F. Fitzsimons, and D.E. Koh. Computational Complexity Conference (2018). arXiv:1709.01805
• Complexity classification of two-qubit commuting hamiltonians, A. Bouland, L. Mancinska, and X. Zhang. Computational Complexity Conference (2016). arXiv:1602.04145
• Fast Generation of Regular Graphs and Construction of Cages, M. Meringer. Journal of Graph Theory 30 (1999). link

July 6th

• Deciding universality of quantum gates, G. Ivanyos. Journal of Algbera (2006). arXiv:0603009
• The Classification of Clifford Gates over Qubits, D. Grier and L. Schaeffer. Quantum (2022). arXiv:1603.03999
• Univesal Quantum Gates, J. Brylinski and R. Brylinski. Arxiv preprint (2001). arXiv:0108062
• Complexity Classification of Conjugated Clifford Circuits, A. Bouland, J.F. Fitzsimons, and D.E. Koh. Computational Complexity Conference (2018). arXiv:1709.01805
• Complexity classification of two-qubit commuting hamiltonians, A. Bouland, L. Mancinska, and X. Zhang. Computational Complexity Conference (2016). arXiv:1602.04145
• A New Framework for Quantum Oblivious Transfer, A. Agarwal, J. Bartusek, D. Khurana, and N. Kumar. Eurocrypt (2023). eprint:1191
• Fast Generation of Regular Graphs and Construction of Cages, M. Meringer. Journal of Graph Theory 30 (1999). link
• Asymptotics of Ramsey numbers of double stars, S. Norin, Y.R. Sun, and Y. Zhao. Arxiv preprint (2016). arXiv:1605.03612