相关论文: Quantum basin hopping with gradient-based local op…

Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…

We present a quantum algorithm for solving perfect mazes by casting the pathfinding task as a structured search problem. Building on Grover's amplitude amplification, the algorithm encodes all candidate paths in superposition and evaluates…

We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by…

Theoretical design of global optimization algorithms can profitably utilize recent statistical mechanical treatments of potential energy surfaces (PES's). Here we analyze the basin-hopping algorithm to explain its success in locating the…

The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either…

Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand along search methods, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown that it is…

In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUBO with integer…

While a large number of algorithms for optimizing quantum dynamics for different objectives have been developed, a common limitation is the reliance on good initial guesses, being either random or based on heuristics and intuitions. Here we…

We exploit Grover operator of database search algorithm for weight decision algorithm. In this research, weight decision problem is to find an exact weight w from given two weights as w1 and w2 where w1+w2=1 and 0<w1<w2<1. Firstly, if a…

The searching efficiency of the quantum approximate optimization algorithm is dependent on both the classical and quantum sides of the algorithm. Recently a quantum approximate Bayesian optimization algorithm (QABOA) that includes two…

We propose an adaptive random quantum algorithm to obtain an optimized eigensolver. Specifically, we introduce a general method to parametrize and optimize the probability density function of a random number generator, which is the core of…

The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…

Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific…

We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for…

Stochastic Gradient Descent (SGD) and its variants underpin modern machine learning by enabling efficient optimization of large-scale models. However, their local search nature limits exploration in complex landscapes. In this paper, we…

Hybrid optimization algorithms have gained popularity as it has become apparent there cannot be a universal optimization strategy which is globally more beneficial than any other. Despite their popularity, hybridization frameworks require…

The Rodeo Algorithm is a quantum computing method for computing the energy spectrum of a Hamiltonian and preparing its energy eigenstates. We discuss how to improve the performance of the rodeo algorithm for each of these two applications.…

The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choices for the Hamiltonian can guarantee that the algorithm will…

It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is…

We propose a strategy to achieve the Grover search algorithm by adiabatic passage in a very efficient way. An adiabatic process can be characterized by the instantaneous eigenvalues of the pertaining Hamiltonian, some of which form a gap.…