arXiv subjects

Eric Chitambar

Publications and source records attributed to Eric Chitambar.

At least 91 records · Page 5Linked to original sources

arXiv2015

Accurate Modeling of Reduced-State Dynamics

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. Simple examples demonstrating how restrictions can emerge are presented below. When the system and environment are qubits, we completely characterize the set of unitaries that always generate reduced dynamics capable of being modeled using a consistent Stinespring dilation. Finally, we show how any initial correlations between the system and environment can be certified by observing the system transformation alone during certain joint evolutions.

quant-ph↗

arXiv2015

Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information

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. For each of the above scenarios, strong necessary conditions are derived on the structure of distributions attaining a secret key rate of $I(X:Y|Z)$. In obtaining our results, we completely solve the problem of secret key distillation under scenario (i) and identify $H(S|Z)$ to be the optimal key rate using shared randomness, where $S$ is the Gács-Körner Common Information. We thus provide an operational interpretation of the conditional Gács-Körner Common Information. Additionally, we introduce simple example distributions in which the rate $I(X:Y|Z)$ is achievable if and only if two-way communication is allowed.

quant-ph↗

arXiv2015

A Classical Analog to Entanglement Reversibility

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. We identify the structure of distributions possessing reversible secrecy when one of the honest parties holds a binary distribution, and it is possible that all reversible distributions have this form. These distributions are more general than what is obtained by simply constructing a classical analog to the family of quantum states known to have reversible entanglement. An indispensable tool used in our analysis is a conditional form of the Gács-Körner Common Information.

quant-ph↗

arXiv2014

Asymptotic State Discrimination and a Strict Hierarchy in Distinguishability Norms

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. We then turn to the operational advantage of using two-way classical communication over one-way communication in LOCC processing. With a simple two-qubit product state ensemble, we demonstrate a strict majorization of the two-way LOCC norm over the one-way norm.

quant-ph↗

arXiv2014

The Private and Public Correlation Cost of Three Random Variables with Collaboration

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}$. We obtain a single-letter characterization of the trade-off between public and private bits that are needed to achieve this task. The rate of private bits is shown to generalize Wyner's classic notion of common information held between a pair of random variables. The problem we consider is also closely related to the task of secrecy formation in which $P_{XYZ}$ is generated using public communication and local randomness but with Charlie functioning as an adversary instead of a collaborator. We describe in detail the differences between the collaborative and adversarial scenarios.

quant-ph↗

arXiv2014

Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)

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. Our formalism captures both finite round protocols as well as those that utilize an unbounded number of communication rounds. While the set of LOCC is not topologically closed, we show that finite round LOCC constitutes a compact subset of quantum operations. Additionally we show the existence of an open ball around the completely depolarizing map that consists entirely of LOCC implementable maps. Finally, we demonstrate a two-qubit map whose action can be approached arbitrarily close using LOCC, but nevertheless cannot be implemented perfectly.

quant-ph↗

arXiv2014

Bell Inequalities with Communication Assistance

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. Rev. Lett.} \textbf{90}, 157904 (2003)] who characterized the correlation polytope for $2\times 2$ measurement settings with binary outcomes plus one bit of communication. Here, we derive a complete set of Bell Inequalities for $3\times 2$ measurement settings and a shared bit of communication. When the communication direction is fixed, nine Bell Inequalities characterize the correlation polytope, whereas when the communication direction is bi-directional, 143 inequalities describe the correlations. We then prove a tight lower bound on the amount of communication needed to simulate all no-signaling correlations for a given number of measurement settings.

quant-ph↗

arXiv2013

When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

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. This is surprising considering that \textit{any} two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as "non-locality without entanglement". We next consider an example of $N$ parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant "trine ensemble", and we establish a tight connection between the $N$-copy ensemble and Shor's "lifted" single-copy ensemble. For any finite $N$, we prove that optimal identification of the states cannot be achieved by LOCC; however as $N\to\infty$, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum-error probability is considered.

quant-ph↗

arXiv2013

A Return to the Optimal Detection of Quantum Information

In 1991, Asher Peres and William Wootters wrote a seminal paper on the nonlocal processing of quantum information [\textit{Phys. Rev. Lett.} \textbf{66} 1119 (1991)]. We return to their classic problem and solve it in various contexts. Specifically, for discriminating the "double trine" ensemble with minimum error, we prove that global operations are more powerful than local operations with classical communication (LOCC). Even stronger, there exists a finite gap between the optimal LOCC probability and that obtainable by separable operations (SEP). Additionally we prove that a two-way, adaptive LOCC strategy can always beat a one-way protocol. Our results provide the first known instance of "nonlocality without entanglement" in two qubit pure states.

quant-ph↗

arXiv2012

Increasing Entanglement by Separable Operations and New Monotones for W-type Entanglement

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.e. that of the form $\sqrt{x_0}\ket{00...0}+\sqrt{x_1}\ket{10...0}+...+\sqrt{x_n}\ket{00...1}$). In terms of transformation success probability, we are able to quantify a gap as large as 37% between the two classes. Our work involves constructing new analytic entanglement monotones for W-class states which can increase on average by separable operations. Additionally, we are able to show that the set of LOCC operations, considered as a subset of the most general quantum measurements, is not closed.

quant-ph↗

arXiv2012

Quantum Correlations in Large-Dimensional States of High Symmetry

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. For Werner states, the classical correlations are seen to vanish in high dimensions while the amount of quantum correlations remain bounded and become independent of whether or not the the state is entangled. For pseudo-pure states, nearly the opposite effect is observed with both the quantum and classical correlations growing without bound as the dimension increases and only as the system becomes more entangled. Finally, we verify that pseudo-pure states satisfy the conjecture of [\textit{Phys. Rev. A} \textbf{84}, 052110 (2011)] which says that the Geometric Measure of Discord (GD) always upper bounds the squared Negativity of the state.

quant-ph↗

arXiv2011

Randomly distilling W-class states into general configurations of two-party entanglement

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...0}+\sqrt{x_1}\ket{10...0}+...+\sqrt{x_N}\ket{00...1}$) into maximum entanglement shared between two random parties. Previous studies in random distillation have not considered how the particular choice of target pairs affects the transformation, and here we develop a strategy for distilling into \textit{general} configurations of target pairs. We completely solve the problem of determining the optimal distillation probability for all three qubit configurations and most four qubit configurations when $x_0=0$. Our proof involves deriving new entanglement monotones defined on the set of four qubit W-class states. As an additional application of our results, we present new upper bounds for converting a generic W-class state into the standard W state $\ket{W_N}=\sqrt{\frac{1}{N}}(\ket{10...0}+...+\ket{00...1})$.

quant-ph↗

arXiv2011

Local Transformations Requiring Infinite Rounds of Classical Communication

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. Furthermore, we show that certain entanglement transformations are possible if and only if the protocol uses an infinite (unbounded) number of rounds. Interestingly, the number of rounds required to deterministically distill bipartite entanglement from a single multipartite state can be strongly discontinuous with respect to the amount of entanglement distilled.

quant-ph↗

arXiv2010

Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States

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). A remarkable consequence of these results is that certain multipartite transformations, impossible even probabilistically, can become possible when performed in multiple copy bunches or when assisted by some catalyzing state. This effect is impossible for bipartite pure states.

quant-ph↗

arXiv2010

Two Local Observables are Sufficient to Characterize Maximally Entangled States of N Qubits

Maximally entangled states (MES) represent a valuable resource in quantum information processing. In $N$-qubit systems the MES are $N$-GHZ states, i.e. the collection of $\ket{GHZ_N}=\frac{1}{\sqrt{2}}(\ket{00...0}+\ket{11...1})$ and its local unitary (LU) equivalences. While it is well-known that such states are uniquely stabilized by $N$ commuting observables, in this Letter we consider the minimum number of non-commuting observables needed to characterize an $N$-qubit MES as the unique common eigenstate. Here, we prove that in this general case, any $N$-GHZ state can be uniquely stabilized by only two observables. Thus, for the task of MES certification, only two correlated measurements are required with each party observing the spin of his/her system along one of two directions.

quant-ph↗

arXiv2010

Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States

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. $UA_iV^\dagger=B_i$ for $0\leq i\leq m$ where $U$ and $V$ are unitary and $(A_i, B_i)$ are arbitrary pairs of rectangular matrices. We present a randomized polynomial-time algorithm that solves this problem with an arbitrarily high success probability and outputs transforming matrices $U$ and $V$.

quant-ph↗

arXiv2010

Detecting Multipartite Classical States and their Resemblances

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. A simple analytic method as well as a physical criterion are presented for detecting whether a multipartite state is classical. To decide whether a state is generalized-classical, we provide a semi-definite programming algorithm which can be adapted for use in other unrelated contexts such as signal processing.

quant-ph↗

arXiv2010

Optimal Entanglement Transformations Among N-qubit W-Class States

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]. Here, we provide a simple sufficient and necessary condition for when this upper bound can be satisfied and thus when optimality of state transformation can be achieved. Our discussion involves obtaining lower bounds for the transformation of arbitrary W-class states and showing precisely when this bound saturates the bound of [arXiv:1003.2118v1]. Finally, we consider the question of transforming symmetric W-class states and find that in general, the optimal one-shot procedure for converting two symmetric states requires a non-symmetric filter by all the parties.

quant-ph↗