Eric Chitambar

Eric Chitambar
Are you Eric Chitambar?

Claim your profile, edit publications, add additional information:

Contact Details

Eric Chitambar

Pubs By Year

Pub Categories

Quantum Physics (31)
Computer Science - Information Theory (3)
Mathematics - Information Theory (3)
Computer Science - Cryptography and Security (1)

Publications Authored By Eric Chitambar

A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication rounds needed to perform the locality-constrained task of entanglement transformation and the analogous classical task of secrecy manipulation. Specifically we address whether bipartite mixed entanglement can always be converted into pure entanglement or whether unsecure classical correlations can always be transformed into secret shared randomness using local operations and a bounded number of communication exchanges. Read More

Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. Recently, it has been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. Read More

Considerable work has recently been directed toward developing resource theories of quantum coherence. In most approaches, a state is said to possess quantum coherence if it is not diagonal in some specified basis. In this letter we establish a criterion of physical consistency for any resource theory in terms of physical implementation of the free operations, and we show that all currently proposed basis-dependent theories of coherence fail to satisfy this criterion. Read More

Given a set of multipartite entangled states, can we find a common state to prepare them by local operations and classical communication? Such a state, if exists, will be a common resource for the given set of states. We completely solve this problem for bipartite pure states case by explicitly constructing a unique optimal common resource state for any given set of states. In the multipartite setting, the general problem becomes quite complicated, and we focus on finding nontrivial common resources for the whole multipartite state space of given dimensions. Read More

We consider the extraction of shared secret key from correlations that are generated by either a classical or quantum source. In the classical setting, two honest parties (Alice and Bob) use public discussion and local randomness to distill secret key from some distribution $p_{XYZ}$ that is shared with an unwanted eavesdropper (Eve). In the quantum settings, the correlations $p_{XYZ}$ are delivered to the parties as either an \textit{incoherent} mixture of orthogonal quantum states or as \textit{coherent} superposition of such states; in both cases, Alice and Bob use public discussion and local quantum operations to distill secret key. Read More

We propose a free-space reconfigurable quantum key distribution (QKD) network to secure communication among mobile users. Depends on the trustworthiness of the network relay, the users can implement either the highly secure measurement-device-independent QKD, or the highly efficient decoy state BB84 QKD. Based on the same quantum infrastructure, we also propose a loss tolerant quantum position verification scheme, which could allow the QKD users to initiate the QKD process without relying on pre-shared key. Read More

Quantum coherence and quantum entanglement represent two fundamental features of non-classical systems that can each be characterized within an operational resource theory. In this paper, we unify the resource theories of entanglement and coherence by studying their combined behavior in the operational setting of local incoherent operations and classical communication (LIOCC). Specifically we analyze the coherence and entanglement trade-offs in the tasks of state formation and resource distillation. Read More

In this paper we return to the problem of reduced-state dynamics in the presence of an interacting environment. The question we investigate is how to appropriately model a particular system evolution given some knowledge of the system-environment interaction. When the experimenter takes into account certain known features of the interaction such as its invariant subspaces or its non-local content, it may not be possible to consistently model the system evolution over a certain time interval using a standard Stinespring dilation, which assumes the system and environment to be initially uncorrelated. Read More

In this paper we consider the problem of extracting secret key from an eavesdropped source $p_{XYZ}$ at a rate given by the conditional mutual information. We investigate this question under three different scenarios: (i) Alice ($X$) and Bob ($Y$) are unable to communicate but share common randomness with the eavesdropper Eve ($Z$), (ii) Alice and Bob are allowed one-way public communication, and (iii) Alice and Bob are allowed two-way public communication. Distributions having a key rate of the conditional mutual information are precisely those in which a "helping" Eve offers Alice and Bob no greater advantage for obtaining secret key than a fully adversarial one. Read More

In this letter we introduce the problem of secrecy reversibility. This asks when two honest parties can distill secret bits from some tripartite distribution $p_{XYZ}$ and transform secret bits back into $p_{XYZ}$ at equal rates using local operation and public communication (LOPC). This is the classical analog to the well-studied problem of reversibly concentrating and diluting entanglement in a quantum state. Read More

In this paper we consider the problem of generating arbitrary three-party correlations from a combination of public and secret correlations. Two parties -- called Alice and Bob -- share perfectly correlated bits that are secret from a collaborating third party, Charlie. At the same time, all three parties have access to a separate source of correlated bits, and their goal is to convert these two resources into multiple copies of some given tripartite distribution $P_{XYZ}$. Read More

In this paper we consider the possible correlations between two parties using local machines and shared randomness with an additional amount of classical communication. This is a continuation of the work initiated by Bacon and Toner in Ref. [\textit{Phys. Read More

In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state discrimination, and we derive necessary conditions for when two multipartite states of any size can be discriminated perfectly by asymptotic LOCC. We use this new criterion to prove a gap in the LOCC and separable distinguishability norms. Read More

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 problem of two-qubit ensembles - both for separable operations and LOCC - by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then for the well-known task of minimum error discrimination, it is shown that \textit{almost all} two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. Read More

In 1991, Asher Peres and William Wootters wrote a seminal paper on the nonlocal processing of quantum information [\textit{Phys. Rev. Lett. Read More

In this paper we study the subset of generalized quantum measurements on finite dimensional systems known as local operations and classical communication (LOCC). While LOCC emerges as the natural class of operations in many important quantum information tasks, its mathematical structure is complex and difficult to characterize. Here we provide a precise description of LOCC and related operational classes in terms of quantum instruments. Read More

In this article, we investigate how quantum correlations behave for the so-called Werner and pseudo-pure families of states. The latter refers to states formed by mixing any pure state with the totally mixed state. We derive closed expressions for the Quantum Discord (QD) and the Relative Entropy of Quantumness (REQ) for these families of states. Read More

The class of local operations and classical communication (LOCC) pertains to an important measurement scenario in many quantum communication schemes. While LOCC belongs to the more general class of separable operations (SEP), the exact difference between the two remains a challenging open problem. In this article, we seek to better understand the structure of LOCC and its relationship to SEP by comparing their respective abilities for distilling EPR entanglement from one copy of an $N$-qubit W-class state (i. Read More

In this article we obtain new results for the task of converting a \textit{single} $N$-qubit W-class state (of the form $\sqrt{x_0}\ket{00... Read More

In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more rounds of classical communication are permitted. Specifically, for every $n$, there always exists an $n$ round protocol that is impossible to implement in $n-2$ rounds. Read More

Maximally entangled states (MES) represent a valuable resource in quantum information processing. In $N$-qubit systems the MES are $N$-GHZ states, i.e. Read More

In this brief report, we consider the equivalence between two sets of $m+1$ bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree $m$ matrix polynomials are unitarily equivalent; i.e. Read More

We investigate the physically allowed probabilities for transforming one N-partite W-class state to another by means of local operations assisted with classical communication (LOCC). Recently, Kintas and Turgut have obtained an upper bound for the maximum probability of transforming two such states [arXiv:1003.2118v1]. Read More

We study various types of multipartite states lying near the quantum-classical boundary. The class of so-called classical states are precisely those in which each party can perform a projective measurement to identify a locally held state without disturbing the global state, a task known as non-disruptive local state identification (NDLID). We introduce a new class of states called generalized-classical states which allow for NDLID when the most general quantum measurements are permitted. Read More

The tensor rank (also known as generalized Schmidt rank) of multipartite pure states plays an important role in the study of entanglement classifications and transformations. We employ powerful tools from the theory of homogeneous polynomials to investigate the tensor rank of symmetric states such as the tripartite state $\ket{W_3}=\tfrac{1}{\sqrt{3}}(\ket{100}+\ket{010}+\ket{001})$ and its $N$-partite generalization $\ket{W_N}$. Previous tensor rank estimates are dramatically improved and we show that (i) three copies of $\ket{W_3}$ has rank either 15 or 16, (ii) two copies of $\ket{W_N}$ has rank $3N-2$, and (iii) $n$ copies of $\ket{W_N}$ has rank O(N). Read More

In our earlier posting "Matrix Pencils and Entanglement Classification", arXiv:0911.1803, we gave a polynomial-time algorithm for deciding if two states in a space of dimension $2\otimes m\otimes n$ are SLOCC equivalent. In this note, we point out that a straightforward modification of the algorithm gives a simple enumeration of all SLOCC equivalence classes in the same space, with the class representatives expressed in the Kronecker canonical normal form of matrix pencils. Read More

In this paper, we study pure state entanglement in systems of dimension $2\otimes m\otimes n$. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. Read More

Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its non-additivity as an entanglement measure has recently been observed. In this note, we estimate the tensor rank of multiple copies of the tripartite state $\ket{W}=\tfrac{1}{\sqrt{3}}(\ket{100}+\ket{010}+\ket{001})$. Read More

We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartite entanglement transformations. Read More

For manipulations of multipartite quantum systems, it was well known that all local operations assisted by classical communication (LOCC) constitute a proper subset of the class of separable operations. Recently, Gheorghiu and Griffiths found that LOCC and general separable operations are equally powerful for transformations between bipartite pure states. In this letter we extend this comparison to mixed states and show that in general separable operations are strictly stronger than LOCC when transforming a mixed state to a pure entangled state. Read More

Understanding the nature of multipartite entanglement is a central mission of quantum information theory. To this end, we investigate the question of tripartite entanglement convertibility. We find that there exists no easy criterion to determine whether a general tripartite transformation can be performed with a nonzero success probability and in fact, the problem is NP-hard. Read More