Related papers: Solution to sign problems in half-filled spin-pola…
The complex Langevin method is one hopeful candidate to tackle the sign problem. This method is applicable not only to QCD but also to nonrelativistic field theory, such as condensed matter physics. We present the simulation results of a…
The multilevel blocking algorithm recently proposed as a possible solution to the sign problem in path-integral Monte Carlo simulations has been extended to systems with long-ranged interactions along the Trotter direction. As an…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is…
We establish the existence of sign-changing entire solutions to weighted critical $p$-Laplace equations of the Caffarelli-Kohn-Nirenberg type. In doing so, we investigate classes of symmetry and show that, for suitable symmetry…
We consider a two-component quantum Hall system within a Landau-Ginzburg theory with two Chern-Simons gauge fields. From this theory we derive a sigma model covariantly coupled to one Chern-Simons field and find mean field solutions that…
In this paper we summarize the existing principles for building unconventional computing devices that involve delayed signals for encoding solutions to NP-complete problems. We are interested in the following aspects: the properties of the…
We propose a projection approach to perform quantum Monte Carlo (QMC) simulation on the infinite-$U$ Hubbard model at some integer fillings where either it is sign problem free or surprisingly has an algebraic sign structure -- a power law…
Spin injection and detection in silicon is a difficult problem, in part because the weak spin-orbit coupling and indirect gap preclude using standard optical techniques. We propose two ways to overcome this difficulty, and illustrate their…
Euclidean dense matter generically suffers from the fermion sign problem. However, we argue that the sign problem is absent if one considers only low-energy degrees of freedom. Specifically, the low energy effective theory of dense QCD has…
Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to…
A numerical implementation scheme is presented for the recently developed many-body diffusion approach for identical particles, in the case of harmonic potentials. The procedure is free of the sign problem, by the introduction of the…
The fermion sign problem, the biggest obstacle in quantum Monte Carlo calculations, is completely solved in this paper. Here, we find a strategy, in which the contribution from those negative-weighted paths is thoroughly cancelled or…
The decoration or iteration transformation was widely applied to solve exactly the magnetic spin models in one-dimensional and two-dimensional lattice. The motif of this letter is to extend the decoration transformation approach for models…
We study one-dimensional QCD at finite quark density by using the sign optimization framework. The fermion sign problem is mitigated by deforming the path integral domain, $SU(3)$ to a complexified one ${\cal M} \subset SL(3)$, explicitly…
This article gives an introduction to the multilevel blocking (MLB) approach to both the fermion and the dynamical sign problem in path-integral Monte Carlo simulations. MLB is able to substantially relieve the sign problem in many…
We study the Hubbard model with non-Hermitian asymmetric hopping terms. The conjugate hopping terms are introduced for two spin components so that the negative sign is canceled out. This ensures that the quantum Monte Carlo simulation is…
We present a quantum impurity solver based on a pseudo-particle framework, which combines diagrammatic resummations for a three-point vertex with diagrammatic Monte Carlo sampling of a four-point vertex. This recently proposed approach [A.…
The sign problem is a widespread numerical hurdle preventing us from simulating the equilibrium behavior of various problems at the forefront of physics. Focusing on an important sub-class of such problems, bosonic $(2+1)$-dimensional…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…