Related papers: An entanglement monotone derived from Grover's alg…
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the…
We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the…
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…
The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is…
We derive an explicit expression for geometric measure of entanglement for spin and other quantum system. A relation of entanglement in pure state with the mean value of spin is given, thus, at the experimental level the local measurement…
We examine how amplitude noise in queries to the oracle degrades a performance of quantum search algorithm. The Grover search and similar techniques are widely used in various quantum algorithms, including cases where rival parties are…
The "Power of One Qubit" refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is…
When some of the parties of a multipartite entangled pure state are lost, the question arises whether the residual mixed state is also entangled, in which case the initial entangled pure state is said to be robust against particle loss. In…
We propose a measurement-based method to produce a maximally-entangled state from a partially-entangled pure state. Our goal can be thought of as entanglement distillation from a single copy of a partially-entangled state. The present…
We define a set of $2^{n-1}-1$ entanglement monotones for $n$ qubits and give a single measure of entanglement in terms of these. This measure is zero except on globally entangled (fully inseparable) states. This measure is compared to the…
Maximal correlation is a measure of correlation for bipartite distributions. This measure has two intriguing features: (1) it is monotone under local stochastic maps; (2) it gives the same number when computed on i.i.d. copies of a pair of…
We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
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…
Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal…
Interaction with environment may lead to the transition of quantum system from pure state to the mixed one. In this case, the problem of definition of entanglement may arise. In particular, quantitative measure of entanglement concurrence…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Non-locality without entanglement is a rather counter-intuitive phenomenon in which information may be encoded entirely in product (unentangled) states of composite quantum systems in such a way that local measurement of the subsystems is…
Although entropy is a necessary and sufficient quantity to characterize the order of work content for equal energetic (EE) states in the asymptotic limit, for the finite quantum systems, the relation is not so linear and requires detail…
Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity. Thus, upon measurement, there is a…