Efficient inference in the transverse field Ising model
From MaRDI portal
Publication:6040928
Abstract: In this paper we introduce an approximate method to solve the quantum cavity equations for transverse field Ising models. The method relies on a projective approximation of the exact cavity distributions of imaginary time trajectories (paths). A key feature, novel in the context of similar algorithms, is the explicit separation of the classical and quantum parts of the distributions. Numerical simulations show accurate results in comparison with the sampled solution of the cavity equations, the exact diagonalization of the Hamiltonian (when possible) and other approximate inference methods in the literature. The computational complexity of this new algorithm scales linearly with the connectivity of the underlying lattice, enabling the study of highly connected networks, as the ones often encountered in quantum machine learning problems.
Recommendations
Cites work
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- Learning quantum models from quantum or classical data
- Quantum phase transitions in transverse field spin models. From statistical physics to quantum information
- Replica cluster variational method
- The 1D Ising model and the topological phase of the Kitaev chain
- Topological phases and quantum computation
Cited in
(2)
This page was built for publication: Efficient inference in the transverse field Ising model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040928)