Related papers: The Groverian Measure of Entanglement for Mixed St…
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as, for instance, quantum communication, quantum computing, and quantum interferometry.…
Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a…
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To serach a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching…
Computationally feasible multipartite entanglement measures are needed to advance our understanding of complex quantum systems. An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and…
Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…
We discuss entanglement of multiparticle quantum systems. We propose a potential measure of a type of entanglement of pure states of n qubits, the n-tangle. For a system of two qubits the n-tangle is equal to the square of the concurrence,…
Entanglement is the central resource of quantum information processing and the precise characterization of entangled states is a crucial issue for the development of quantum technologies. This leads to the necessity of a precise,…
Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however,…
The achievement of quantum supremacy boosted the need for a robust medium of quantum information. In this task, higher-dimensional qudits show remarkable noise tolerance and enhanced security for quantum key distribution applications.…
We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This…
The geometric measure of entanglement, originated by Shimony and by Barnum and Linden, is determined for a family of tripartite mixed states consisting of aribitrary mixtures of GHZ, W, and inverted-W states. For this family of states,…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…
Genuine multimode entanglement in continuous variable systems can be quantified by exploring the geometry of the state-space, namely via the generalized geometric measure (GGM) which is defined as the shortest distance of a given multimode…
Known entanglement purification protocols for mixed states use collective measurements on several copies of the state in order to increase the entanglement of some of them. We address the question of whether it is possible to purify the…
We derive two lower bounds on entanglement of formation for arbitrary mixed Gaussian states by two distinct methods. To achieve the first one we use a local measurement procedure derived by Giedke et al [Quantum Inf. and Comp. vol.1, 79…
We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a…
A generic scheme for the parametrization of mixed state systems is introduced, which is then adapted to bipartite systems, especially to a 2-qubit system. Various features of 2-qubit entanglement are analyzed based on the scheme. Our…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…