scispace - formally typeset
M

Matthias Troyer

Researcher at Microsoft

Publications -  481
Citations -  35590

Matthias Troyer is an academic researcher from Microsoft. The author has contributed to research in topics: Quantum Monte Carlo & Monte Carlo method. The author has an hindex of 86, co-authored 473 publications receiving 28965 citations. Previous affiliations of Matthias Troyer include University of Zurich & ETH Zurich.

Papers
More filters
Journal Article

Three-sublattice order in the SU(3) Heisenberg model on the square and triangular lattice

TL;DR: In this paper, a numerical study of the SU(3) Heisenberg model of three-flavor fermions on the triangular and square lattice by means of the density-matrix renormalization group and infinite projected entangled-pair states is presented.
Journal ArticleDOI

Scaling analysis and instantons for thermally assisted tunneling and quantum Monte Carlo simulations

TL;DR: In this article, an instantonic calculus was developed to derive an analytical expression for the thermally assisted tunneling decay rate of a metastable state in a fully connected quantum spin model.
Journal ArticleDOI

Nearly critical ground state of lacuo2.5

TL;DR: In this article, a combination of analytical techniques and quantum Monte Carlo simulations was used to investigate the coupled spin-ladder system LaCuO{sub 2.5} and found a quantum phase transition between a Neel ordered and a disordered state.
Journal ArticleDOI

Probing the stability of the spin liquid phases in the Kitaev-Heisenberg model using tensor network algorithms

TL;DR: In this article, the authors study the extent of spin liquid phases in the Kitaev-Heisenberg model using infinite projected entangled-pair states tensor network ansatz wave functions directly in the thermodynamic limit.
Journal ArticleDOI

The Beliaev technique for a weakly interacting Bose gas

TL;DR: In this article, the authors present results for all the thermodynamic quantities and correlation functions for a weakly interacting Bose gas at short-to-intermediate distances obtained within an improved version of Beliaev's diagrammatic technique.