Related papers: Grover's Algorithm and the Secant Varieties
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…
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum…
We present a concise introduction to quantum entanglement. Concentrating on bipartite systems we review the separability criteria and measures of entanglement. We focus our attention on geometry of the sets of separable and maximally…
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…
In this paper we discuss how to use arborescent knots to construct entangled multi-qubit states. We show that Bell-states, GHZ-states and cluster states can be constructed from such knots. The latter are particularly interesting since they…
Quantum entanglement, a cornerstone of quantum mechanics, remains challenging to classify, particularly in multipartite systems. Here, we present a new interpretation of entanglement classification by revealing a profound connection to…
Continuous-variable Gaussian entanglement is an attractive notion, both as a fundamental concept in quantum information theory, based on the well-established Gaussian formalism for phase-space variables, and as a practical resource in…
This article proposes an efficient way of calculating the geometric measure of entanglement using tensor decomposition methods. The connection between these two concepts is explored using the tensor representation of the wavefunction.…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
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…
We study the quantum entanglement structure of integer quantum Hall states via the reduced density matrix of spatial subregions. In particular, we examine the eigenstates, spectrum and entanglement entropy (EE) of the density matrix for…
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…
The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
Entanglement is one of the most fascinating features arising from quantum-mechanics and of great importance for quantum information science. Of particular interest are so-called hybrid-entangled states which have the intriguing property…
We present a construction of genuinely entangled multipartite quantum states based on the group theory. Analyzed states resemble the Dicke states, whereas the interactions occur only between specific subsystems related by the action of the…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
We propose new algebraic invariants that distinguish and classify entangled states. Considering qubits as well as higher spin systems, we obtained complete entanglement classifications for cases that were either unsolved or only conjectured…
The Lindblad generators of the master equation define which kind of decoherence happens in an open quantum system. We are working with a two qubit system and choose the generators to be projection operators on the eigenstates of the system…