Related papers: Complex Neumann Problem and Kohn's Algorithm
Nonlinear elliptic Neumann problems, possibly in irregular domains and with data affected by low integrability properties, are taken into account. Existence, uniqueness and continuous dependence on the data of generalized solutions are…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
We extend the semiclassical study of the Neumann model down to the deep quantum regime. A detailed study of connection formulae at the turning points allows to get good matching with the exact results for the whole range of parameters.
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
We propose a new approach to discretize the von Neumann equation, which is efficient in the semi-classical limit. This method is first based on the so called Weyl's variables to address the stiffness associated with the equation. Then, by…
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
Newman-Janis algorithm for Kerr-Newman geometry is reanalyzed in the light of Cartan calculus.
Nodal solutions of a parametric (p_1,p_2)-Laplacian system, with Neumann boundary conditions, are obtained by chiefly constructing appropriate sub-super-solution pairs.
In this paper we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type $M(\lambda)v=0$, where $M:\mathbb{C}\rightarrow\mathbb{C}^{n\times n}$ is a holomorphic function. We investigate which types of approximations…
A fast and accurate algorithm for the computation of Gauss-Hermite and generalized Gauss-Hermite quadrature nodes and weights is presented. The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and…
The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
In this paper we study the Neumann problem for a type of fully nonlinear second order elliptic partial differential equations on domains in $\mathbb{C}^{n}$ without any curvature assumptions on the domain.
We present a novel quantum algorithm for classification of images. The algorithm is constructed using principal component analysis and von Neuman quantum measurements. In order to apply the algorithm we present a new quantum representation…
The Koopman-von Neumann (KvN) formulation brings classical mechanics to Hilbert space, but many techniques familiar from quantum mechanics remain missing. One would hope to solve eigenvalue problems, obtain orthonormal eigenstates of…
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.