Fast Algorithms for Stoquastic Spin Systems
August 21, 2026
Articles
Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
January 30, 2026
Approximate Counting in Local Lemma Regimes
December 12, 2025
A Graph-Theoretic Framework for Free-Parafermion Solvability
August 20, 2024
Algorithmic Cluster Expansions for Quantum Problems
June 16, 2023
Quantum Parameterized Complexity
March 16, 2022
Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
January 19, 2022
Simulating Quantum Computations with Tutte Polynomials
January 1, 2021
Primary
May 28, 2016
About
I am a Postdoctoral Fellow at the University of Technology Sydney.
My research interests are in quantum computation, complexity theory, and combinatorics.
mail\(\langle \mathfrak{a} \rangle\)ryanmann.org