Shao-Ming Fei

Quantum entanglement and coherence are crucial resources in quantum information theory. In some scenarios, however, it is not necessary to directly estimate entanglement or coherence measures to quantify the capabilities of a state in quantum information processing. Instead, fully entangled fraction and coherence fraction are two alternatives for entanglement and coherence in specific quantum tasks. Here, we establish a link between the coherence fraction and the Bernstein-Vazirani algorithm, which has several potential applications including cryptography and database search. We show that the success probability of the generalized Bernstein-Vazirani algorithm depends only on the coherence fraction of the initial state rather than its entanglement or coherence. Moreover, we discuss the coherence fraction dynamics and establish a relation between the operator's coherence fraction and the algorithm's success probability. Our findings highlight how quantum coherence fraction influences the efficiency of quantum algorithms.

Genuine multipartite entanglement (GME) is an important resource in quantum information processing. We systematically study the measures of GME based on the geometric mean of bi-partition entanglements and present a unified construction of GME measures, which gives rise to the widely used GME measures including GME concurrence, the convex-roof extended negativity of GME, the geometric measure of entanglement of GME. Our GME measures satisfy the desirable conditions such as scalability and smoothness. Moreover, we provide fidelity-based analytical lower bounds for our GME measures. Our bounds are tight and can be estimated experiment friendly without requiring quantum state tomography. Furthermore, we apply our results to study the dynamics of GME. We identify an initial condition that influences the sudden death of genuine quadripartite entanglement under individual non-Markovian processes. The GME of Dirac particles with Hawking radiation in the background of a Schwarzschild black hole is also investigated.

Quantum steering, an intermediate quantum correlation lying between entanglement and nonlocality, has emerged as a critical quantum resource for a variety of quantum information processing tasks such as quantum key distribution and true randomness generation. The ability to detect and quantify quantum steering is crucial for these applications. Semi-definite programming (SDP) has proven to be a valuable tool to quantify quantum steering. However, the challenge lies in the fact that the optimal measurement strategy is not priori known, making it time-consuming to compute the steerable measure for any given quantum state. Furthermore, the utilization of SDP requires full information of the quantum state, necessitating quantum state tomography, which can be complex and resource-consuming. In this work, we utilize the semi-supervised self-training model to estimate the steerable weight, a pivotal measure of quantum steering. The model can be trained using a limited amount of labeled data, thus reducing the time for labeling. The features are constructed by the probabilities derived by performing three sets of projective measurements under arbitrary local unitary transformations on the target states, circumventing the need for quantum tomography. The model demonstrates robust generalization capabilities and can achieve high levels of precision with limited resources.

Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks, including quantum metrology, quantum computing, and quantum communication. The verification of multipartite entanglement, along with an understanding of its intrinsic structure, is of fundamental importance, both for the foundations of quantum mechanics and for the practical applications of quantum information technologies. Nonetheless, detecting entanglement structures remains a significant challenge, particularly for general states and large-scale quantum systems. To address this issue, we develop an efficient algorithm that combines semidefinite programming with a gradient descent method. This algorithm is designed to explore the entanglement structure by examining the inner polytope of the convex set that encompasses all states sharing the same entanglement properties. Through detailed examples, we demonstrate the superior performance of our approach compared to many of the best-known methods available today. Our method not only improves entanglement detection but also provides deeper insights into the complex structures of many-body quantum systems, which is essential for advancing quantum technologies

We establish the profound equivalence between measures of genuine multipartite entanglement(GME) and their corresponding coherence measures. Initially we construct two distinct classes of measures for genuine multipartite entanglement utilizing real symmetric concave functions and the convex roof technique. We then demonstrate that all coherence measures for any qudit states, defined through the convex roof approach, are identical to our two classes of GME measures of the states combined with an incoherent ancilla under a unitary incoherent operation. This relationship implies that genuine multipartite entanglement can be generated from the coherence inherent in an initial state through the unitary incoherent operations. Furthermore, we explore the interplay between coherence and other forms of genuine quantum correlations, specifically genuine multipartite steering and genuine multipartite nonlocality. In the instance of special three-qubit X-states (only nonzero elements of X-state are diagonal or antidiagonal when written in an orthonormal basis), we find that genuine multipartite steering and nonlocality are present if and only if the coherence exists in the corresponding qubit states.

The study of quantum nonlocal correlations in networks (QNCNs), beyond the standard Bell theory with a single source, involves simulating large-scale quantum communications. The detectability of QNCNs depends on the input sources and selected measurements, and more essentially on the network structures. In this paper, we prove that same-size acyclic networks with different independence degrees can generate distinct sets of QNCNs in the device-independent scenario. We then distinguish two acyclic networks with different independence degrees by comparing the QNCNs generated from them. Furthermore, we show quantum demonstrations of the aforementioned notions in two-qubit-source networks. We investigate the quantitative influence of different network topologies on the detection of QNCNs in acyclic networks with Werner states as sources. Finally, we study how to maintain high independence degrees in networks formed by connecting two networks. This makes the correlations on the newly formed quantum network more likely to be nonlocal. Our research provides an alternative perspective for the well-known graph classification problem, and establishes an intrinsic connection between the graph theory and the foundation of quantum mechanics.