相关论文: Generalization of Grover's Algorithm to Multiobjec…

Grover's algorithm is usually described in terms of the iteration of a compound operator of the form $Q = - H I_{0} H I_{x_0}$. Although it is quite straightforward to verify the algebra of the iteration, this gives little insight into why…

Quantum hardware continues to advance, yet finding new quantum algorithms - quantum software - remains a challenge, with classically trained computer programmers having little intuition of how computational tasks may be performed in the…

Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be…

We present in this work, if a set of well organized suboracles is available, an algorithm for multiobject search with certainty in an unsorted database of $N$ items. Depending on the number of the objects, the technique of phase tunning is…

In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational…

Quantum partial search algorithm is approximate search. It aims to find a target block (which has the target items). It runs a little faster than full Grover search. In this paper, we consider quantum partial search algorithm for multiple…

The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…

Quantum Information Theory promises to speed up computation so is observed in real quantum computers as proved to its classical counterpart. This revolutionizes every field linked directly or indirectly with computation. Grover algorithm in…

We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gained for searching unstructured lists. It yields a…

We demonstrated the detailed construction of the hybrid quantum-classical computer. Based on this architecture, the useful concept of amplitude interception is illustrated. It is then embedded into a combination of Depth-First Search and…

Distributed quantum computation has garnered immense attention in the noisy intermediate-scale quantum (NISQ) era, where each computational node necessitates fewer qubits and quantum gates. In this paper, we focus on a generalized search…

We question whether the measurement based quantum computing algorithm is in fact Grover's algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4…

Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…

Searching a database is a central task in computer science and is paradigmatic of transport and optimization problems in physics. For an unstructured search, Grover's algorithm predicts a quadratic speedup, with the search time…

In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system ({\it Partial Diffusion Operator}) to propose a quantum search algorithm runs in $O(\sqrt N/M})$ for…

We propose a simple design of a quantum electron microscope that ``queries'' a beam-sensitive phase object, such as a biological specimen, as part of quantum computation. Lower quantum query complexity, not the time complexity, of a quantum…

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…

Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…

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…

A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a…