Related papers: PC Clusters for Lattice QCD
Quantum computing resources are among the most promising candidates for extending the computational capabilities of High-Performance Computing (HPC) systems. As a result, HPC-quantum integration has become an increasingly active area of…
We present a linked-cluster technique for calculating the distance of a quantum LDPC code. It offers an advantage over existing deterministic techniques for codes with small relative distances (which includes all known families of quantum…
High Performance Computing (HPC) clouds are becoming an alternative to on-premise clusters for executing scientific applications and business analytics services. Most research efforts in HPC cloud aim to understand the cost-benefit of…
We demonstrate that lattice QCD calculations can be made $10^3$--$10^6$ times faster by using very coarse lattices. To obtain accurate results, we replace the standard lattice actions by perturbatively-improved actions with tadpole-improved…
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses…
Cloud computing is an established technology allowing users to share resources on a large scale, never before seen in IT history. A cloud system connects multiple individual servers in order to process related tasks in several environments…
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite…
The substantial progress that has been achieved in lattice QCD in the last years is pointed out. I compare the simulation cost and systematic effects of several lattice QCD formulations and discuss a number of topics such as lattice spacing…
Recently, coding has been a useful technique to mitigate the effect of stragglers in distributed computing. However, coding in this context has been mainly explored under the assumption of homogeneous workers, although the real-world…
Faster, cheaper, and more power efficient optimization solvers than those currently offered by general-purpose solutions are required for extending the use of model predictive control (MPC) to resource-constrained embedded platforms. We…
Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well,…
Modern high-performance computing architectures (Multicore, GPU, Manycore) are based on tightly-coupled clusters of processing elements, physically implemented as rectangular tiles. Their size and aspect ratio strongly impact the achievable…
We develop a numerical linked cluster expansion (NLCE) method that can be applied directly to inhomogeneous systems, for example Hamiltonians with disorder and dynamics initiated from inhomogeneous initial states. We demonstrate the method…
In online unit clustering, points of a metric space arriving one by one must be partitioned into clusters of diameter at most 1, where the cost is the number of clusters. This paper gives linear upper and lower bounds on the advice…
Picker-to-parts pallet warehouses often face inefficiencies due to conventional layouts causing excessive travel distances and high labor requirements. This study introduces a novel layout design inspired by CPU architecture, partitioning…
By trapping cold polarizable atoms in periodic potentials created by crossed laser beams, it is now possible to experimentally create "clean" lattice systems. Experimentalists have successfully engineered local and nearest-neighbor…
Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each ``generation'' in a breadth first search. This applies directly to, e.g., the {\it single cluster} variant of the…
The lattice gauge theory technique for non-perturbative calculations in QCD is reviewed. The extraction of the continuum limit of lattice results is discussed with particular examples appropriate to hadron spectroscopy (the light hadrons…
This is the report of the Computing Frontier working group on Lattice Field Theory prepared for the proceedings of the 2013 Community Summer Study ("Snowmass"). We present the future computing needs and plans of the U.S. lattice gauge…
The coupled cluster method has been applied to the eigenvalue problem lattice Hamiltonian QCD (without quarks) for SU(2) gauge fields in two space dimensions. Using a recently presented new formulation and the truncation prescription of Guo…