Related papers: On the distinguishability of random quantum states
The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of…
We consider differentially private approximate singular vector computation. Known worst-case lower bounds show that the error of any differentially private algorithm must scale polynomially with the dimension of the singular vector. We are…
The quantum component in uncertainty relation can be naturally characterized by the quantum coherence of a quantum state, which is of paramount importance in quantum information science. Here, we experimentally investigate quantum…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system…
We investigate a state discrimination problem in operationally the most general framework to use a probability, including both classical, quantum theories, and more. In this wide framework, introducing closely related family of ensembles…
We show a geometric formulation for minimum-error discrimination of qubit states, that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal…
We study the distinguishability of bipartite quantum states by Positive Operator-Valued Measures with positive partial transpose (PPT POVMs). The contributions of this paper include: (1). We give a negative answer to an open problem of [M.…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
We study the fundamental problem of estimating an unknown discrete distribution $p$ over $d$ symbols, given $n$ i.i.d. samples from the distribution. We are interested in minimizing the KL divergence between the true distribution and the…
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…
We study entanglement-related properties of random quantum states which are unitarily invariant, in the sense that their distribution is left unchanged by conjugation with arbitrary unitary operators. In the large matrix size limit, the…
We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to…
We address the problem of unambiguously identifying the state of a probe qudit with the state of one of d reference qudits. The reference states are assumed pure and linearly independent but we have no knowledge of them. The state of the…
In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Ac\'in, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success…
This paper considers the problem of distinguishing between classical and quantum domains in macroscopic phenomena using tests based on probability and it presents a condition on the ratios of the outcomes being the same (Ps) to being…
A universal programmable discriminator can perform the discrimination between two unknown states, and the optimal solution can be approached via the discrimination between the two averages over the uniformly distributed unknown input pure…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement,…