Related papers: Phase diagram for the Grover algorithm with static…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
In near-term quantum computations that do not employ error correction, noise can proliferate rapidly, corrupting the quantum state and making results unreliable. These errors originate from both decoherence and control imprecision. The…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the…
Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing…
An error avoiding quantum code is presented which is capable of stabilizing Grover's quantum search algorithm against a particular class of coherent errors. This error avoiding code consists of states only which are factorizable in the…
We study how probes of quantum scrambling dynamics respond to two kinds of imperfections -- unequal forward and backward evolutions and decoherence -- in a solvable Brownian circuit model. We calculate a ``renormalized'' out-of-time-order…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…
Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum…
Grover's quantum search algorithm is analyzed for the case in which the initial state is an arbitrary pure quantum state $|\phi>$ of $n$ qubits. It is shown that the optimal time to perform the measurement is independent of $| \phi>$,…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these…
Here we suggest a modification of Grover's algorithm, based on a multiphase oracle which marks each solution with a different phase when there is more than one solution. Such a modification can be used to maintain a high probability of…
Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
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,…
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain…
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
We investigate the performance of Grover's algorithm on three different generations of IBM Heron QPUs. On Heron family of IBM QPUs the success probabilities for three, four and five qubits without dynamical decoupling is better than results…
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…