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 ArticleDOI
Type-II Weyl semimetals.
Alexey A. Soluyanov,Dominik Gresch,Zhijun Wang,QuanSheng Wu,Matthias Troyer,Xi Dai,B. Andrei Bernevig +6 more
TL;DR: This work proposes the existence of a previously overlooked type of Weyl fermion that emerges at the boundary between electron and hole pockets in a new phase of matter and discovers a type-II Weyl point, which is still a protected crossing, but appears at the contact of electron and Hole pockets in type- II Weyl semimetals.
Journal ArticleDOI
WannierTools: An open-source software package for novel topological materials
QuanSheng Wu,Shengnan Zhang,Hai-Feng Song,Matthias Troyer,Alexey A. Soluyanov,Alexey A. Soluyanov +5 more
TL;DR: This code works in the tight-binding framework, which can be generated by another software package Wannier90 Mostofi et al. (2008), and can help to classify the topological phase of a given materials by calculating the Wilson loop, and get the surface state spectrum.
Journal ArticleDOI
Solving the quantum many-body problem with artificial neural networks
TL;DR: In this paper, a variational representation of quantum states based on artificial neural networks with a variable number of hidden neurons is introduced. But this model is not suitable for the many-body problem in quantum physics.
Journal ArticleDOI
Continuous-time Monte Carlo methods for quantum impurity models
Emanuel Gull,Andrew J. Millis,Alexander I. Lichtenstein,Alexey N. Rubtsov,Matthias Troyer,Philipp Werner +5 more
TL;DR: In this paper, the continuous-time quantum Monte Carlo (QMC) algorithm is used to solve the local correlation problem in quantum impurity models with high and low energy scales and is effective for wide classes of physically realistic models.
Journal ArticleDOI
Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
Matthias Troyer,Uwe-Jens Wiese +1 more
TL;DR: It is proved that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problems would also solve all problems in the complexity class NP inPolynomial time.