Searcharxiv⌕ Search

arXiv subjects

Shao-Ming Fei

Publications and source records attributed to Shao-Ming Fei.

At least 199 records · Page 11Linked to original sources

Quantumness of pure-state ensembles via coherence of Gram matrix based on generalized $α$-$z$-relative Rényi entropy

The Gram matrix of a set of quantum pure states plays key roles in quantum information theory. It has been highlighted that the Gram matrix of a pure-state ensemble can be viewed as a quantum state, and the quantumness of a pure-state ensemble can thus be quantified by the coherence of the Gram matrix [Europhys. Lett. \textbf{134} 30003]. Instead of the $l_1$-norm of coherence and the relative entropy of coherence, we utilize the generalized $α$-$z$-relative Rényi entropy of coherence of the Gram matrix to quantify the quantumness of a pure-state ensemble and explore its properties. We show the usefulness of this quantifier by calculating the quantumness of six important pure-state ensembles. Furthermore, we compare our quantumness with other existing ones and show their features as well as orderings.

quant-ph↗

Estimating Parameterized Entanglement Measure

The parameterized entanglement monotone, the $q$-concurrence, is also a reasonable parameterized entanglement measure. By exploring the properties of the $q$-concurrence with respect to the positive partial transposition and realignment of density matrices, we present tight lower bounds of the $q$-concurrence for arbitrary $q\geqslant 2$. Detailed examples are given to show that the bounds are better than the previous ones.

quant-ph↗

Parameterized Bipartite Entanglement Measure

We propose a novel parameterized entanglement measure $α$-concurrence for bipartite systems. By employing positive partial transposition and realignment criteria, we derive analytical lower bounds for the $α$-concurrence. Moreover, we calculate explicitly the analytic expressions of the $α$-concurrence for isotropic states and Werner states.

quant-ph↗

Detection of multipartite entanglement based on Heisenberg-Weyl representation of density matrices

We study entanglement and genuine entanglement of tripartite and four-partite quantum states by using Heisenberg-Weyl (HW) representation of density matrices. Based on the correlation tensors in HW representation, we present criteria to detect entanglement and genuine tripartite and four-partite entanglement. Detailed examples show that our method can detect more entangled states than previous criteria.

quant-ph↗

Optimizing incompatible triple quantum measurements

We investigate the optimal approximation to triple incompatible quantum measurements within the framework of statistical distance and joint measurability. According to the lower bound of the uncertainty inequality presented in [Physical Review A 99, 312107 (2019)], we give the analytical expressions of the optimal jointly measurable approximation to two kinds of triple incompatible unbiased qubit measurements. We also obtain the corresponding states which give the minimal approximation errors in measuring process. The results give rise to plausible experimental verifications of such statistical distance based uncertainty relations.

quant-ph↗

Revealing hidden standard tripartite nonlocality by local filtering

Quantum nonlocality is a kind of significant quantum correlation that is stronger than quantum entanglement and EPR steering. The standard tripartite nonlocality can be detected by the violation of the Mermin inequality. By using local filtering operations, we give a tight upper bound on the maximal expected value of the Mermin operators. By detailed examples we show that the hidden standard nonlocality can be revealed by local filtering which can enhance the robustness of the noised entangled states.

quant-ph↗

A Necessary and Sufficient Entanglement Criterion of N-qubit System Based on Correlation Tensor

Great advances have been achieved in studying characteristics of entanglement for fundamentals of quantum mechanics and quantum information processing. However, even for N-qubit systems, the problem of entanglement criterion has not been well solved. In this Letter, using the method of state decomposition and high order singular value decomposition (HOSVD), we propose a necessary and sufficient entanglement criterion for general N-qubit systems. As an example, we apply our method to study the multi-qubit W state with white noise. We not only obtain the separability critical point, which is tight and thus better than known results, but also the separate states ensemble for decomposition. More examples are presented to show our criterion is accurate, which is tighter than the well-known positive partial transpose criterion. For two-qubit case, we can provide an entanglement measurer which gives similar results with concurrence up to a factor. Our results pave the way to solve the entanglement-separability criterion for more general cases.

quant-ph↗

Probability density functions of quantum mechanical observable uncertainties

We study the uncertainties of quantum mechanical observables, quantified by the standard deviation (square root of variance) in Haar-distributed random pure states. We derive analytically the probability density functions (PDFs) of the uncertainties of arbitrary qubit observables. Based on these PDFs, the uncertainty regions of the observables are characterized by the supports of the PDFs. The state-independent uncertainty relations are then transformed into the optimization problems over uncertainty regions, which opens a new vista for studying state independent uncertainty relations. Our results may be generalized to multiple observable case in higher dimensional spaces.

quant-ph↗

An alternative framework for quantifying coherence of quantum channels

We present an alternative framework for quantifying the coherence of quantum channels, which contains three conditions: the faithfulness, nonincreasing under sets of all the incoherent superchannels and the additivity. Based on the characteristics of the coherence of quantum channels and the additivity of independent channels, our framework provides an easier way to certify whether a function is a bona fide coherence measure of quantum channels. Detailed example is given to illustrate the effectiveness and advantages of our framework.

quant-ph↗

Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems

The gradient descent approach is the key ingredient in variational quantum algorithms and machine learning tasks, which is an optimization algorithm for finding a local minimum of an objective function. The quantum versions of gradient descent have been investigated and implemented in calculating molecular ground states and optimizing polynomial functions. Based on the quantum gradient descent algorithm and Choi-Jamiolkowski isomorphism, we present approaches to simulate efficiently the nonequilibrium steady states of Markovian open quantum many-body systems. Two strategies are developed to evaluate the expectation values of physical observables on the nonequilibrium steady states. Moreover, we adapt the quantum gradient descent algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications, by converting these algebraic problems into the simulations of closed quantum systems with well-defined Hamiltonians. Detailed examples are given to test numerically the effectiveness of the proposed algorithms for the dissipative quantum transverse Ising models and matrix-vector multiplications.

quant-ph↗

Product and sum uncertainty relations based on metric-adjusted skew information

The metric-adjusted skew information establishes a connection between the geometrical formulation of quantum statistics and the measures of quantum information. We study uncertainty relations in product and summation forms of metric-adjusted skew information. We present lower bounds on product and summation uncertainty inequalities based on metric-adjusted skew information via operator representation of observables. Explicit examples are provided to back our claims.

quant-ph↗

A new parameterized monogamy relation between entanglement and equality

We provide a generalized definition of the monogamy relation for entanglement measures. A monogamy equality rather than the usual inequality is presented based on the monogamy weight, from which we give monogamy relations satisfied by the $α$th $(α>0)$ power of the entanglement measures. Taking concurrence as an example, we further demonstrate the significance and advantages of these relations. In addition, we show that monogamy relations can be recovered by considering multiple copies of states for every non-additive entanglement measure that violates the inequalities. We also demonstrate that the such relations for tripartite states can be generalized to multipartite systems.

quant-ph↗

Detection of genuine tripartite entanglement based on Bloch representation of densitymatrices

We study the genuine multipartite entanglement in tripartite quantum systems. By using the Schmidt decomposition and local unitary transformation, we convert the general states to simpler forms and consider certain matrices from correlation tensors in the Bloch representation of the simplified density matrices. Using these special matrices, we obtain new criteria for genuine multipartite entanglement. Detail examples show that our criteria are able to detect more tripartite entangled and genuine tripartite entangled states than some existing criteria.

quant-ph↗

Quantum Coherence Bounds the Distributed Discords

Establishing quantum correlations between two remote parties by sending an information carrier is an essential step of many protocols in quantum information processing. We obtain trade-off relations between discords and coherence within a bipartite system. Then we study the distribution of coherence in a bipartite quantum state by using the relations of relative entropy and mutual information. We show that the increase of the relative entropy of discord between two remote parties is bounded by the nonclassical correlations quantified by the relative entropy of coherence between the carrier and two remote parties, providing an optimal protocol for discord distribution and showing that quantum correlations are the essential resource for such tasks.

quant-ph↗

Near-Optimal Variance-Based Uncertainty Relations

Learning physical properties of a quantum system is essential for the developments of quantum technologies. However, Heisenberg's uncertainty principle constrains the potential knowledge one can simultaneously have about a system in quantum theory. Aside from its fundamental significance, the mathematical characterization of this restriction, known as `uncertainty relation', plays important roles in a wide range of applications, stimulating the formation of tighter uncertainty relations. In this work, we investigate the fundamental limitations of variance-based uncertainty relations, and introduce several `near optimal' bounds for incompatible observables. Our results consist of two morphologically distinct phases: lower bounds that illustrate the uncertainties about measurement outcomes, and the upper bound that indicates the potential knowledge we can gain. Combining them together leads to an \emph{uncertainty interval}, which captures the essence of uncertainties in quantum theory. Finally, we have detailed how to formulate lower bounds for product-form variance-based uncertainty relations by employing entropic uncertainty relations, and hence built a link between different forms of uncertainty relations.

quant-ph↗

Quantum Information Masking in Non-Hermitian Systems and Robustness

By studying quantum information masking in non-Hermitian quantum systems, we show that mutually orthogonal quantum states can be deterministically masked, while an arbitrary set of quantum states cannot be masked in non-Hermitian quantum systems. We further demonstrate that a set of linearly independent states which are mutually $η$-orthogonal can be deterministically masked by a pseudo-unitary operator. Moreover, we study robustness of quantum information masking against noisy environments. The robustness of deterministic and probabilistic quantum information masking under different quantum noise channels is analyzed in detail. Accordingly, we propose and discuss the $r$-uniform probabilistic quantum information masking in multipartite systems.

quant-ph↗

Quantum algorithms for the generalized eigenvalue problem

The generalized eigenvalue (GE) problems are of particular importance in various areas of science engineering and machine learning. We present a variational quantum algorithm for finding the desired generalized eigenvalue of the GE problem, $\mathcal{A}|ψ\rangle=λ\mathcal{B}|ψ\rangle$, by choosing suitable loss functions. Our approach imposes the superposition of the trial state and the obtained eigenvectors with respect to the weighting matrix $\mathcal{B}$ on the Rayleigh-quotient. Furthermore, both the values and derivatives of the loss functions can be calculated on near-term quantum devices with shallow quantum circuit. Finally, we propose a full quantum generalized eigensolver (FQGE) to calculate the minimal generalized eigenvalue with quantum gradient descent algorithm. As a demonstration of the principle, we numerically implement our algorithms to conduct a 2-qubit simulation and successfully find the generalized eigenvalues of the matrix pencil $(\mathcal{A},\,\mathcal{B})$. The numerically experimental result indicates that FQGE is robust under Gaussian noise.

quant-ph↗

A characterization of maximally entangled two-qubit states

As already known by Rana's result \href{https://doi.org/10.1103/PhysRevA.87.054301}{[\pra {\bf87} (2013) 054301]}, all eigenvalues of any partial-transposed bipartite state fall within the closed interval $[-\frac12,1]$. In this note, we study a family of bipartite quantum states whose minimal eigenvalues of partial-transposed states being $-\frac12$. For a two-qubit system, we find that the minimal eigenvalue of its partial-transposed state is $-\frac12$ if and only if such two-qubit state must be maximally entangled. However this result does not hold in general for a two-qudit system when the dimensions of the underlying space are larger than two.

quant-ph↗