Related papers: Tensorial characterization and quantum estimation …
We show a similarity between two different classical simulation methods for measurement based quantum computation -- one relying on a low entanglement (tree tensor network) representation of the computer's state, and the other a tensor…
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…
In order to quantify entanglement between two parts of a quantum system, one of the most used estimator is the Von Neumann entropy. Unfortunately, computing this quantity for large interacting quantum spin systems remains an open issue.…
Quantum resources, such as entanglement, can decrease the uncertainty of a parameter-estimation procedure beyond what is classically possible. This phenomenon is well described for noiseless systems with asymptotically many measurement…
How can we quantify the entanglement in a quantum state, if only the expectation value of a single observable is given? This question is of great interest for the analysis of entanglement in experiments, since in many multiparticle…
The role of SU(2) invariants for the classification of multiparty entanglement is discussed and exemplified for the Kempe invariant I_5 of pure three-qubit states. It is found to being an independent invariant only in presence of both…
Measuring entanglement is a demanding task that usually requires full tomography of a quantum system, involving a number of observables that grows exponentially with the number of parties. Recently, it was suggested that adding a single…
Quantum entanglement is known to be monogamous, i.e., it obeys strong constraints on how the entanglement can be distributed among multipartite systems. Almost all the entanglement monotones so far are shown to be monogamous. We explore…
This paper introduces a formalism that aims to describe the intricacies of quantum computation by establishing a connection with the mathematical foundations of tensor theory and multilinear maps. The focus is on providing a comprehensive…
Quantum entanglement is a key resource in quantum computing and quantum information processing tasks. However, its quantification remains a major challenge since it cannot be directly extracted from physical observables. To address this…
A general geometrical structure of the entanglement entropy for spatial partition of a relativistic QFT system is established by using methods of the effective gravity action and the spectral geometry. A special attention is payed to the…
By fully exploiting the existence of the unitarily inequivalent representations of quantum fields, we exhibit the entanglement between inner and outer particles, with respect to the event horizon of a black hole. We compute the entanglement…
We introduce a purely geometric formulation for two different measures addressed to quantify the entanglement between different parts of a tripartite qubit system. Our approach considers the entanglement-polytope defined by the smallest…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…
In this paper, we investigate how to reduce the number of measurement configurations needed for sufficiently precise entanglement quantification. Instead of analytical formulae, we employ artificial neural networks to predict the amount of…
The entanglement production in bipartite quantum systems is studied for initially unentangled product eigenstates of the subsystems, which are assumed to be quantum chaotic. Based on a perturbative computation of the Schmidt eigenvalues of…
We develop an original approach for the quantitative characterisation of the entanglement properties of, possibly mixed, bi- and multipartite quantum states of arbitrary finite dimension. Particular emphasis is given to the derivation 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…
A convergent iterative procedure is proposed for the calculation of the relative entropy of entanglement of a given bipartite quantum state. When this state turns out to be non-separable the algorithm provides the corresponding optimal…