SearcharxivSearch

arXiv subjects

Wei-Min Shang

Publications and source records attributed to Wei-Min Shang.

6 recordsLinked to original sources

Quantum information masking basing on quantum teleportation

The no-masking theorem says that masking quantum information is impossible in a bipartite scenario. However, there exist schemes to mask quantum states in multipartite systems. In this work, we show that, the joint measurement in the teleportation is really a masking process, when the apparatus is regarded as a quantum participant in the whole system. Based on the view, we present two four-partite maskers and a tripartite masker. One of the former provides a generalization in arbitrary dimension of the four-qubit scheme given by Li and Wang [Phys. Rev. A 98, 062306 (2018)], and the latter is precisely their tripartite scheme. The occupation probabilities and coherence of quantum states are masked in two steps of our schemes. And the information can be extracted naturally in their reverse processes.

quant-ph

Anyonic quantum multipartite maskers in the Kitaev model

The structure of quantum mechanics forbids a bipartite scenario for masking quantum information, however, it allows multipartite maskers. The Latin squares are found to be closely related to a series of tripartite maskers. This adds another item, significantly different from the original no-cloning theorem, to the no-go theorems. On the other hand, anyonic excitations in two dimensions exhibit exotic collective behaviors of quantum physics, and open the avenue of fault-tolerant topological quantum computing. Here, we give the Latin-square construction of Abelian and Ising anyons %of in the Kitaev model and study the maskable space configuration in anyonic space. The circling and braiding of Kitaev anyons are masking operations on extended hyperdisks in anyonic space. We also realize quantum information masking in a teleportation way in the Kitaev Ising anyon model.

quant-ph

The Iteration Formula of (n,2,d) Full-correlated Multi-component Bell Function and Its Applications

It is very difficult and important to construct Bell inequalities for n-partite, k-settings of measurement, and d-dimensional (n,k,d) systems. Inspired by the iteration formula form of the Mermin-Ardehali-Belinski{\uı}-Klyshko (MABK) inequality, we generalize the multi-component correlation functions for bipartite d-dimensional systems to n-partite ones, and construct the corresponding Bell inequality. The Collins-Gisin-Linden-Massar-Popescu inequality can be reproduced by this way. The most important result is that for prime d the general Bell function in full-correlated multi-component correlation function form for (n,2,d) systems can be reformulated in iteration formula by two full-correlated multi-component Bell functions for (n-1,2,d) systems. As applications, we recover the MABK inequality and the most robust coincidence Bell inequalities for (3,2,3),(4,2,3),(5,2,3), and (3,2,5) Bell scenarios with this iteration formula. This implies that the iteration formula is an efficient way of constructing multi-partite Bell inequalities. In addition, we also give some new Bell inequalities with the same robustness but inequivalent to the known ones.

quant-ph

Generalized Iterative Formula for Bell Inequalities

Bell inequalities are a vital tool to detect the nonlocal correlations, but the construction of them for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of $(n+1)$-partite Bell inequalities into $n$-partite ones, we present a generalized iterative formula to construct nontrivial $(n+1)$-partite ones from the $n$-partite ones. Our iterative formulas recover the well-known Mermin-Ardehali-Belinski{\uı}-Klyshko (MABK) and other families in the literature as special cases. Moreover, a family of ``dual-use'' Bell inequalities is proposed, in the sense that for the generalized Greenberger-Horne-Zeilinger states these inequalities lead to the same quantum violation as the MABK family and, at the same time, the inequalities are able to detect the non-locality in the entire entangled region. Furthermore, we present generalizations of the the I3322 inequality to any $n$-partite case which are still tight, and of the $46$ Śliwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.

quant-ph

Quantum cloning of steering

Quantum steering in a global state allows an observer to remotely steer a subsystem into different ensembles by performing different local measurements on the other part. We show that, in general, this property cannot be perfectly cloned by any joint operation between a steered subsystem and a third system. Perfect cloning is viable if and only if the initial state is of zero discord. We also investigate the process of cloning the steered qubit of a Bell state using a universal cloning machine. Einstein-Podolsky-Rosen (EPR) steering, which is a type of quantum correlation existing in the states without a local-hidden-state model, is observed in the two copy subsystems. This contradicts the conclusion of no-cloning of quantum steering (EPR steering) [C. Y. Chiu et al., npj Quantum Inf. 2, 16020 (2016)] based on a mutual information criterion for EPR steering.

quant-ph

Quantum information masking of an arbitrary qudit can be realized in multipartite lower dimensional systems

Quantum information masking is a protocol that hides the original quantum information from subsystems and spreads it over quantum correlation, which is available to multipartite except bipartite systems. In this work, we explicitly study the quantum information masking in multipartite scenario and prove that all the k-level quantum states can be masked into a m-qudit systems (m > 4) whose local dimension d < k and the upper bound of k is tighter than the quantum Singleton bound. In order to observe the masking process intuitively, explicitly controlled operations are provided. Our scheme well demonstrates the abundance of quantum correlation between multipartite quantum system and has potential application in the security of quantum information processing.

quant-ph