Related papers: Grover's algorithm is an approximation of imaginar…
We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical…
In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers \sigma_{z} error with probability p (0\leq p\leq 1) independently at every step in…
This article highlights some of the key operating principles of Grover algorithm. These principles were used to develop a new oracle function, that illustrates the possibility of using Grover algorithm for solving more realistic and…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
The quantum imaginary time evolution (QITE) algorithm is a direct implementation of the classical imaginary time evolution algorithm on quantum computer. We implement the QITE algorithm for the case of nuclear Hartree-Fock equations in 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…
Grover's search algorithm provides a quadratic speedup over classical brute-force search in terms of query complexity and is widely used as a versatile subroutine in numerous quantum algorithms, including those for combinatorial problems…
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 Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimization problems. Specifically, the combination of Quantum…
We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously…
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter and…
A crucial yet challenging issue in quantum metrology is to ascertain the ultimate precision achievable in estimation strategies. While there are two paradigms of estimations, local and global, current research is largely confined to local…
An attempt has been made in this paper to modify Grover's Algorithm to find the binary string solutions approximating a target cost value. In that direction, new Controlled Oracle and the Local Diffusion Operator are suggested, apart from…
Amplitude amplification is a central tool used in Grover's quantum search algorithm and has been used in various forms in numerous quantum algorithms since then. It has been shown to completely eliminate one-sided error of quantum search…
We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
By allowing measurements of observables other than the state of the qubits in a quantum computer, one can find eigenvectors very quickly. If a unitary operation U is implemented as a time-independent Hamiltonian, for instance, one can…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…