I'm pleased to have finished this simple note with Gabe Waite on efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature.
scift.app/arxiv/paper/...
A summary of results in local lemma regimes.
I'm please to have finished this paper on approximate counting in local lemma regimes with Gabe Waite arxiv.org/abs/2512.10134
Currently supported servers:
arXiv, bioRxiv, chemRxiv, Cryptology ePrint Archive, and medRxiv.
Key features:
– Explore new science as it is posted.
– Save papers to your profile to revisit anytime.
– Meet your Scibling: after enough activity, Scift will match you with another scientist around the world who shares your research interests.
I'm excited to share that my new website, Scift (www.scift.app), is now live!
Scift is a simple way to explore scientific preprints from across all areas of science — no ratings, no comments, just the papers to read and consider on your own terms.
bsky.app/profile/ryan...
I'm pleased that our paper on a graph-theoretic framework for free-parafermion solvability has been published in RSPA. We prove that if the frustration graph of a spin system is an oriented indifference graph, then it has an exact free-parafermion solution. royalsocietypublishing.org/doi/10.1098/...
Gabe Waite (@quantumbeef_) of the Hamiltonian Jungle has uploaded his first first-author paper: "The Complexity of Local Stoquastic Hamiltonians on 2D Lattices". Read here: https://arxiv.org/pdf/2502.14244
I'm pleased that our work on the optimal scheduling of graph states via path decompositions has been published in Physical Review A. https://journals.aps.org/pra/abstract/10.1103/PhysRevA.111.012627
New paper with Samuel Elman, David Wood, and Adrian Chapman! We provide a graph-theoretic characterisation of when a quantum spin system can be solved via a mapping to free parafermions.
https://arxiv.org/pdf/2408.09684
The Hamiltonian Jungle has expanded! In our latest update we unravel the secrets of Cluster Expansions, C*-Algebras, and MCMC. We also explore the complexities of Stoquastic Hamiltonians and Partition Functions.
Explore the jungle at
On the arXiv today, Sam, Jason, and me,
Posted some trivial results on MBQC.
http://arxiv.org/abs/2403.04126
A special thanks to Gabe Waite for his relentless hard work and dedication. Feel free to contact us at jumanji@hamiltonianjungle.xyz with suggestions or enquiries.
The Hamiltonian Jungle is now alive! Inspired by the legacy of the Complexity Zoo, Quantum Algorithm Zoo, and Error Correction Zoo, this new website categorises the complexities of local Hamiltonian problems. Explore the jungle at
I'm delighted that our paper on algorithmic cluster expansions for quantum problems, authored with @rminkomaths, has been accepted for publication in PRX Quantum.
https://journals.aps.org/prxquantum/accepted/fd077D4dT7917e09808e6243bbf834c71b2ad4d2b
https://arxiv.org/abs/2306.08974
I'm pleased that Tyler Helmuth's and my paper has been published in @quantumjournal!
https://quantum-journal.org/papers/q-2023-10-25-1155/
A summary of our algorithmic results.
I'm excited to have finished this paper on algorithmic cluster expansions for quantum problems with @rminkomaths . https://arxiv.org/abs/2306.08974
I’m pleased to have completed this note on free-fermion solvability with Adrian Chapman and Sam Elman. http://arxiv.org/abs/2305.15625
The recordings from QCTIP 2022 are now available at https://www.youtube.com/channel/UCdcG25nPxMXo4-l4XaVahoA/videos
I'm glad to have created this horcrux with
@mickbremner, @jizhengfeng, @Mauromsoler, @varno91, and Luke Mathieson. https://arxiv.org/abs/2203.08002
New paper with Tyler Helmuth: Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature https://arxiv.org/abs/2201.06533
I'm excited that our paper on simulating quantum computations with Tutte polynomials was published in npj Quantum Information today. https://www.nature.com/articles/s41534-021-00477-0
I'm pleased that Tyler Helmuth and my paper on efficient algorithms for approximating quantum partition functions was published in the Journal of Mathematical Physics today. https://doi.org/10.1063/5.0013689
New paper: "Simulating Quantum Computations with Tutte Polynomials". Nothing too exciting, but I'm glad to have finally finished it --- https://scirate.com/arxiv/2101.00211
A summary of our results can be found here http://ryanmann.org/posts/5/efficient-algorithms-for-approximating-quantum-partition-functions
New paper with Tyler Helmuth: "Efficient Algorithms for Approximating Quantum Partition Functions" --- https://scirate.com/arxiv/2004.11568
New paper with Luke Mathieson and Catherine Greenhill --- "On the Parameterised Complexity of Induced Multipartite Graph Parameters" --- https://arxiv.org/abs/2004.09938
Enumerational --- Found in Graph Theory and Theoretical Physics (1967).
