Ryan Mann
@ryanlmann.bsky.social
Quantum Physicist at UTS. Interested in quantum computation, complexity theory, and combinatorics. https://ryanmann.org.
Currently supported servers:
arXiv, bioRxiv, chemRxiv, Cryptology ePrint Archive, and medRxiv.
arXiv, bioRxiv, chemRxiv, Cryptology ePrint Archive, and medRxiv.
July 1, 2025 at 2:46 AM
Currently supported servers:
arXiv, bioRxiv, chemRxiv, Cryptology ePrint Archive, and medRxiv.
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.
– 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.
July 1, 2025 at 2:46 AM
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.
– 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 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/...
April 23, 2025 at 10:18 PM
A special thanks to Gabe Waite for his relentless hard work and dedication. Feel free to contact us at [email protected] with suggestions or enquiries.
March 11, 2025 at 5:28 AM
A special thanks to Gabe Waite for his relentless hard work and dedication. Feel free to contact us at [email protected] with suggestions or enquiries.
A summary of our algorithmic results.
March 11, 2025 at 5:28 AM
A summary of our algorithmic results.
A summary of our results can be found here http://ryanmann.org/posts/5/efficient-algorithms-for-approximating-quantum-partition-functions
March 11, 2025 at 5:28 AM
A summary of our results can be found here http://ryanmann.org/posts/5/efficient-algorithms-for-approximating-quantum-partition-functions