Related papers: Multipartite entanglement in quantum algorithms

Although entanglement is widely considered to be necessary for quantum algorithms to improve on classical ones, Lloyd has observed recently that Grover's quantum search algorithm can be implemented without entanglement, by replacing…

Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been…

We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about…

Multiparty quantum states are useful for a variety of quantum information and computation protocols. We define a multiparty entanglement measure based on local measurements on a multiparty quantum state, and an entanglement measure averaged…

The quantum entanglement as one of very important resources has been widely used in quantum information processing. In this work, we present a new kind of genuine multipartite entanglement. It is derived from special geometric feature of…

This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…

Quantum entanglement and its paradoxical properties hold the key to an information processing revolution. Much attention has focused recently on the challenging problem of characterizing entanglement. Entanglement for a two qubit system is…

Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with…

Quantum entanglement plays a critical role in many quantum applications, but detecting entanglement, especially in multipartite or high-dimensional quantum systems, remains a challenge. In this paper, we propose several families of…

We review some current ideas about tripartite entanglement, the case representing the next level of complexity beyond the simplest one (though far from trivial), namely the bipartite. This kind of entanglement has an essential role in the…

We investigate the entanglement properties of multiparticle systems, concentrating on the case where the entanglement is robust against disposal of particles. Two qubits -belonging to a multipartite system- are entangled in this sense iff…

We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…

We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…

We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…

We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…

I give an overview of some of the most used measures of entanglement. To make the presentation self-contained, a number of concepts from quantum information theory are first explained. Then the structure of bipartite entanglement is studied…

We propose a method to characterize and quantify multipartite entanglement for pure states. The method hinges upon the study of the probability density function of bipartite entanglement and is tested on an ensemble of qubits in a variety…

Entanglement properties of the trial many-body wave functions in variational treatments of the transverse Ising model in two, three, and four dimensions are investigated. Based on data for magnetizations and correlation functions generated…