10 citations · 11 across the 2 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…