Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Publication
    Certifying quantum separability with adaptive polytopes
    The concept of entanglement and separability of quantum states is relevant for several fields in physics. Still, there is a lack of effective operational methods to characterise these features. We propose a method to certify quantum separability of two- and multipArticle quantum systems based on an adaptive polytope approximation. This leads to an algorithm which, for practical purposes, conclusively recognises two-pArticle separability for small and medium-size dimensions. For multipArticle systems, the approach allows to characterise full separability for up to five qubits or three qutrits; in addition, different classes of entanglement can be distinguished. Finally, our methods allow to identify systematically quantum states with interesting entanglement properties, such as maximally robust states which are separable for all bipartitions, but not fully separable.
    Source Type:
      3
  • Some of the metrics are blocked by your 
    Publication
    Covariance-Matrix-Based Criteria for Network Entanglement
    Quantum networks offer a realistic and practical scheme for generating multipArticle entanglement and implementing multipArticle quantum communication protocols. However, the correlations that can be generated in networks with quantum sources and local operations are not yet well understood. Covariance matrices, which are powerful tools in entanglement theory, have been also applied to the network scenario. We present simple proofs for the decomposition of such matrices into the sum of positive semi-definite block matrices and, based on that, develop analytical and computable necessary criteria for preparing states in quantum networks. These criteria can be applied to networks where nodes share at most one source, such as all bipartite networks.
    Source Type:
      3