Related papers: Algorithm for evaluating distance-based entangleme…
Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank,…
We present a conjugate gradient method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension and with any bipartite division of the Hilbert space. The development of the gradient used by the…
Understanding the distribution of quantum entanglement over many parties is a fundamental challenge of quantum physics and is of practical relevance for several applications in the field of quantum information. Here we use methods from…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
We introduce a method for extracting meaningful entanglement measures of tensor network states in general dimensions. Current methods require the explicit reconstruction of the density matrix, which is highly demanding, or the contraction…
In quantum information theory, the reliable and effective detection of entanglement is of paramount importance. However, given an unknown state, assessing its entanglement is a challenging task. To attack this problem, we investigate the…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…
An entanglement bound based on local measurements is introduced for multipartite pure states. It is the upper bound of the geometric measure and the relative entropy of entanglement. It is the lower bound of minimal measurement entropy. For…
Entanglement is a key property in the development of quantum technologies and in the study of quantum many-body simulations. However, entanglement measurement typically requires quantum full-state tomography (FST). Here we present a neural…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
The advent of cloud quantum computing has led to the rapid development of quantum algorithms. In particular, it is necessary to study variational quantum-classical hybrid algorithms, which are executable on noisy intermediate-scale quantum…
We show how entanglement may be quantified in spin and cold atom many-body systems using standard experimental techniques only. The scheme requires no assumptions on the state in the laboratory and a lower bound to the entanglement can be…
We explore a supervised machine learning approach to estimate the entanglement entropy of multi-qubit systems from few experimental samples. We put a particular focus on estimating both aleatoric and epistemic uncertainty of the network's…
The concept of \textquotedblleft the permutationally invariant part of a density matrx\textquotedblright constitutes an important tool for entanglement characterization of multiqubit systems. In this paper, we first present $(k+1)$-partite…
Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly…
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational…