Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

January 17, 2022 Β· Declared Dead Β· πŸ› Quantum

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tyler Helmuth, Ryan L. Mann arXiv ID 2201.06533 Category quant-ph: Quantum Computing Cross-listed cs.CC, cs.DS, math.CO Citations 8 Venue Quantum Last Checked 5 months ago
Abstract
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 the contour representation of quantum spin systems of this type due to Borgs, KoteckΓ½, and Ueltschi with the algorithmic framework developed by Helmuth, Perkins, and Regts, and Borgs et al.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted