Related papers: How many copies are needed for state discriminatio…
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
We introduce and implement a technique to extend the quantum computational power of cluster states by replacing some projective measurements with generalized quantum measurements (POVMs). As an experimental demonstration we fully realize an…
Although some non-trivial photon number resolving detectors exist, it may still be convenient to discriminate photon number states with the method of multiplexed detection. Multiplexing can be performed with paths in real space, with paths…
Probabilistically creating n perfect clones from m copies for one of N priori known quantum states with minimum failure probability is a long-standing problem. We provide a rigorous proof for the geometric approach to this probabilistic…
We show how to optimally discriminate between K distinct quantum states, of which N copies are available, using one-at-a-time interactions with each of the N copies. While this task (famously) requires joint measurements on all N copies, we…
Noncommutativity of states and observables is a fundamental signature of quantum theory, and a minimal requirement for nonclassicality. We provide a universal necessary and sufficient condition for pairwise commutativity of quantum states…
Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approximations in the knowledge…
Let (\{| \psi> ,| \phi>}) be an incomparable pair of states ((| \psi \nleftrightarrow | \phi>)), \emph, i.e., (| \psi>) and (| \phi>) cannot be transformed to each other with probability one by local transformations and classical…
The minimum error discrimination problem for ensembles of linearly independent pure states are known to have an interesting structure; for such a given ensemble the optimal POVM is given by the pretty good measurment of another ensemble…
We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution…
The optimization conditions for minimum error discrimination of linearly independent pure states comprise of two kinds: stationary conditions over the space of rank one projective measurements and the global maximization conditions. A…
In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of two given and completely known states, rho or sigma. In…
In this paper, we consider the LOCC distinguishability of product states. We employ polygons to analyze orthogonal product states in any system to show that with LOCC protocols, to distinguish seven orthogonal product states, one can…
We experimentally implement a machine-learning method for accurately identifying unknown pure quantum states. The method, called single-shot measurement learning, achieves the theoretical optimal accuracy for $\epsilon = O(N^{-1})$ in state…
Quantum state exclusion is the task of identifying at least one state from a known set that was not used in the preparation of a quantum system. A set of quantum states is said to admit state exclusion if there exists a measurement whose…
In probabilistic nonadaptive group testing (PGT), we aim to characterize the number of pooled tests necessary to identify a random $k$-sparse vector of defectives with high probability. Recent work has shown that $n$ tests are necessary…
Quantum fidelity is a measure to quantify the closeness of two quantum states. In an operational sense, it is defined as the minimal overlap between the probability distributions of measurement outcomes and the minimum is taken over all…
Quantum state tomography is a fundamental problem in quantum computing. Given $n$ copies of an unknown $N$-qubit state $\rho \in \mathbb{C}^{d \times d},d=2^N$, the goal is to learn the state up to an accuracy $\epsilon$ in trace distance,…
Let $V$ be a set of $n$ points on the real line. Suppose that each pairwise distance is known independently with probability $p$. How much of $V$ can be reconstructed up to isometry? We prove that $p = (\log n)/n$ is a sharp threshold for…
Particle filters (PFs) form a class of Monte Carlo algorithms that propagate over time a set of $N\geq 1$ particles which can be used to estimate, in an online fashion, the sequence of filtering distributions $(\hat{\eta}_t)_{t\geq 1}$…