Related papers: Further results on the real cubic truncated moment…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games. Under described certain assumptions, we show that the exact solution of the subset sum…
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…
I discuss computational challenges in the relativistic few-nucleon problem and the resolution of some of these challenges. I also discuss the outlook for the future.
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
In view of the usefulness and importance of the kinetic equation in certain physical problems, the authors derive the explicit solution of a fractional kinetic equation of general character, that unifies and extends earlier results.…
We propose a new approach to solve an NP complete problem by means of stochastic limit.
Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this, and find that it can be formulated in terms of what we call…
We propose convex optimization algorithms to recover a good approximation of a point measure $\mu$ on the unit sphere $S\subseteq \mathbb{R}^n$ from its moments with respect to a set of real-valued functions $f_1,\dots, f_m$. Given a finite…
We consider a non-polynomial cubic spline to develop the classes of methods for the numerical solution of singularly perturbed two-point boundary value problems. The proposed methods are second and fourth order accurate and applicable to…
In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…
We consider quantum algorithms for the unique sink orientation problem on cubes. This problem is widely considered to be of intermediate computational complexity. This is because there no known polynomial algorithm (classical or quantum)…
We present an approach to characterize genuine multiparticle entanglement using appropriate approximations in the space of quantum states. This leads to a criterion for entanglement which can easily be calculated using semidefinite…
The time dependent complex Schr\"odinger equation with cubic nonlinearity is solved by constructing differential quadrature algorithm based on sinc functions. Reduction to a coupled system of real equations enables to approach the space…
With the advent of quantum computers, researchers are exploring if quantum mechanics can be leveraged to solve important problems in ways that may provide advantages not possible with conventional or classical methods. A previous work by…
New Strichartz estimates for the modulated cubic nonlinear Schr\"{o}dinger equation are proved. These Strichartz estimates allow us to show that this equation is pathwise locally well-posed. We also show that improved Strichartz estimates…
A question of the time the system spends in the specified state, when the final state of the system is given, is raised. The model of weak measurements is used to obtain the expression for the time. The conditions for determination of such…
We present a panoramic view on various attempts to "solve" the problems of quantum measurement and macro-objectivation, i.e. of the transition from a probabilistic quantum mechanic microscopic world to a deterministic classical macroscopic…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
We discuss a new approach to solve the low lying states of the Schroedinger equation. For a fairly large class of problems, this new approach leads to convergent iterative solutions, in contrast to perturbative series expansions. These…