Related papers: The Groverian Measure of Entanglement for Mixed St…
In a recent paper it has been shown how to create a quantum state related to the prime number sequence using Grover's algorithm. Moreover, its multiqubit entanglement was analyzed. In the present work, we compare the multiqubit entanglement…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
The geometric measure of entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with…
Maximally entangled mixed states are those states that, for a given mixedness, achieve the greatest possible entanglement. For two-qubit systems and for various combinations of entanglement and mixedness measures, the form of the…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…
We describe an entanglement purification protocol to generate maximally entangled states with high efficiencies from two-mode squeezed states or from mixed Gaussian continuous entangled states. The protocol relies on a local quantum…
Bounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for…
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…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Measuring entanglement is a demanding task in the field of quantum computation and quantum information theory. Recently, some authors experimentally demonstrated an embedding quantum simulator, using it to efficiently measure two-qubit…
We give an explicit expression for the geometric measure of entanglement for three qubit states that are linear combinations of four orthogonal product states. It turns out that the geometric measure for these states has three different…
The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by…
We propose a directly measurable criterion for the entanglement of two qubits. We compare the criterion with other criteria, and we find that for pure states, and some mixed states, it coincides with the state's concurrency. The measure can…
Concurrence introduced by Hill and Wootters [Phys. Rev. Lett. 78, 5022 (1997)], provides an important measure of entanglement for a general pair of qubits that is strictly positive entangled states and vanishes for all separable states. We…
We analyze the role played by entanglement in the dynamical evolution of Grover's search algorithm in the space of qubits. We show that the algorithm can be equivalently described as an iterative change of the entanglement between the…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
We propose that the entanglement of mixed states is characterised properly in terms of a probability density function $\mathcal{P}(\mathcal{E})$. There is a need for such a measure since the prevalent measures (such as \textit{concurrence}…
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a…
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.…
A new method is developed to derive an algebraic equations for the geometric measure of entanglement of three qubit pure states. The equations are derived explicitly and solved in cases of most interest. These equations allow oneself to…