Related papers: Convergence properties of fixed-point search with …
A general quantum search algorithm aims to evolve a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$. It uses a diffusion operator $D_{s}$ having source state as one of its eigenstates and $I_{t}$,…
When applying Grover's algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. To amend the limitation, numbers of improved schemes are proposed. In this paper,…
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that…
Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers (ADMM), can be formulated as averaged iteration of a…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP…
An algorithm is proposed for generalized mean curvature flow of closed two-dimensional surfaces, which include inverse mean curvature flow, powers of mean and inverse mean curvature flow, etc. Error estimates are proven for semi- and full…
We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…
The conjugate phase retrieval problem concerns the determination of a complex-valued function, up to a unimodular constant and conjugation, from its magnitude observations. It can also be considered as a conjugate phaseless sampling and…
In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal…
Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an…
When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same…
Recent attempts at introducing rotation invariance or equivariance in 3D deep learning approaches have shown promising results, but these methods still struggle to reach the performances of standard 3D neural networks. In this work we study…
While numerous extensions of Banach's fixed point theorem typically offer only sufficient conditions for the existence and uniqueness of a fixed point and the convergence of iterative sequences, this study introduces a generalization…
We study the convergence of stochastic fixed point iterations in the consistent case (in the sense of Butnariu and Fl{\aa}m (1995)) in several different settings, under decreasingly restrictive regularity assumptions of the fixed point…
Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algorithm does not work as intended and does not give any clue…
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…
We generalize the notion of relative phase to completely positive maps with known unitary representation, based on interferometry. Parallel transport conditions that define the geometric phase for such maps are introduced. The interference…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…