Related papers: Meron-Cluster Solution of Fermion Sign Problems
We present a mapping of elementary fermion operators onto a quadratic form of composite fermionic and bosonic operators. The mapping is an exact isomorphism as long as the physical constraint of one composite particle per cluster is…
We explore the sign problem in strongly coupled lattice QED with one flavor of Wilson fermions in four dimensions using the fermion bag formulation. We construct rules to compute the weight of a fermion bag and show that even though the…
In several self-coupled quantum field theories when treated in semi-classical limit one obtains solitonic solutions determined by topology of the boundary conditions. Such solutions, e.g. magnetic monopole in unified theories…
The Monte Carlo calculation of R\'enyi entanglement entropies $S^{}_n$ of interacting fermions suffers from a well-known signal-to-noise problem, even for a large number of situations in which the infamous sign problem is absent. A few…
QCD at fixed baryon number can be formulated in terms of transfer matrices explicitly defined in the canonical sectors. In the heavy-dense limit, the fermionic contributions to the canonical partition functions in terms of Polyakov loops…
We present a solution to the sign problem in dynamical random matrix simulations of a two-matrix model at nonzero chemical potential. The sign problem, caused by the complex fermion determinants, is solved by gathering the matrices into…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
Topological invariants, such as the Chern number, characterise topological phases of matter. Here we provide a method to detect Chern numbers in systems with two distinct species of fermion, such as spins, orbitals or several atomic states.…
The Green's function Monte Carlo (GFMC) method provides accurate solutions to the nuclear many-body problem and predicts properties of light nuclei starting from realistic two- and three-body interactions. Controlling the GFMC fermion-sign…
We introduce a new mathematical object, the "fermionant" ${\mathrm{Ferm}}_N(G)$, of type $N$ of an $n \times n$ matrix $G$. It represents certain $n$-point functions involving $N$ species of free fermions. When N=1, the fermionant reduces…
The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with the partition function whose integrand is not real positive. The basic idea of the factorization method applied on such a system is to control…
The HERWIG 5.9 cluster hadronization model is briefly discussed here. It is shown that the model has peculiar behaviour when new heavy baryon resonances are included in the HERWIG 5.9 particle table. New fragmentation model is proposed to…
We classify the sign-problem-free relativistic fermion actions on the basis of the Majorana representation. In the Majorana representation, the sign-problem-free condition is given by the semi-positivity of a Pfaffian. We show that the…
We present the fermionic universal one--loop effective action obtained by integrating out heavy vector--like fermions at one loop using functional techniques. Even though previous approaches are able to handle integrating out heavy fermions…
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…
Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit…
The problem of controlling higher-order interactions in neural networks is addressed with techniques commonly applied in the cluster analysis of quantum many-particle systems. For multi-neuron synaptic weights chosen according to a…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Solitons emerge as non-perturbative solutions of non-linear wave equations in classical and quantum theories. These are non-dispersive and localised packets of energy-remarkable properties for solutions of non-linear differential equations.…
Non-negative matrix factorization (NMF) is a popular unsupervised learning approach widely used in image clustering. However, in real-world clustering scenarios, most existing NMF methods are highly sensitive to noise corruption and are…