Related papers: Message passing on the QCDSP supercomputer
Quantum state transfer (QST) describes the coherent passage of quantum information from one node in a network to another. Experiments on QST span a diverse set of platforms and currently report transport across up to tens of nodes in times…
We present a complete set of Fortran 90 modules that can be used to write very compact, efficient, and high level QCD programs. The modules define fields (gauge, fermi, generators, complex, and real fields) as abstract data types, together…
We report about on-going simulations of $N_f=2+1$ lattice QCD. We use a tadpole improved Symanzik gauge action and stout link smeared Wilson fermions with a clover term. We employ the Hasenbusch trick for the degenerate u- and d-quarks, and…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
We present a principled and efficient planning algorithm for collaborative multiagent dynamical systems. All computation, during both the planning and the execution phases, is distributed among the agents; each agent only needs to model and…
We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast…
New advanced applications, such as autonomous driving and haptic communication, require to transmit multi-sensory data and require low latency and high reliability. These applications include. Existing implementations for such services have…
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…
Lattice gauge theories describe fundamental phenomena in nature, but calculating their real-time dynamics on classical computers is notoriously difficult. In a recent publication [Nature 534, 516 (2016)], we proposed and experimentally…
We present two experimental schemes that can be used to implement the Factorized Quantum Lattice-Gas Algorithm for the 1D Diffusion Equation with Persistent-Current Qubits. One scheme involves biasing the PC Qubit at multiple flux bias…
This paper studies a $K$-user lattice-code based multiple-access (LCMA) scheme. Each user equipment (UE) encode its message with a practical lattice code, where we suggest a $2^m$-ary \emph{ring code} with symbol-wise bijective mapping to…
Realizing distributed architectures for quantum computing is crucial to scaling up computational power. A key component of such architectures is a scheduler that coordinates operations over a short-range quantum network required to enable…
We develop a message-passing algorithm for noisy matrix completion problems based on matrix factorization. The algorithm is derived by approximating message distributions of belief propagation with Gaussian distributions that share the same…
Quantum Fourier transform (QFT) is a widely used building block for quantum algorithms, whose scalable implementation is challenging in experiments. Here, we propose a protocol of quadratic quantum Fourier transform (QQFT), considering cold…
We present a simple mathematical framework and API for parallel mesh and data distribution, load balancing, and overlap generation. It relies on viewing the mesh as a Hasse diagram, abstracting away information such as cell shape,…
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly…
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another.…
We investigate the computational efficiency of two stochastic based alternatives to the Sequential Propagator Method used in Lattice QCD calculations of heavy-light semileptonic form factors. In the first method, we replace the sequential…
Lattice QCD calculations using gauge smearing for fermion kernels are computationally efficient. Hypercubic blocking (nHYP smearing) has been shown to reduce scaling errors. In this work we use an improved action for $N_f=2$ QCD, based on…
The lattice technique of studying the strong interaction of matter is used to obtain predictions of the hadronic spectrum. These simulations were performed by the UKQCD collaboration using full (unquenched) QCD. Details of the results, a…