10 citations · 10 across the 1 of their papers we have counts for
3 papers
cs.DS2020
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…
quant-ph2018
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
Ryan L. Mann, Michael J. Bremner
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximatio…
quant-ph2017★ 10 cited
On the Complexity of Random Quantum Computations and the Jones Polynomial
Ryan L. Mann, Michael J. Bremner
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations…