Luke Schaeffer

Carolan, J., & Schaeffer, L. (2025). Succinct Fermion Data Structures. In R. Meka (Ed.), In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). (Vol. 325, pp. 32:1–32:21). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. http://doi.org/10.4230/LIPIcs.ITCS.2025.32 (Original work published February 2025)

Carolan, J., Childs, A. M., Kovacs-Deak, M., & Schaeffer, L. (2025). Translation-Invariant Quantum Algorithms for Ordered Search are Optimal. Https://arxiv.org/Abs/2503.21090. Retrieved from https://arxiv.org/abs/2503.21090 (Original work published March 2025)

Schaeffer, L., Shallit, J., & Zorcic, S. (2024). Beatty Sequences for a Quadratic Irrational: Decidability and Applications. ArXiv. Retrieved from https://arxiv.org/abs/2402.08331 (Original work published February 2024)

Gosset, D., Grier, D., Kerzner, A., & Schaeffer, L. (2024). Fast simulation of planar Clifford circuits. Quantum, 8, 1251. http://doi.org/10.22331/q-2024-02-12-1251 (Original work published February 2024)

Iyer, V., Jain, S., Kovacs-Deak, M., Kumar, V., Schaeffer, L., Wang, D., & Whitmeyer, M. (2023). On the Rational Degree of Boolean Functions and Applications. ArXiv. Retrieved from https://arxiv.org/abs/2310.08004 (Original work published October 2023)

Grier, D., Pashayan, H., & Schaeffer, L. (2024). Sample-optimal classical shadows for pure states. Quantum, 8, 1373. http://doi.org/10.22331/q-2024-06-17-1373 (Original work published June 2024)