Polynomial-time classical simulation of quantum ferromagnets

@article{Bravyi2017PolynomialtimeCS,
  title={Polynomial-time classical simulation of quantum ferromagnets},
  author={S. Bravyi and D. Gosset},
  journal={Physical review letters},
  year={2017},
  volume={119 10},
  pages={
          100503
        }
}
  • S. Bravyi, D. Gosset
  • Published 2017
  • Mathematics, Computer Science, Medicine, Physics
  • Physical review letters
  • We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, system size, and inverse temperature. As a consequence, we obtain a polynomial time algorithm which… CONTINUE READING
    18 Citations
    Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
    • 2
    • PDF
    Classical Simulation of High Temperature Quantum Ising Models
    • 3
    • PDF
    Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
    • 8
    • PDF
    A Theory of Trotter Error
    • 23
    • Highly Influenced
    • PDF
    De-Signing Hamiltonians for Quantum Adiabatic Optimization
    • 5
    • PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    Philosophical Magazine
    • 646
    • PDF
    Comm. Math. Phys
    • Comm. Math. Phys
    • 1972
    J. ACM
    • J. ACM
    • 2004
    Physics Reports
      • 3,119
      Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM
      • Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM
      • 2016
      Theoretical Computer Science Volume 213-214
      • 118