Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Mann, Ryan L."'
We show that a quantum spin system has an exact free-parafermion solution if its frustration graph is an oriented indifference graph. Further, we show that if the frustration graph of a model can be dipath oriented via switching operations, then the
Externí odkaz:
http://arxiv.org/abs/2408.09684
We study the optimal scheduling of graph states in measurement-based quantum computation, establishing an equivalence between measurement schedules and path decompositions of graphs. We define the spatial cost of a measurement schedule based on the n
Externí odkaz:
http://arxiv.org/abs/2403.04126
Autor:
Mann, Ryan L., Minko, Romy M.
Publikováno v:
PRX Quantum 5, 010305 (2024)
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 models formalism of Koteck\'y and Preiss. We apply our framework to obtain
Externí odkaz:
http://arxiv.org/abs/2306.08974
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 graph of a spin model captures the pairwise anticommutation relations betw
Externí odkaz:
http://arxiv.org/abs/2305.15625
Autor:
Bremner, Michael J., Ji, Zhengfeng, Mann, Ryan L., Mathieson, Luke, Morales, Mauro E. S., Shaw, Alexis T. E.
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 a quantum equivalent of classical parameterized complexity theory, mot
Externí odkaz:
http://arxiv.org/abs/2203.08002
Autor:
Helmuth, Tyler, Mann, Ryan L.
Publikováno v:
Quantum 7, 1155 (2023)
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 perturbations of classical spin systems. Our algorithm is based on combining th
Externí odkaz:
http://arxiv.org/abs/2201.06533
Autor:
Mann, Ryan L.
Publikováno v:
npj Quantum Information 7, 141 (2021)
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids. The alg
Externí odkaz:
http://arxiv.org/abs/2101.00211
Autor:
Mann, Ryan L., Helmuth, Tyler
Publikováno v:
Journal of Mathematical Physics 62, 022201 (2021)
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 of Neto\v{c}n\'y and Redig and the cluster expansion approach to design
Externí odkaz:
http://arxiv.org/abs/2004.11568
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p$ and a giv
Externí odkaz:
http://arxiv.org/abs/2004.09938
Autor:
Mann, Ryan L., Bremner, Michael J.
Publikováno v:
Quantum 3, 162 (2019)
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external
Externí odkaz:
http://arxiv.org/abs/1806.11282