arXiv subjects

Shao-Ming Fei

Publications and source records attributed to Shao-Ming Fei.

At least 181 records · Page 10Linked to original sources

arXiv2022

Operational Entanglement Detection Based on $Λ$-Moments

We introduce $Λ$-moments with respect to any positive map $Λ$. We show that these $Λ$-moments can effectively characterize the entanglement of unknown quantum states without theirs prior reconstructions. Based on $Λ$-moments necessary and sufficient separability criteria, as well as necessary optimized criteria are presented, which include the ones in [\href{https://link.aps.org/doi/10.1103/PhysRevLett.127.060504}{Phys. Rev. Lett. \textbf{127}, 060504 (2021)}] as special cases. Detailed example is given to show that our criteria can detect bound entanglement that can not be identified by positive partial transpose criterion, with the explicit measurement operators to experimentally measure the corresponding $Λ$-moments.

quant-ph↗

arXiv2022

Multipartite concurrence of W-class states based on sub-partite quantum systems

We study the concurrence for arbitrary N-partite W-class states based on the (N-1)-partite partitions of subsystems by taking account to the structures of W-class states. By using the method of permutation and combination we give analytical formula of concurrence and some elegant relations between the multipartite concurrence and the (N-1)-partite concurrence for arbitrary multipartite W-class states. Applying these relations we present better lower bounds of concurrence for multipartite mixed states. An example is given to demonstrate that our lower bounds can detect more entanglements.

quant-ph↗

arXiv2022

Concurrence triangle induced genuine multipartite entanglement measure

We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of $N$-partite pure states is derived by exploiting the restrictions on entanglement distributions, showing that the bipartite entanglement between each part and its remaining ones cannot exceed the sum of the other partners with their remaining ones. Then a series of triangles, named concurrence triangles, are established corresponding to these inequalities. Proper genuine multipartite entanglement measures are thus constructed by using the geometric mean area of these concurrence triangles, which are non-increasing under local operation and classical communication. The GME measures classify which parts are separable or entangled with the rest ones for non genuine entangled pure states. The GME measures for mixed states are given via the convex roof construction, and a witness to detect the GME of multipartite mixed states is presented by an approach based on state purifications. Detailed examples are given to illustrate the effectiveness of our GME measures.

quant-ph↗

arXiv2022

Genuinely Multipartite Entanglement vias Shallow Quantum Circuits

Multipartite entanglement is of important resources for quantum communication and quantum computation. Our goal in this paper is to characterize general multipartite entangled states according to shallow quantum circuits. We firstly prove any genuinely multipartite entanglement on finite-dimensional spaces can be generated by using 2-layer shallow quantum circuit consisting of two biseparable quantum channels, which the smallest nontrivial circuit depth in the shallow quantum circuit model. We further propose a semi-device-independent entanglement model depending on the local connection ability in the second layer of quantum circuits. This implies a complete hierarchy of distinguishing genuinely multipartite entangled states. It shows a completely different multipartite nonlocality from the quantum network entanglement. These results show new insights for the multipartite entanglement, quantum network, and measurement-based quantum computation.

quant-ph↗

arXiv2022

Improved iterative quantum algorithm for ground-state preparation

Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point is to optimize a cost function on the state space via the quantum gradient descent (QGD) implemented on quantum devices. We provide practical guideline on the selection of the learning rate in QGD by finding a fundamental upper bound and establishing a relationship between our algorithm and the first-order approximation of the imaginary time evolution. Furthermore, we adapt a variational quantum state preparation method as a subroutine to generate an ancillary state by utilizing only polylogarithmic quantum resources. The performance of our algorithm is demonstrated by numerical calculations of the deuteron molecule and Heisenberg model without and with noises. Compared with the existing algorithms, our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.

quant-ph↗

arXiv2022

Sharing Quantum Nonlocality in Star Network Scenarios

The Bell nonlocality is closely related to the foundations of quantum physics and has significant applications to security questions in quantum key distributions. In recent years, the sharing ability of the Bell nonlocality has been extensively studied. The nonlocality of quantum network states is more complex. We first discuss the sharing ability of the simplest bilocality under unilateral or bilateral POVM measurements, and show that the nonlocality sharing ability of network quantum states under unilateral measurements is similar to the Bell nonlocality sharing ability, but different under bilateral measurements. For the star network scenarios, we present for the first time comprehensive results on the nonlocality sharing properties of quantum network states, for which the quantum nonlocality of the network quantum states has a stronger sharing ability than the Bell nonlocality.

quant-ph↗

arXiv2022

Mutually unbiased maximally entangled bases from difference matrices

Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems. We present a new way to construct mutually unbiased bases by difference matrices in the theory of combinatorial designs. In particular, we establish $q$ mutually unbiased bases with $q-1$ maximally entangled bases and one product basis in $\mathbb{C}^q\otimes \mathbb{C}^q$ for arbitrary prime power $q$. In addition, we construct maximally entangled bases for dimension of composite numbers of non-prime power, such as five maximally entangled bases in $\mathbb{C}^{12}\otimes \mathbb{C}^{12}$ and $\mathbb{C}^{21}\otimes\mathbb{C}^{21}$, which improve the known lower bounds for $d=3m$, with $(3,m)=1$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$. Furthermore, we construct $p+1$ mutually unbiased bases with $p$ maximally entangled bases and one product basis in $\mathbb{C}^p\otimes \mathbb{C}^{p^2}$ for arbitrary prime number $p$.

quant-ph↗

arXiv2022

Novel Constructions of Mutually Unbiased Tripartite Absolutely Maximally Entangled Bases

We develop a new technique to construct mutually unbiased tripartite absolutely maximally entangled bases. We first explore the tripartite absolutely maximally entangled bases and mutually unbiased bases in $\mathbb{C}^{d} \otimes \mathbb{C}^{d} \otimes \mathbb{C}^{d}$ based on mutually orthogonal Latin squares. Then we generalize the approach to the case of $\mathbb{C}^{d_{1}} \otimes \mathbb{C}^{d_{2}} \otimes \mathbb{C}^{d_{1}d_{2}}$ by mutually weak orthogonal Latin squares. The concise direct constructions of mutually unbiased tripartite absolutely maximally entangled bases are remarkably presented with generality. Detailed examples in $\mathbb{C}^{3} \otimes \mathbb{C}^{3} \otimes \mathbb{C}^{3},$ $\mathbb{C}^{2} \otimes \mathbb{C}^{2} \otimes \mathbb{C}^{4}$ and $\mathbb{C}^{2} \otimes \mathbb{C}^{5} \otimes \mathbb{C}^{10}$ are provided to illustrate the advantages of our approach.

quant-ph↗

arXiv2022

Detecting Tripartite Steering via Quantum Entanglement

Einstein-Podolsky-Rosen steering is a kind of powerful nonlocal quantum resource in quantum information processing such as quantum cryptography and quantum communication. Many criteria have been proposed in the past few years to detect steerability, both analytically and numerically, for bipartite quantum systems. We propose effective criteria for tripartite steerability and genuine tripartite steerability of three-qubit quantum states by establishing connections between the tripartite steerability (resp. genuine tripartite steerability) and the tripartite entanglement (resp. genuine tripartite entanglement) of certain corresponding quantum states. From these connections, tripartite steerability and genuine tripartite steerability can be detected without using any steering inequalities. The ``complex cost'' of determining tripartite steering and genuine tripartite steering can be reduced by detecting the entanglement of the newly constructed states in the experiment. Detailed examples are given to illustrate the power of our criteria in detecting the (genuine) tripartite steerability of tripartite states.

quant-ph↗

arXiv2022

Quantum separability criteria based on realignment moments

Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is presented in [Phys. Rev. Lett. 125, 200501 (2020)] by Elben et al. based on the first three partially transposed (PT) moments of density matrices. Then in [Phys. Rev. Lett. 127, 060504 (2021)] Yu \emph{et al.} proposed two general powerful criteria based on the PT moments. In this paper, based on the realignment operations of matrices we propose entanglement detection criteria in terms of such realignment moments. We show by detailed example that the realignment moments can also be used to identify quantum entanglement.

quant-ph↗

arXiv2022

Tighter uncertainty relations based on $(α,β,γ)$ modified weighted Wigner-Yanase-Dyson skew information of quantum channels

We use a novel formation to illustrate the ($α,β,γ$) modified weighted Wigner-Yanase-Dyson (($α,β,γ$) MWWYD) skew information of quantum channels. By using operator norm inequalities, we explore the sum uncertainty relations for arbitrary $N$ quantum channels and for unitary channels. These uncertainty inequalities are shown to be tighter than the existing ones by a detailed example. Our results are also applicable to the modified weighted Wigner-Yanase-Dyson (MWWYD) skew information and the ($α,γ$) modified weighted Wigner-Yanase-Dyson (($α,γ$) MWWYD) skew information of quantum channels as special cases.

quant-ph↗

arXiv2022

Sum uncertainty relations based on $(α,β,γ)$ weighted Wigner-Yanase-Dyson skew information

We introduce ($α,β,γ$) weighted Wigner-Yanase-Dyson (($α,β,γ$) WWYD) skew information and ($α,β,γ$) modified weighted Wigner-Yanase-Dyson (($α,β,γ$) MWWYD) skew information. We explore the sum uncertainty relations for arbitrary $N$ mutually noncommutative observables based on ($α,β,γ$) WWYD skew information. A series of uncertainty inequalities are derived. We show by detailed example that our results cover and improve the previous ones based on the original Wigner-Yanase (WY) skew information. Finally, we establish new sum uncertainty relations in terms of the ($α,β,γ$) MWWYD skew information for arbitrary $N$ quantum channels.

quant-ph↗

arXiv2022

Uncertainty of quantum channels via modified generalized variance and modified generalized Wigner-Yanase-Dyson skew information

Uncertainty relation is a fundamental issue in quantum mechanics and quantum information theory. By using modified generalized variance (MGV), and modified generalized Wigner-Yanase-Dyson skew information (MGWYD), we identify the total and quantum uncertainty of quantum channels. The elegant properties of the total uncertainty of quantum channels are explored in detail. In addition, we present a trade-off relation between the total uncertainty of quantum channels and the entanglement fidelity and establish the relationships between the total uncertainty and entropy exchange/coherent information. Detailed examples are given to the explicit formulas of the total uncertainty and the quantum uncertainty of quantum channels. Moreover, utilizing a realizable experimental measurement scheme by using the Mach-Zehnder interferometer proposed in Nirala et al. (Phys Rev A 99:022111, 2019), we discuss how to measure the total/quantum uncertainty of quantum channels for pure states.

quant-ph↗

arXiv2022

On Ergotropic Gap of Tripartite Separable Systems

Extracting work from quantum system is one of the important areas in quantum thermodynamics. As a significant thermodynamic quantity, the ergotropy gap characterizes the difference between the global and local maximum extractable works. We derive an analytical upper bound of the ergotropic gap with respect to $d\times d\times d$ tripartite separable states. This bound also provides a necessary criterion for the separability of tripartite states. Detailed examples are presented to illustrate the efficiency of this separability criterion.

quant-ph↗

arXiv2022

Standard symmetrized variance with applications to coherence, uncertainty and entanglement

Variance is a ubiquitous quantity in quantum information theory. Given a basis, we consider the averaged variances of a fixed diagonal observable in a pure state under all possible permutations on the components of the pure state and call it the symmetrized variance. Moreover we work out the analytical expression of the symmetrized variance and find that such expression is in the factorized form where two factors separately depends on the diagonal observable and quantum state. By shifting the factor corresponding to the diagonal observable, we introduce the notion named the standard symmetrized variance for the pure state which is independent of the diagonal observable. We then extend the standard symmetrized variance to mixed states in three different ways, which characterize the uncertainty, the coherence and the coherence of assistance, respectively. These quantities are evaluated analytically and the relations among them are established. In addition, we show that the standard symmetrized variance is also an entanglement measure for bipartite systems. In this way, these different quantumness of quantum states are unified by the variance.

quant-ph↗

arXiv2022

Skew information-based coherence generating power of quantum channels

We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. We define the measure of coherence generating power (CGP) for a generic quantum channel to be the average coherence generated by the quantum channel acting on a uniform ensemble of incoherent states based on the skew information-based coherence measure. We present explicitly the analytical formulae of the CGP for any arbitrary finite dimensional unitary channels. We derive the mean value of the CGP over the unitary groups and investigate the typicality of the normalized CGP. Furthermore, we give an upper bound of the CGP for the convex combinations of unitary channels. Detailed examples are provided to calculate exactly the values of the CGP for the unitary channels related to specific quantum gates and for some qubit channels.

quant-ph↗

arXiv2022

Quantum relaxed row and column iteration methods based on block-encoding

Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices in the iterative processes, which generalize row and column iteration methods to solve linear systems on a quantum computer. Comparing with the conventional row and column iteration methods, the convergence accelerates when appropriate parameters are chosen. Once the quantum states are efficiently prepared, the complexity of our relaxed row and column methods is improved exponentially and is linear with the number of the iteration steps. In addition, phase estimations and Hamiltonian simulations are not required in these algorithms.

quant-ph↗

arXiv2022

Informationally complete measures of quantum entanglement

Although quantum entanglement has already been verified experimentally and applied in quantum computing, quantum sensing and quantum networks, most of the existing measures cannot characterize the entanglement faithfully. In this work, by exploiting the Schmidt decomposition of a bipartite state $|ψ\rangle_{AB}$, we first establish a one-to-one correspondence relation between the characteristic polynomial of the reduced state $ρ_A$ and the polynomials its trace. Then we introduce a family of entanglement measures which are given by the complete eigenvalues of the reduced density matrices of the system. Specific measures called informationally complete entanglement measures (ICEMs) are presented to illustrate the advantages. It is demonstrated that such ICEMs can characterize finer and distinguish better the entanglement than existing well-known entanglement measures. They also give rise to criteria of state transformations under local operation and classical communication. Moreover, we show that the ICEMs can be efficiently estimated on a quantum computer. The fully separability, entanglement and genuine multipartite entanglement can detected faithfully on quantum devices.

quant-ph↗