相关论文: Rigorous Perturbation Bounds for the QX Decomposit…
The issue of Lorentz fine-tuning in effective theories containing higher-order operators is studied. To this end, we focus on the Myers-Pospelov extension of QED with dimension-five operators in the photon sector and standard fermions. We…
In this study linear and nonlinear higher order singularly perturbed problems are examined by a numerical approach, the differential quadrature method. Here, the main idea is using Chebyshev polynomials to acquire the weighting coefficient…
We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling…
In this paper we prove complex bounds, also referred to as a priori bounds, for real analytic (and even C3) interval maps. This means that we associate to such a map a complex box mapping (which provides a kind of Markov structure),…
For real matrices of full column-rank, we analyze the conditioning of several types of normal equations that are preconditioned by a randomized preconditioner computed in lower precision. These include symmetrically preconditioned normal…
We calculate the branching ratio and $CP$ violations for $B\to K\pi$ decays in a modified perturbative QCD approach based on $k_{T}$ factorization. The resummation effect of the transverse momentum regulates the endpoint singularity. Using…
We provide efficient and intuitive tools for deriving bounds on achievable precision in quantum enhanced metrology based on the geometry of quantum channels and semi-definite programming. We show that when decoherence is taken into account,…
We review our work on computations of the quantum corrections to the mass and the central charge of the susy kink. For the mass corrections, we find that the widely used momentum cut-off scheme gives an incorrect result, but we deduce…
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with polynomially bounded parameter value can express the…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
Since b quark mass is not asymptotically large, chirally enhanced corrections which arise from twist-3 wave functions may be important in B decays. We thus evaluate the hadronic matrix elements with the final light pseudoscalar mesons…
We study the radiative decay B -> gamma l nu_l in the framework of QCD factorization. We demonstrate explicitly that, in the heavy-quark limit and at one-loop order in perturbation theory, the amplitude does factorize, i.e. that it can be…
By expanding functions of parton fragmentation into a heavy hadron in the inverse of the heavy quark mass $m_Q$ we attempt to factorize them into perturbative- and nonperturbative parts. In our approach the nonperturbative parts can be…
Quenched chiral perturbation theory is extended to include heavy-light mesons. Non-analytic corrections to the decay constants, Isgur-Wise function and masses and mixing of heavy mesons are then computed. The results are used to estimate…
Using methods of effective field theory, a systematic analysis of the fragmentation functions D_{a/H}(x,m_Q) of a hadron H containing a heavy quark Q is performed (with a=Q,Q_bar,q,q_bar,g). By integrating out pair production of virtual and…
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting…
QR factorisation plays an important role in matrix computations. Within the context of optimisation and of automatic differentiation of such computations, we need to compute the derivative of this factorisation. For tall matrices, however,…
The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…