Related papers: Message passing on the QCDSP supercomputer
The field of quantum information processing offers secure communication protected by the laws of quantum mechanics and is on the verge of finding wider application for information transfer of sensitive data. To overcome the obstacle of…
Designing efficient quantum processor topologies is pivotal for advancing scalable quantum computing architectures. The communication overhead, a critical factor affecting the execution fidelity of quantum circuits, arises from inevitable…
Machine learning methods based on normalizing flows have been shown to address important challenges, such as critical slowing-down and topological freezing, in the sampling of gauge field configurations in simple lattice field theories. A…
QCDLAB is a set of programs, written in GNU Octave, for lattice QCD computations. Version 2.0 includes the generation of configurations for the SU(3) theory, computation of rectangle Wilson loops as well as the low lying meson spectrum with…
We discuss the inclusion of fermionic loops contributions in Numerical Stochastic Perturbation Theory for Lattice Gauge Theories. We show how the algorithm implementation is in principle straightforward and report on the status of the…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
We briefly describe the Poor Man's Supercomputer (PMS) project carried out at Eotvos University, Budapest. The goal was to develop a cost effective, scalable, fast parallel computer to perform numerical calculations of physical problems…
In the field of High Performance Computing, communications among processes represent a typical bottleneck for massively parallel scientific applications. Object of this research is the development of a network interface card with specific…
Lattice QCD is notorious for its computational expense. Modern lattice simulations require large-scale computational resources to handle the large number of Dirac operator inversions used to construct correlation functions. Machine learning…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
We consider coupled waveguide lattices as an architecture that implement a wide range of multiport transformations. In this architecture, a particular transfer matrix is obtained through setting the step-wise profiles of the propagation…
The single-chip crosspoint-queued (CQ) switch is a compact switching architecture that has all its buffers placed at the crosspoints of input and output lines. Scheduling is also performed inside the switching core, and does not rely on…
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief Propagation Guided Decimation for finding satisfying…
Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence…
The determination of quark masses from lattice QCD simulations requires a non-perturbative renormalization procedure and subsequent scale evolution to high energies, where a conversion to the commonly used MS-bar scheme can be safely…
As quantum hardware increases in complexity, successful algorithmic execution relies more heavily on awareness of existing device constraints. In this work we focus on the problem of routing quantum information across the machine to…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
A previously introduced multi-boson technique for the simulation of QCD with dynamical quarks is described and some results of first test runs on a $6^3\times12$ lattice with Wilson quarks and gauge group SU(2) are reported.
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time.…
We describe the construction of a high performance parallel computer composed of PC components, present some physical results for light hadron and hybrid meson masses from lattice QCD. We also show that the smearing technique is very useful…