Related papers: The complexity of perfect quantum state classifica…
Given a finite set of linearly independent quantum states, an observer who examines a single quantum system may sometimes identify its state with certainty. However, unless these quantum states are orthogonal, there is a finite probability…
We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…
We construct a device that can unambiguously discriminate between two unknown quantum states. The unknown states are provided as inputs, or programs, for the program registers and a third system, which is guaranteed to be prepared in one of…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the…
We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…
We study the local indistinguishability problem of quantum states. By introducing an easily calculated quantity, non-commutativity, we present an criterion which is both necessary and sufficient for the local indistinguishability of a…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…
We consider the problem of quantum state certification, where one is given $n$ copies of an unknown $d$-dimensional quantum mixed state $\rho$, and one wants to test whether $\rho$ is equal to some known mixed state $\sigma$ or else is…
We give a polynomial time algorithm that, given copies of an unknown quantum state $\vert\psi\rangle=U\vert 0^n\rangle$ that is prepared by an unknown constant depth circuit $U$ on a finite-dimensional lattice, learns a constant depth…
We study zero-uncertainty states with quantum memory from an operator-algebraic perspective, which naturally accommodates degenerate projective-valued measurements. In the equal-dimension setting, we prove a rigidity theorem for purity and…
A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
One of the simplest and most effective classical machine learning algorithms is the $k$-nearest neighbors algorithm ($k$NN) which classifies an unknown test state by finding the $k$ nearest neighbors from a set of $M$ train states. Here we…
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we show that "for most practical purposes" one can learn a…
We study the problem of quantum-state tomography under the assumption that the state of the system is close to pure. In this context, an efficient measurements that one typically formulates uniquely identify a pure state from within the set…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\hat{U}$ that transforms a given unknown state $|\psi_\tau\rangle$ to a known fiducial state $|f\rangle$.…
Quantifying the complexity of quantum states is a longstanding key problem in various subfields of science, ranging from quantum computing to the black-hole theory. The lower bound on quantum pure state complexity has been shown to grow…
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e. allow for inconclusive outcomes to occur, then unambiguous discrimination becomes…