Related papers: Message passing on the QCDSP supercomputer
The robotic assembly task poses a key challenge in building generalist robots due to the intrinsic complexity of part interactions and the sensitivity to noise perturbations in contact-rich settings. The assembly agent is typically designed…
We propose a numerical method of estimating various physical quantities in lattice (supersymmetric) quantum mechanics. The method consists only of deterministic processes such as computing a product of transfer matrix, and has no…
We design a dynamically-weighted state-averaged constrained CASSCF to treat \ul{e}lectrons or \ul{h}oles moving between $n$ molecular fragments (where $n$ can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider…
The search for new physics requires a joint experimental and theoretical effort. Lattice QCD is already an essential tool for obtaining precise model-free theoretical predictions of the hadronic processes underlying many key experimental…
Superconducting quantum circuits are a key platform for advancing quantum information processing and simulation. Scaling efforts currently encounter challenges such as Josephson-junction fabrication yield, design frequency targeting, and…
Lattice simulations of hadronic structure are now reaching a level where they are able to not only complement, but also provide guidance to current and forthcoming experimental programmes at, e.g. Jefferson Lab, COMPASS/CERN and FAIR/GSI.…
In this paper, we study a compute-and-forward (CAF) relaying scheme with low-density parity-check (LDPC) codes, a special case of physical layer network coding, under the quadrature phase shift keying (QPSK) modulation. The novelty of this…
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses…
We describe how we have used simultaneously ${\cal O}(10^3)$ nodes of the EGEE Grid, accumulating ca. 300 CPU-years in 2-3 months, to determine an important property of Quantum Chromodynamics. We explain how Grid resources were exploited…
Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals…
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation…
Quantum simulations of many-body systems offer novel methods for probing the dynamics of the Standard Model and its constituent gauge theories. Extracting low-energy predictions from such simulations rely on formulating…
Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical…
Due to its attractive properties, generalized frequency division multiplexing (GFDM) is recently being discussed as a candidate waveform for the fifth generation of wireless communication systems (5G). GFDM is introduced as a generalized…
An overarching goal in the flourishing field of quantum simulation for high-energy physics is the first-principles study of the microscopic dynamics of scattering processes on a quantum computer. Currently, this is hampered by small system…
We consider some aspects of a standard model employed in studies of many-body localization: interacting spinless fermions with quenched disorder, for non-zero filling fraction, here on $d$-dimensional lattices. The model may be recast as an…
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…
Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication complexity of computations. This paper presents a lower…
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal…