28 citations · 97 across the 10 of their papers we have counts for
10 papers
Algorithmic Cluster Expansions for Quantum Problems
Ryan L. Mann, Romy M. Minko
We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of abstract polymer model…
A Unified Graph-Theoretic Framework for Free-Fermion Solvability
Adrian Chapman, Samuel J. Elman, Ryan L. Mann
We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration grap…
Quantum Parameterized Complexity
Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish…
Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
Tyler Helmuth, Ryan L. Mann
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbat…
Simulating Quantum Computations with Tutte Polynomials
Ryan L. Mann
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circui…
Efficient Algorithms for Approximating Quantum Partition Functions
Ryan L. Mann, Tyler Helmuth
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion o…