相关论文: Rigorous Perturbation Bounds for the QX Decomposit…

We prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary "off the grid" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the…

We consider the problem of providing optimal uncertainty quantification (UQ) --- and hence rigorous certification --- for partially-observed functions. We present a UQ framework within which the observations may be small or large in number,…

The parametrisation method for invariant manifolds is a powerful technique for deriving reduced-order models in the context of nonlinear vibrating systems, allowing accurate computations of nonlinear normal modes. Thanks to arbitrary order…

Using the worldline method, we derive an effective action of the bosonic sector of the Standard Model by integrating out the fermionic degrees of freedom. The CP violation stemming from the complex phase in the CKM matrix gives rise to…

In this paper, balancing based model order reduction (MOR) for large-scale linear discrete-time time-invariant systems in prescribed finite time intervals is studied. The first main topic is the development of error bounds regarding the…

A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…

This paper develops and analyzes a new algorithm for QR decomposition with column pivoting (QRCP) of rectangular matrices with many more rows than columns. The algorithm carefully combines methods from randomized numerical linear algebra to…

We consider the computation of roots of polynomials expressed in the Chebyshev basis. We extend the QR iteration presented in [Eidelman, Y., Gemignani, L., and Gohberg, I., Numer. Algorithms, 47.3 (2008): pp. 253-273] introducing an…

We prove $k_T$ factorization theorem in perturbative QCD (PQCD) for exclusive processes by considering $\pi\gamma^*\to \gamma(\pi)$ and $B\to\gamma(\pi) l\bar\nu$. The relevant form factors are expressed as the convolution of hard…

Characterizing and calibrating physical qubits is essential for maintaining the performance of quantum processors. A key challenge in this process is the presence of crosstalk that complicates the estimation of individual qubit detunings.…

In this work, we give a detailed discussion for QCD factorization involved the complete chirally enhanced power corrections for B decays to two light pseudoscalar mesons, and present some detailed calculations of radiative corrections at…

In this paper, we introduce a novel and robust approach to Quantized Matrix Completion (QMC). First, we propose a rank minimization problem with constraints induced by quantization bounds. Next, we form an unconstrained optimization problem…

The availability of a reliable bound on an integral involving the square of the modulus of a form factor on the unitarity cut allows one to constrain the form factor at points inside the analyticity domain and its shape parameters, and also…

This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimensional domain. An…

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

Quantum periodic cluster methods for strongly correlated electron systems are reformulated and developed. The reformulation and development are based on a canonical transformation which periodizes the fermions in the cluster space. The…

We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…

We present relaxed criteria for quantum error correction which are useful when the specific dominant noise process is known. These criteria have no classical analogue. As an example, we provide a four-bit code which corrects for a single…

We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact…

In this paper, we concentrate on the backward error and condition number of the indefinite least squares problem. For the normwise backward error of the indefinite least square problem, we adopt the linearization method to derive the tight…