Related papers: Factorization Method for Simulating QCD at Finite …
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…
We perform dynamical QCD simulations with $n_f=2$ overlap fermions by hybrid Monte-Carlo method on $6^4$ to $8^3\times 16$ lattices. We study the problem of topological sector changing. A new method is proposed which works without…
We study quenched QCD just above the phase transition temperature using overlap Fermions. Exact zero modes of the overlap operator are localized. Chiral symmetry is restored, as indicated by the behavior of the chiral condensate after…
We demonstrate a factorization formula for semi-inclusive deep-inelastic scattering with hadrons in the current fragmentation region detected at low transverse momentum. To facilitate the factorization, we introduce the transverse-momentum…
Factorizing large matrices by QR with column pivoting (QRCP) is substantially more expensive than QR without pivoting, owing to communication costs required for pivoting decisions. In contrast, randomized QRCP (RQRCP) algorithms have proven…
Along with the widespread adoption of high-dimensional data, traditional statistical methods face significant challenges in handling problems with high correlation of variables, heavy-tailed distribution, and coexistence of sparse and dense…
Recent work on the spectrum of the Euclidean Dirac operator spectrum show that the exact microscopic spectral density can be computed in both random matrix theory, and directly from field theory. Exact relations to effective Lagrangians…
Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…
In this paper, we analyse a method for approximating the distribution function and density of a random variable that depends in a non-trivial way on a possibly high number of independent random variables, each with support on the whole real…
The reweighting method developed in Glasgow to circumvent the lattice action becoming complex at finite density suffers from a pathological onset transition thought to be due to the reweighting. We present a new reweighting scheme based on…
The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions…
An iterative optimization approach that simultaneously minimizes the energy and optimizes the Lagrange multipliers enforcing desired constraints is presented. The method is tested on previously established benchmark systems and it is proved…
We simulate quenched QCD with the overlap Dirac operator. We work with the Wilson gauge action at beta=6 on an 18^3x64 lattice. We calculate quark propagators for a single source point and quark mass ranging from am_q=0.03 to 0.75. We…
We summarize the standard factorization theorems for hard processes in QCD, and describe their proofs.
We study QCD at finite density and low temperature by using the complex Langevin method. We employ the gauge cooling to control the unitarity norm and introduce a deformation parameter in the Dirac operator to avoid the singular-drift…
We discuss $QCD$ in the Hamiltonian frame work. We treat finite density $QCD$ in the strong coupling regime. We present a parton-model inspired regularisation scheme to treat the spectrum ($\theta$-angles) and distribution functions in…
We introduce a novel approach that exploits the intersection of quantum computing, machine learning and reduced density matrix functional theory to leverage the potential of quantum computing to improve simulations of interacting quantum…
We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple…
Quickest change detection (QCD) is a fundamental problem in many applications. Given a sequence of measurements that exhibits two different distributions around a certain flipping point, the goal is to detect the change in distribution…
At present, many laboratories are performing experiments to simulate theoretical models of strongly correlated systems using cold atoms in optical lattices, a program referred to as "Quantum Simulation". It is hoped that these experiments…