相关论文: Noisy Grover's search algorithm
Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever) explanation of why living organisms have 4…
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 dynamics of quantum systems are unavoidably influenced by their environment and in turn observing a quantum system (probe) can allow one to measure its environment: Measurements and controlled manipulation of the probe such as dynamical…
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…
We present theoretical results in terms of lower and upper bounds on the query complexity of noisy search with comparative feedback. In this search model, the noise in the feedback depends on the distance between query points and the search…
In this work, we present a quantum query algorithm for searching a word of length $m$ in an unsorted dictionary of size $n$. The algorithm uses $O(\sqrt{n})$ queries (Grover operators), like previously known algorithms. What is new is that…
Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…
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…
We study the quantum search algorithm as an open system. More specifically, we analyze the responses of that algorithm to an external monochromatic field, and to the decoherences introduced by the measurement process. We find that the…
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can…
We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi, Kempe and Whaley. We show that there exists a whole class of quantum search algorithms in the symmetry reduced…
In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was…
We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the…
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions of the base algorithms and with high probability finds the…
On thinking of a Grover-type quantum search algorithm for an ordered tuple of multi-qubit states, a gradient system associated with the negative von-Neumann entropy is studied on the space of regular relative-configurations of multi-qubit…
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the…
Grover's algorithm is a well-known unstructured quantum search algorithm run on quantum computers. It constructs an oracle and calls the oracle O($\sqrt N$) times to locate specific data out of N unsorted data. This represents a quadratic…
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…
This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely,…
In this paper, we study decoherence in Grover's quantum search algorithm using a perturbative method. We assume that each two-state system (qubit) that belongs to a register suffers a phase flip error (\sigma_{z} error) with probability p…