Related papers: Double-pass variants for multi-shift BiCGstab(ell)
We are interested in a new kind of bi-dimensional bilinear paraproducts (appearing in [6]), which do not fit into the setting of bilinear Calder\'on-Zygmund operators. In this paper we propose a fiber-wise Calder\'on-Zygmund decomposition,…
Signature-based algorithms have brought large improvements in the performances of Gr\"obner bases algorithms for polynomial systems over fields. Furthermore, they yield additional data which can be used, for example, to compute the module…
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of…
An algorithm for the numerical inversion of large matrices, the biconjugate gradient algorithm (BGA), is investigated in view of its use for Monte Carlo simulations of fermionic field theories. It is compared with the usual conjugate…
Many Krylov subspace methods for shifted linear systems take advantage of the invariance of the Krylov subspace under a shift of the matrix. However, exploiting this fact in the non-Hermitian case introduces restrictions; e.g., initial…
We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov…
A crucial requirement for quantum information processing is the realization of multiple-qubit quantum gates. Here, we demonstrate an electron spin based all-electrical two-qubit gate consisting of single spin rotations and inter-dot spin…
We introduce a performance-optimized method to simulate localization problems on bipartite tight-binding lattices. It combines an exact renormalization group step to reduce the sparseness of the original problem with the recursive Green's…
An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…
Grover's search algorithms, including various partial Grover searches, experience scaling problems as the number of iterations rises with increased qubits, making implementation more computationally expensive. This paper combines Partial…
We introduce a mutation algorithm for puzzles that is a three-direction analogue of the classical jeu de taquin algorithm for semistandard tableaux. We apply this algorithm to prove our conjectured puzzle formula for the equivariant…
We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…
A few years ago, Kurzweil and Hazak developed the Configurationally Resolved Super-Transition-Arrays (CRSTA) method for the computation of hot-plasma radiative opacity. Their approach, based on a temporal integration, is an important…
In this paper, we show almost-Gelfand property of connected symmetric pairs (G, H) over finite fields of large characteristics. We will show almost-\sigma-invariant property of double coset H\G/H where \sigma is the associated…
The FC-Gram trigonometric polynomial approximation of a non-periodic function that interpolates the function on equispaced grids was introduced in 2010 by Bruno and Lyon [J. Comput. Phys, 229(6):2009-2033, 2010]. Since then, the…
Standard QCD resummation techniques provide precise predictions for the spectrum and the cumulant of a given observable. The integrated spectrum and the cumulant differ by higher-order terms which, however, can be numerically significant.…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is the splitting of the pseudo-fermion action into two parts. We test…
We study equivariant operations on the periodic cyclic homology of a dg algebra that arise from the chain level action of the two-colored Kontsevich-Soibelman operad. Using classical computations of Cohen [Coh], we explicitly compute a set…
Here we propose a new nonparametric framework for two-sample testing, named as the OVL-$q$ ($q = 1, 2, \ldots$). This can be regarded as a natural extension of the Smirnov test, which is equivalent to the OVL-1. We specifically focus on the…
In this paper, we describe and establish iteration-complexity of two accelerated composite gradient (ACG) variants to solve a smooth nonconvex composite optimization problem whose objective function is the sum of a nonconvex differentiable…