Related papers: Reducing the Sign Problem with simple Contour Defo…
A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low…
We present detailed discussions on a new approach we proposed in a previous paper to numerically study quantum spin systems. This method, which we will call re-structuring method hereafter, is based on rearrangement of intermediate states…
Some notable systems, such as room-temperature superconductors and materials for controlled nuclear fusion, require an accurate description of finite-temperature quantum matter. Stochastic path integral methods are finite-temperature and…
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…
Gradient estimation is a central challenge in training parameterized quantum circuits (PQCs) for hybrid quantum-classical optimization and learning problems. This difficulty arises from several factors, including the exponential…
We consider the heavy-dense limit of QCD at finite fermion density in the canonical formulation and approximate it by a 3-state Potts model. In the strong coupling limit, the model is free of the sign problem. Away from the strong coupling,…
Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called…
The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon's problem) can be seen as specific instances of it.…
This Note revisits the Leibnitz integral calculus method based on differentiation under the integral sign with respect to a parameter either already existing or introduced ad hoc. Through several cases exemplifying the method, it is shown…
For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties, without the sign problem. The list spans condensed matter, nuclear physics, and…
This paper proposes a new set of conditions for exactly representing collision avoidance constraints within optimization-based motion planning algorithms. The conditions are continuously differentiable and therefore suitable for use with…
We consider a class of Hubbard-Stratonovich transformations suitable for treating Hubbard interactions in the context of quantum Monte Carlo simulations. A tunable parameter $p$ allows us to continuously vary from a discrete Ising auxiliary…
Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by…
Recently, cluster methods have been used to solve a variety of sign problems including those that arise in the presence of fermions. In all cases an analytic partial re-summation over a class of configurations in the path integral was…
Based on realistic simulations, we propose an hybrid method to reconstruct the lensing potential power spectrum, directly on PLANCK-like CMB frequency maps. It implies using a large galactic mask and dealing with a strong inhomogeneous…
It has been shown that a global minimizer of a smooth determinant of a matrix function corresponds to the largest cycle of a graph. When it exists, this is a Hamiltonian cycle. Finding global minimizers even of a smooth function is a…
With the large uses of the intelligent systems in different domains, and in order to increase the drivers and pedestrians safety, the road and traffic sign recognition system has been a challenging issue and an important task for many…
Cumulant mapping has been recently suggested [Frasinski, Phys. Chem. Chem. Phys. 24, 207767 (2022)] as an efficient approach to observing multi-particle fragmentation pathways, while bypassing the restrictions of the usual…
We present a subset method that solves the sign problem for QCD at nonzero quark chemical potential in 0+1 dimensions. The subsets of gauge configurations are constructed using the center symmetry of the SU(3) group. These subsets…
This paper studies convex quadratic minimization problems in which each continuous variable is coupled with a binary indicator variable. We focus on the structured setting where the Hessian matrix of the quadratic term is positive definite…