Related papers: Quantum Search Algorithm for Binary Constant Weigh…
In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of…
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…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
In the era of quantum computing, the emergence of quantum computers and subsequent advancements have led to the development of various quantum algorithms capable of solving linear equations and eigenvalues, surpassing the pace of classical…
Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves transforming the optimization problem into a quadratic…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems…
Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database…
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA). We present 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…
Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity represented by a basis state in the…
In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Grover search is a renowned quantum search algorithm that leverages quantum superposition to find a marked item with quadratic speedup. However, when implemented on Noisy Intermediate-scale Quantum (NISQ) hardware, the required repeated…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…
An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate…