Yu, Xiao‐Dong

Preferred name
Yu, Xiao‐Dong
ORCID

Settings

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    consent settings
    PublicationAccess status: Metadata only ,
    Certifying quantum separability with adaptive polytopes
    (2024)
    Ohst, Ties-Albrecht
    ;
    Yu, Xiao‐Dong
    ;
    Gühne, Otfried
    ;
    Nguyen, Chau H.
    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:Article
    DOI:10.21468/scipostphys.16.3.063
      3
  • Some of the metrics are blocked by your 
    consent settings
    PublicationAccess status: Open Access ,
    State-independent quantum contextuality with projectors of nonunit rank
    (2021)
    Xu, Zhen-Peng
    ;
    Yu, Xiao‐Dong
    ;
    Kleinmann, Matthias
    Virtually all of the analysis of quantum contextuality is restricted to the case where events are represented by rank-one projectors. This restriction is arbitrary and not motivated by physical considerations. We show here that loosening the rank constraint opens a new realm of quantum contextuality and we demonstrate that state-independent contextuality (SIC) can even require projectors of nonunit rank. This enables the possibility of SIC with less than 13 projectors, which is the established minimum for the case of rank one. We prove that for any rank, at least 9 projectors are required. Furthermore, in an exhaustive numerical search we find that 13 projectors are also minimal for the cases where all projectors are uniformly of rank two or uniformly of rank three.
    Source Type:Article
    DOI:10.25819/ubsi/10124
      300  225