Related papers: On Two Methods for Quantitative Unique Continuatio…
We establish a unique continuation property for solutions of the differential inequality $|\nabla u|\leq V|u|$, where $V$ is locally $L^n$ integrable on a domain in $\mathbb R^n$. A stronger uniqueness result is obtained if in addition the…
In this paper, we focus on the analysis of discrete versions of the Calderon problem with partial boundary data in dimension d >= 3. In particular, we establish logarithmic stability estimates for the discrete Calderon problem on an…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
A new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of…
Kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same…
We find a minimal notion of non-degeneracy for bilinear singular integral operators $T$ and identify testing conditions on the multiplying function $b$ that characterize the $L^p\times L^q\to L^r,$ $1<p,q<\infty$ and $r>\frac{1}{2},$…
Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing…
Quantum linear-system algorithms (QLSAs) have rigorous worst-case complexity guarantees, but their runtimes are often chosen from spectral information assumed in advance. What is largely lacking is an a posteriori progress flag: most QLSA…
We propose a new analytical method to solve for nonexactly soluble Schrodinger equation via expansions through some existing quantum numbers. Successfully, it is applied to the rational non-polynomial oscillator potential. Moreover, a…
We present a new algorithm for solving linear-quadratic regulator (LQR) problems with linear equality constraints, also known as constrained LQR (CLQR) problems. Our method's sequential runtime is linear in the number of stages and…
Let $S_n f$ be the $n$th partial sum of the Fourier series of a function $f$ in $L^1(\D)$, where $\D$ is the ring of integers of a local field $K$. For $1<p<\infty$, we characterize all weight functions $w$ so that the partial sum operators…
Functional methods can be applied to the quantum effective action to efficiently determine counterterms and matching conditions for effective field theories. We extend the toolbox to two-loop order and beyond and show how to evaluate the…
This paper introduces a fast and numerically stable algorithm for the solution of fourth-order linear boundary value problems on an interval. This type of equation arises in a variety of settings in physics and signal processing. Our method…
In this paper we present the first steps for obtaining a discrete Quantum Mechanics making use of the Umbral Calculus. The idea is to discretize the continuous Schroedinger equation substituting the continuous derivatives by discrete ones…
A sequential quadratic programming (SQP) algorithm is designed for nonsmooth optimization problems with upper-C^2 objective functions. Upper-C^2 functions are locally equivalent to difference-of-convex (DC) functions with smooth convex…
This is a sequel to [1] and [2], which study the second boundary problem for special Lagrangian curvature potential equation. As consequences, we obtain the existence and uniqueness of the smooth uniformly convex solution by the method of…
We present and analyze two numerical methods for the logarithmic Schr{\"o}dinger equation (LogSE) consisting of a regularized splitting method and a regularized conservative Crank-Nicolson finite difference method (CNFD). In order to avoid…
Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\i lmaz 2014, arXiv:1411.7647). In this…
In this paper, we focus on the quantitative unique continuation property of solutions to \begin{equation*} \Delta^2u=Vu, \end{equation*} where $V\in W^{1,\infty}$. We show that the maximal vanishing order of the solutions is not large than…
Recently the Master Constraint Programme for Loop Quantum Gravity (LQG) was proposed as a classically equivalent way to impose the infinite number of Wheeler -- DeWitt constraint equations in terms of a single Master Equation. While the…