Randomized Row and Column Iterative Methods with a Quantum Computer

We consider the quantum implementations of the two classical iterative solvers for a system of linear equations, including the Kaczmarz method which uses a row of coefficient matrix in each iteration step, and the coordinate descent method which utilizes a column instead. These two methods are widely applied in big data science due to their very simple iteration schemes. In this paper we use the block-encoding technique and propose fast quantum implementations for these two approaches, under the assumption that the quantum states of each row or each column can be efficiently prepared. The quantum algorithms achieve exponential speed up at the problem size over the classical versions, meanwhile their complexity is nearly linear at the number of steps

Monogamy relations of all quantum correlation measures for multipartite quantum systems

The monogamy relations of quantum correlation restrict the sharability of quantum correlations in multipartite quantum states. We show that all measures of quantum correlations satisfy some kind of monogamy relations for arbitrary multipartite quantum states. Moreover, by introducing residual quantum correlations, we present tighter monogamy inequalities that are better than all the existing ones. In particular, for multi-qubit pure states, we also establish new monogamous relations based on the concurrence and concurrence of assistance under the partition of the first two qubits and the remaining ones.Comment: arXiv admin note: text overlap with arXiv:1206.4029 by other author

Superactivation of monogamy relations for nonadditive quantum correlation measures

We investigate the general monogamy and polygamy relations satisfied by quantum correlation measures. We show that there exist two real numbers $\alpha$ and $\beta$ such that for any quantum correlation measure $Q$, $Q^x$ is monogamous if $x\geq \alpha$ and polygamous if $0\leq x\leq \beta$ for a given multipartite state $\rho$. For $\beta <x<\alpha$, we show that the monogamy relation can be superactivated by finite $m$ copies $\rho^{\otimes m}$ of $\rho$ for nonadditive correlation measures. As a detailed example, we use the negativity as the quantum correlation measure to illustrate such superactivation of monogamy properties. A tighter monogamy relation is presented at last

Polygamy relations of multipartite entanglement beyond qubits

We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $\alpha$th $(0\leq \alpha\leq 2)$ power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the $\beta$th ($0\leq \beta \leq 1$) power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.Comment: arXiv admin note: text overlap with arXiv:1902.0744