Related papers: Bounded-Error Quantum State Identification and Exp…
The discrimination of quantum states is a central problem in quantum information science and technology. Meanwhile, partial post-selection has emerged as a valuable tool for quantum state engineering. In this work, we bring these two areas…
Quantum state discrimination is a central problem in quantum measurement theory, with applications spanning from quantum communication to computation. Typical measurement paradigms for state discrimination involve a minimum probability of…
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…
We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states \sigma_1,...,\sigma_r. By splitting up the overall test into multiple binary tests in various ways we obtain a number of…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree…
Irreversibility between preparation and discrimination processes is manifested in the indistinguishability of orthogonal product states via local operations and classical communication (LOCC). Characterizing quantum properties for sets of…
We investigate the ability of a quantum measurement device to discriminate two states or, generically, two hypothesis. In full generality, the measurement can be performed a number $n$ of times, and arbitrary pre-processing of the states…
Any bipartite quantum state has quasi-probability representations in terms of separable states. For entangled states these quasi-probabilities necessarily exhibit negativities. Based on the general structure of composite quantum states, one…
We introduce a framework for distributed quantum inference under communication constraints. In our model, $m$ distributed nodes each receive one copy of an unknown $d$-dimensional quantum state $\rho$, before communicating via a constrained…
We study the procedure for sequential unambiguous state discrimination. A qubit is prepared in one of two possible states, and measured by two observers Bob and Charlie sequentially. A necessary condition for the state to be unambiguously…
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must…
We study the communication complexity of welfare maximization in combinatorial auctions with $m$ items and two subadditive bidders. A $\frac{1}{2}$-approximation can be guaranteed by a trivial randomized protocol with zero communication, or…
The CONGEST and CONGEST-CLIQUE models have been carefully studied to represent situations where the communication bandwidth between processors in a network is severely limited. Messages of only $O(log(n))$ bits of information each may be…
We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three…
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…
Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is…
Quantum information processing using linear optics is challenging due to the limited set of deterministic operations achievable without using complicated resource-intensive methods. While techniques such as the use of ancillary photons can…