arXiv subjects
Publications and source records attributed to Li-Yi Hsu.
We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
We develop a novel necessary condition of quantum correlation. It is utilized to construct $d$-level bipartite Bell-type inequality which is strongly resistant to noise and requires only analyses of $O(d)$ measurement outcomes compared to the previous result $O(d^{2})$. Remarkably, a connection between the arbitrary high-dimensional bipartite Bell-type inequality and entanglement witnesses is found. Through the necessary condition of quantum correlation, we propose that the witness operators to detect truly multipartite entanglement for a generalized Greenberger-Horne-Zeilinger (GHZ) state with two local measurement settings and a four-qubit singlet state with three settings. Moreover, we also propose the first robust entanglement witness to detect four-level tripartite GHZ state with only two local measurement settings.
We provide a novel criterion for identifying quantum correlation, which allows us to find connections between Bell type inequalities, entanglement detection, and correlation. We utilize the criterion to construct witness operators that can detect genuine multi-qubit entanglement with fewer local measurements. The connection between identifications of quantum correlation and Mermin's inequality is discussed. Detection of genuine four-level tripartite entanglement with two local measurement settings is shown in the same manner. Further, through the criterion of quantum correlation, we derive a new Bell inequality for arbitrary high-dimensional bipartite systems, which requires fewer analyses of the measured outcomes.
We provide a solution of finding optimal measurement strategy for distinguishing between symmetric mixed quantum states. It is assumed that the matrix elements of at least one of the symmetric quantum states are all real and nonnegative in the basis of the eigenstates of the symmetry operator.
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice's card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob's best strategy for guessing Alice's card is to measure his two cards collectively.