Related papers: Message passing on the QCDSP supercomputer
We review the architecture of massively parallel machines used for lattice QCD simulations and present benchmarks for the performance of popular algorithms on these platforms. We cover commercial supercomputers, PC clusters, and…
Message passing on factor graphs is a powerful framework for probabilistic inference, which finds important applications in various scientific domains. The most wide-spread message passing scheme is the sum-product algorithm (SPA) which…
Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it…
In this paper, we propose a new combined message passing algorithm which allows belief propagation (BP) and mean filed (MF) applied on a same factor node, so that MF can be applied to hard constraint factors. Based on the proposed message…
I review recent machine trends and algorithmic developments for dynamical lattice QCD simulations with the HMC algorithm for Wilson-type fermions. The topics include the trend toward multi-core processors and general purpose GPU (GPGPU)…
A number of proposed extensions of the Standard Model include new strongly interacting dynamics, in the form of SU(N) gauge fields coupled to various numbers of fermions. Often, these extensions allow N = 3 as a plausible choice, or even…
In this paper we offer a solution to a long-standing problem in the study of networks. Message passing is a fundamental technique for calculations on networks and graphs. The first versions of the method appeared in the 1930s and over the…
In lattice field theory, field sparsening aims to replace quantum fields, or objects constructed from them, with approximations that preserve the appropriate symmetries and maintain many aspects of the physics that the fields determine. For…
We argue that lattice simulations of full QCD with varying quark mass are best conducted at fixed lattice spacing rather than at fixed $\beta$. We present techniques which enable this to be carried out effectively, namely the tuning in bare…
The most celebrated and extensively studied model of distributed computing is the {\em message-passing model,} in which each vertex/node of the (distributed network) graph corresponds to a static computational device that communicates with…
Quantum machine learning is emerging as a promising application of quantum computing due to its distinct way of encoding and processing data. It is believed that large-scale quantum machine learning demonstrates substantial advantages over…
The quantum state transmission (QST) through the medium of high-dimensional many-particle system is studied with a symmetry analysis. We discover that, if the spectrum matches the symmetry of a fermion or boson system in a certain fashion,…
Some recent beyond Standard Model phenomenology is based on new strongly interacting dynamics of $SU(N)$ gauge fields coupled to various numbers of fermions. When $N=3$ these systems are analogues of QCD, although the fermion masses are…
We discuss a machine learning (ML) regression model to reduce the computational cost of disconnected diagrams in lattice QCD calculations. This method creates a mapping between the results of fermionic loops computed at different quark…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…
Over the past few years new physics methods and algorithms as well as the latest supercomputers have enabled the study of the QCD thermodynamic phase transition using lattice gauge theory numerical simulations with unprecedented control…
Quantum error correction (QEC) and fault-tolerant (FT) mechanisms are essential for reliable quantum computing. However, QEC considerably increases the computation size up to four orders of magnitude. Moreover, FT implementation has…
I apply a recently developed algorithm for reweighting simulations of lattice QCD from one quark mass to another to simulations performed with overlap fermions in the epsilon regime. I test it by computing the condensate from distributions…
We study a class of statistical systems which simulate 3D gonihedric system on euclidean lattice. We have found the exact partition function of the 3D-model and the corresponding critical indices analysing the transfer matrix…
Suppose that wirelessly communicating sensors are placed in a regular fashion on the points of a lattice. Common communication protocols allow the sensors to broadcast messages at arbitrary times, which can lead to problems should two…