Related papers: Block Algorithms for Quark Propagator Calculation
Multigrid methods were invented for the solution of discretized partial differential equations in ordered systems. The slowness of traditional algorithms is overcome by updates on various length scales. In this article we discuss…
This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation…
Molecular simulations are widely regarded as leading candidates to demonstrate quantum advantage--defined as the point at which quantum methods surpass classical approaches in either accuracy or scale. Yet the qubit counts and error rates…
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…
A numerical simulation algorithm for lattice QCD is described, in which the short- and long-distance effects of the sea quarks are treated separately. The algorithm can be regarded, to some extent, as an implementation at the quantum level…
Randomized Kaczmarz-type methods are widely used for their simplicity and efficiency in solving large-scale linear systems and optimization problems. However, their applicability is limited when dealing with inconsistent systems or…
Reconciliation is a crucial procedure in post-processing of Quantum Key Distribution (QKD), which is used for correcting the error bits in sifted key strings. Although most studies about reconciliation of QKD focus on how to improve the…
The computation of approximating e^tA B, where A is a large sparse matrix and B is a rectangular matrix, serves as a crucial element in numerous scientific and engineering calculations. A powerful way to consider this problem is to use…
We investigate an alternative to the Sequential Propagator Method used in Lattice QCD calculations of semileptonic form factors. We replace the sequential propagator with a stochastic propagator so that, in principle, all momentum and sink…
Block iterative methods are extremely important as smoothers for multigrid methods, as preconditioners for Krylov methods, and as solvers for diagonally dominant linear systems. Developing robust and efficient algorithms suitable for…
The structure of the quark propagator of $QCD$ in a confining background is not known. We make an Ansatz for it, as hinted by a particular mechanism for confinement, and analyze its implications in the meson and baryon correlators. We…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…
Block-structured integer linear programs (ILPs) play an important role in various application fields. We address $n$-fold ILPs where the matrix $\mathcal{A}$ has a specific structure, i.e., where the blocks in the lower part of…
High dimensional unconstrained quadratic programs (UQPs) involving massive datasets are now common in application areas such as web, social networks, etc. Unless computational resources that match up to these datasets are available, solving…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present iterative Krylov subspace approximations, with deflation of critical…
We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum…
We investigate the application of Krylov space methods to the solution of shifted linear systems of the form (A+\sigma) x - b = 0 for several values of \sigma simultaneously, using only as many matrix-vector operations as the solution of a…
Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amount to well-known Krylov schemes that have been equipped with…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
We have investigated a closed set of equations for the quark propagator, which has been obtained earlier within a new, nonperturbative approach to two-dimencional covariant gauge QCD. It is shown that this theory implies quark confinement…