Evaluating the expectation of a quantum circuit is classically difficult problem known as mean value (QMV). It used to optimize approximate optimization algorithm and other variational eigensolvers. We show that such an can be improved substantially by using approximation rather than exact expectation. Together with efficient classical sampling algorithms, minimal gate count thus improve effici...

in this paper, we present a new two-step trigonometrically fitted symmetric obrechkoff method. the method is based on the symmetric two-step obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve ivps with periodic solutions such as orbital problems. we compare the new method to some recently constructed optimized methods from the literature. the numeri...

in this paper, a chebyshev finite difference method has been proposed in order to solvenonlinear two-point boundary value problems for second order nonlinear differentialequations. a problem arising from chemical reactor theory is then considered. the approachconsists of reducing the problem to a set of algebraic equations. this method can be regardedas a non-uniform finite difference scheme. t...

in this paper, boundary value problems of fractional order are converted into an optimal control problems. then an approximate solution is constructed from translations and dilations of a b-spline function such that the exact boundary conditions are satisfied. the fractional differential operators are taken in the riemann-liouville and caputo sense. several example are given and the optimal err...

in this work, we study the performance of the sinc-collocation method for solving bratu's problem. for different choices of step size, we consider the maximum absolute errors in the solutions at sinc grid points and tabulated in tables. the comparison of the obtained results veri ed that this method converges to the exact solution rapidly and with

this article is devoted to the study of existence and multiplicity of positive solutions to aclass of nonlinear fractional order multi-point boundary value problems of the type−dq0+u(t) = f(t, u(t)), 1 < q ≤ 2, 0 < t < 1,u(0) = 0, u(1) =m−2∑ i=1δiu(ηi),where dq0+ represents standard riemann-liouville fractional derivative, δi, ηi ∈ (0, 1) withm−2∑i=1δiηi q−1 < 1, and f : [0, 1] × [0, ∞) → [0, ∞...

The Constraint Based Decomposition (CBD) is a constructive neural network technique that builds a three or four layer network, has guaranteed convergence and can deal with binary, n-ary, class labeled and real-value problems. CBD is shown to be able to solve complicated problems in a simple, fast and reliable manner. The technique is further enhanced by two modifications (locking detection and ...