Related papers: The quantum low-rank approximation problem
Quantum correlations may be measured by means of the distance of the state to the subclass of states $\Omega$ having well defined classical properties. In particular, a geometric measure of asymmetric discord [Dakic et al., Phys. Rev. Lett.…
Given the density matrix rho of a bipartite quantum state, the quantum separability problem asks whether rho is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if rho is located within an inverse exponential…
Quantum error-correcting codes (QECCs) is at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related…
We introduce random matrix theory to study the tomographic efficiency of a wide class of measurements constructed out of weighted 2-designs, including symmetric informationally complete (SIC) probability operator measurements (POMs). In…
We address the "major open problem" of evaluating how much increased efficiency in estimation is possible using non-separable, as opposed to separable, measurements of N copies of m-level quantum systems. First, we study the six cases m =…
We revise and extend the algorithm provided in [1] to compute the finite Connes' distance between normal states. The original formula in [1] contains an error and actually only provides a lower bound. The correct expression, which we…
Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity $F(\rho,\sigma)$ based on the "truncated fidelity"…
Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of…
We discuss the estimation of the distance of a given mixed many-body quantum state to the set of fully separable states, applied to the concrete scenario of collective spin states. Concretely, we discuss lower bounds to distances from the…
The state overlap, quantified via $\tr[\rho \sigma]$, is a metric widely used to assess the closeness between two quantum states $\rho$ and $\sigma$. Although global state overlap alone does not directly capture entanglement properties, we…
We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the…
We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two…
The Hilbert-Schmidt distance between two states is proven to be non-contractive under CPTP maps, and therefore is not considered as an entanglement measure. However, that alone does not imply that the minimum Hilbert-Schmidt distance from…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
Measuring the distinguishability between quantum states is a basic problem in quantum information theory. In this paper, we develop optimal quantum algorithms that estimate both the trace distance and the (square root) fidelity between pure…
State discrimination is a useful test problem with which to clarify the power and limitations of different classes of measurement. We consider the problem of discriminating between given states of a bi-partite quantum system via sequential…
We propose a new generalization to quantum states of the Wasserstein distance, which is a fundamental distance between probability distributions given by the minimization of a transport cost. Our proposal is the first where the transport…
We study the discrimination of N mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination…
In quantum information, trace distance is a basic metric of distinguishability between quantum states. However, there is no known efficient approach to estimate the value of trace distance in general. In this paper, we propose efficient…