Search results for "Quadratic growth"

Quantum walk on the line through potential barriers

2015

Quantum walks are well-known for their ballistic dispersion, traveling $\Theta(t)$ away in $t$ steps, which is quadratically faster than a classical random walk's diffusive spreading. In physical implementations of the walk, however, the particle may need to tunnel through a potential barrier to hop, and a naive calculation suggests this could eliminate the ballistic transport. We show by explicit calculation, however, that such a loss does not occur. Rather, the $\Theta(t)$ dispersion is retained, with only the coefficient changing, which additionally gives a way to detect and quantify the hopping errors in experiments.

Reply to 'The super-quadratic growth of high-harmonic signal as a function of pressure'

2010

A Quasilinear Parabolic Equation with Quadratic Growth of the Gradient modeling Incomplete Financial Markets

2004

We consider a quasilinear parabolic equation with quadratic gradient terms. It arises in the modeling of an optimal portfolio which maximizes the expected utility from terminal wealth in incomplete markets consisting of risky assets and non-tradable state variables. The existence of solutions is shown by extending the monotonicity method of Frehse. Furthermore, we prove the uniqueness of weak solutions under a smallness condition on the derivatives of the covariance matrices with respect to the solution. The in influence of the non-tradable state variables on the optimal value function is illustrated by a numerical example.

Quadratically Tight Relations for Randomized Query Complexity

2020

In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R(f). The certificate complexity C(f) is such a complexity measure for the zero-error randomized query complexity R0(f): C(f) ≤R0(f) ≤C(f)2. In the first part of the paper we introduce a new complexity measure, expectational certificate complexity EC(f), which is also a quadratically tight bound on R0(f): EC(f) ≤R0(f) = O(EC(f)2). For R(f), we prove that EC2/3 ≤R(f). We then prove that EC(f) ≤C(f) ≤EC(f)2 and show that there is a quadratic separation between the two, thus EC(f) gives a tighter upper bound for R0(f). The measure is also related to the fractional…

Quasilinear elliptic equations with singular quadratic growth terms

2011

In this paper, we deal with positive solutions for singular quasilinear problems whose model is [Formula: see text] where Ω is a bounded open set of ℝN, g ≥ 0 is a function in some Lebesgue space, and γ > 0. We prove both existence and nonexistence of solutions depending on the value of γ and on the size of g.

A black-box, general purpose quadratic self-consistent field code with and without Cholesky Decomposition of the two-electron integrals

2021

We present the implementation of a quadratically convergent self-consistent field (QCSCF) algorithm based on an adaptive trust-radius optimisation scheme for restricted open-shell Hartree���Fock (ROHF), restricted Hartree���Fock (RHF), and unrestricted Hartree���Fock (UHF) references. The algorithm can exploit Cholesky decomposition (CD) of the two-electron integrals to allow calculations on larger systems. The most important feature of the QCSCF code lies in its black-box nature ��� probably the most important quality desired by a generic user. As shown for pilot applications, it does not require one to tune the self-consistent field (SCF) parameters (damping, Pulay's DIIS, and other simil…