Related papers: Experimental implementation of generalized Grover'…
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…
L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that…
We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the…
Amplification of a single spin state using nuclear magnetic resonance (NMR) techniques in a rotating frame is considered. The main aim is to investigate the efficient of various schemes for quantum detection. Results of numerical simulation…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
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 algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
In this article we consider an experimental study showing the influence of emotion regulation strategies on human memory performance: part of such experimental results are difficult to explain within a classic cognitive allocation model. We…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
Experimental implementation of a quantum algorithm requires unitary operator decomposition. Here we treat the unitary operator decomposition as an optimization problem and use Genetic Algorithm, a global optimization method inspired by…
We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present.…
We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…
Solving ground states of quantum many-body systems has been a long-standing problem in condensed matter physics. Here, we propose a new unsupervised machine learning algorithm to find the ground state of a general quantum many-body system…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the…
We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…