相关论文: Bounded-Error Quantum State Identification and Exp…

In this paper we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the \emph{perfect} distinguishability…

We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…

Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state…

Quantum state discrimination is a fundamental concept in quantum information theory, which refers to a class of techniques to identify a specific quantum state through a positive operator-valued measure. In this work, we investigate how…

Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding…

In this work we revisit the Boolean Hidden Matching communication problem, which was the first communication problem in the one-way model to demonstrate an exponential classical-quantum communication separation. In this problem, Alice's…

The trade-offs between error probabilities in quantum hypothesis testing are by now well-understood in the centralized setting, but much less is known for distributed settings. Here, we study a distributed binary hypothesis testing problem…

Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question…

This document focuses on translating various information-theoretic measures of distinguishability for probability distributions into measures of distin- guishability for quantum states. These measures should have important appli- cations in…

We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We "almost separate" the models of simultaneous quantum message passing with shared entanglement and the model of…

Quantum state discrimination involves identifying a given state out of a set of possible states. When the states are mutually orthogonal, perfect state discrimination is always possible using a global measurement. In the case of…

We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is conclusive discrimination with a minimum probability of inferring an erroneous result, and the second is…

Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of the former. In particular, there is no known "entanglement…

Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel…

We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of…

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…

Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we…

We study an optimum measurement for quantum state discrimination, which maximizes the probability of correct results when the probability of inconclusive results is fixed at a given value. The measurement describes minimum-error…

Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three…

We prove the existence of (one-way) communication tasks with a subconstant versus superconstant asymptotic gap, which we call "doubly infinite," between their quantum information and communication complexities. We do so by studying the…