Bipartite entanglement is one of the fundamental quantifiable resources of quantum information theory. We propose a new application of this resource to the theory of quantum measurements. According to Naimark's theorem any rank 1 generalised measurement (POVM) M may be represented as a von Neumann measurement in an extended (tensor product) space of the system plus ancilla. By considering a suitable average of the entanglements of these measurement directions and minimising over all Naimark extensions, we define a notion of entanglement cost E_{\min}(M) of M. We give a constructive means of characterising all Naimark extensions of a given POVM. We identify various classes of POVMs with zero and non-zero cost and explicitly characterise all POVMs in 2 dimensions having zero cost. We prove a constant upper bound on the entanglement cost of any POVM in any dimension. Hence the asymptotic entanglement cost (i.e. the large n limit of the cost of n applications of M, divided by n) is zero for all POVMs. The trine measurement is defined by three rank 1 elements, with directions symmetrically placed around a great circle on the Bloch sphere. We give an analytic expression for its entanglement cost. Defining a normalised cost of any $d$ -dimensional POVM by E_{\min} (M)/\log_2 d, we show (using a combination of analytic and numerical techniques) that the trine measurement is more costly than any other POVM with d>2, or with d=2 and ancilla dimension 2. This strongly suggests that the trine measurement is the most costly of all POVMs.Bipartite entanglement is one of the fundamental quantifiable resources of quantum information theory. We propose a new application of this resource to the theory of quantum measurements. According to Naimark's theorem any rank 1 generalised measurement (POVM) M may be represented as a von Neumann measurement in an extended (tensor product) space of the system plus ancilla. By considering a suitable average of the entanglements of these measurement directions and minimising over all Naimark extensions, we define a notion of entanglement cost E_{\min}(M) of M. We give a constructive means of characterising all Naimark extensions of a given POVM. We identify various classes of POVMs with zero and non-zero cost and explicitly characterise all POVMs in 2 dimensions having zero cost. We prove a constant upper bound on the entanglement cost of any POVM in any dimension. Hence the asymptotic entanglement cost (i.e. the large n limit of the cost of n applications of M, divided by n) is zero for all POVMs. The trine measurement is defined by three rank 1 elements, with directions symmetrically placed around a great circle on the Bloch sphere. We give an analytic expression for its entanglement cost. Defining a normalised cost of any $d$-dimensional POVM by E_{\min} (M)/\log_2 d, we show (using a combination of analytic and numerical techniques) that the trine measurement is more costly than any other POVM with d>2, or with d=2 and ancilla dimension 2. This strongly suggests that the trine measurement is the most costly of all POVMs.

Quantum Information and ComputationJan 1, 200314 citations

Entanglement cost of generalised measurements

JozsaRichard, KoashiMasato, LindenNoah +4 more

Quantum Information and ComputationSep 1, 20031 citation

Entanglement cost of discriminating quantum states under locality constraints

Chenghong Zhu, Chengkai Zhu, Zhiping Liu +1 more

The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measurements yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two bipartite quantum states, employing positive operator-valued measures (POVMs) with positive partial transpose (PPT) to achieve optimal success probability through general entangled measurements. First, we introduce an efficiently computable quantity called the spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show that it can be a lower bound for the entanglement cost of optimal discrimination by PPT POVMs. Second, we establish an upper bound on the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging this result, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measurements yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two bipartite quantum states, employing positive operator-valued measures (POVMs) with positive partial transpose (PPT) to achieve optimal success probability through general entangled measurements. First, we introduce an efficiently computable quantity called the spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show that it can be a lower bound for the entanglement cost of optimal discrimination by PPT POVMs. Second, we establish an upper bound on the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging this result, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.

arXiv:2402.18446Feb 28, 20240 citations

Entanglement cost of discriminating quantum states under locality constraints

Chenghong Zhu, Chengkai Zhu, Zhiping Liu +1 more

The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measure-ments yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two quantum states, employing positive operator-valued measures (POVMs) with positive partial trans-pose (PPT) to achieve optimal success probability through general entangled measurements. First, we introduce an efficiently com-putable quantity called the spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show that it can be a lower bound for the entanglement cost of optimal discrimination by PPT POVMs. Second, we establish an upper bound on the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging this result, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measure-ments yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two quantum states, employing positive operator-valued measures (POVMs) with positive partial trans-pose (PPT) to achieve optimal success probability through general entangled measurements. First, we introduce an efficiently com-putable quantity called the spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show that it can be a lower bound for the entanglement cost of optimal discrimination by PPT POVMs. Second, we establish an upper bound on the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging this result, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.

IEEE International Symposium on Information Theory (ISIT)Jul 7, 20243 citations

Entanglement Cost for Infinite-Dimensional Physical Systems

Hayata Yamasaki, Kohdai Kuroiwa, Patrick M. Hayden +1 more

. This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure-the entanglement cost-for all infinite-dimensional physical systems.. This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure-the entanglement cost-for all infinite-dimensional physical systems.

arXiv:2401.09554Communications in Mathematical PhysicsOct 3, 20258 citations

Tensor norms and the classical communication complexity of nonlocal quantum measurement

Yaoyun Shi

Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.

ACM Symposium on Theory of Computing (STOC)May 22, 20055 citations

d

-dimensional POVM by E_{\min} (M)/\log_2 d, we show (using a combination of analytic and numerical techniques) that the trine measurement is more costly than any other POVM with d>2, or with d=2 and ancilla dimension 2. This strongly suggests that the trine measurement is the most costly of all POVMs.