Nilanjana Datta - EPFL, Switzerland

Nilanjana Datta
Are you Nilanjana Datta?

Claim your profile, edit publications, add additional information:

Contact Details

Nilanjana Datta
EPFL, Switzerland

Pubs By Year

External Links

Pub Categories

Quantum Physics (50)
Computer Science - Information Theory (9)
Mathematics - Information Theory (9)
Mathematics - Mathematical Physics (7)
Mathematical Physics (7)
Physics - Statistical Mechanics (1)
Statistics - Theory (1)
Mathematics - Operator Algebras (1)
Mathematics - Functional Analysis (1)
Mathematics - Statistics (1)

Publications Authored By Nilanjana Datta

Quantum functional inequalities (e.g. the logarithmic Sobolev- and Poincar\'{e} inequalities) have found widespread application in the study of the behavior of ergodic quantum Markov semigroups. Read More

We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way LOCC. In both cases, the upper bound is based on a convex decomposition of the state into 'useful' and 'useless' quantum states. By 'useful', we mean a state whose distillable entanglement is non-negative and equal to its coherent information (and thus given by a single-letter, tractable formula). Read More

Martingale concentration inequalities constitute a powerful mathematical tool in the analysis of problems in a wide variety of fields ranging from probability and statistics to information theory and machine learning. Here we apply techniques borrowed from this field to quantum hypothesis testing, which is the problem of discriminating quantum states belonging to two different sequences $\{\rho_n\}_{n}$ and $\{\sigma_n\}_n$. We obtain upper bounds on the finite blocklength type II Stein- and Hoeffding errors, which, for i. Read More

We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with $U^c$ being the contragradient representation). Using the theory of group representations, we obtain the spectral decomposition of any such linear map. The eigenvalues and orthogonal projections arising in this decomposition are expressed entirely in terms of representation characteristics of the group $G$. Read More

We consider a quantum generalization of the classical heat equation, and study contractivity properties of its associated semigroup. We prove a Nash inequality and a logarithmic Sobolev inequality. The former leads to an ultracontractivity result. Read More

The $\alpha$-sandwiched R\'enyi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for $\alpha\geq 1/2$. Read More

Quantum Stein's Lemma is a cornerstone of quantum statistics and concerns the problem of correctly identifying a quantum state, given the knowledge that it is one of two specific states ($\rho$ or $\sigma$). It was originally derived in the asymptotic i.i. Read More

We use a R\'enyi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum or classical communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [arXiv:1404. Read More

We obtain a lower bound on the maximum number of qubits, $Q^{n, \varepsilon}({\mathcal{N}})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\varepsilon$. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the {\em{Petz recovery map}} (also known as the {\em{transpose channel}}). Read More

Shannon's entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: $$f(\sqrt{a}\,X + \sqrt{1-a}\,Y) \ge a f(X) + (1-a) f(Y) \quad \forall \, a \in [0,1].$$ Here, $X$ and $Y$ are continuous random variables and the function $f$ is either the differential entropy or the entropy power. K\"onig and Smith [arXiv:1205. Read More

A short quantum Markov chain is a tripartite state $\rho_{ABC}$ such that system $A$ can be recovered perfectly by acting on system $C$ of the reduced state $\rho_{BC}$. Such states have conditional mutual information $I(A;B|C)$ equal to zero and are the only states with this property. A quantum channel $\mathcal{N}$ is sufficient for two states $\rho$ and $\sigma$ if there exists a recovery channel using which one can perfectly recover $\rho$ from $\mathcal{N}(\rho)$ and $\sigma$ from $\mathcal{N}(\sigma)$. Read More

State redistribution is the protocol in which, given an arbitrary tripartite quantum state, with two of the subsystems initially being with Alice and one being with Bob, the goal is for Alice to send one of her subsystems to Bob, possibly with the help of prior shared entanglement. We derive an upper bound on the second order asymptotic expansion for the quantum communication cost of achieving state redistribution with a given finite accuracy. In proving our result, we also obtain an upper bound on the quantum communication cost of this protocol in the one-shot setting, by using the protocol of coherent state merging as a primitive. Read More

The crucial feature of a memoryless stochastic process is that any information about its state can only decrease as the system evolves. Here we show that such a decrease of information is equivalent to the underlying stochastic evolution being divisible. The main result, which holds for both classical and quantum stochastic processes, rely on a quantum version of the so-called Blackwell-Sherman-Stein theorem in classical statistics. Read More

The simplest example of a quantum information source with memory is a mixed source which emits signals entirely from one of two memoryless quantum sources with given a priori probabilities. Considering a mixed source consisting of a general one-parameter family of memoryless sources, we derive the second order asymptotic rate for fixed-length visible source coding. Furthermore, we specialize our main result to a mixed source consisting of two memoryless sources. Read More

The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms of the quantum mutual information and does not increase in the presence of a noiseless quantum feedback channel from receiver to sender. In this work, we investigate second-order asymptotics of the entanglement-assisted classical communication task. That is, we consider how quickly the rates of entanglement-assisted codes converge to the entanglement-assisted classical capacity of a channel as a function of the number of channel uses and the error tolerance. Read More

We introduce a guessing game involving a quantum channel, three parties - the sender, the receiver and an eavesdropper, Eve - and a quantum public side channel. We prove that a necessary and sufficient condition for the quantum channel to be antidegradable, is that Eve wins the game. We thus obtain a complete operational characterization of antidegradable channels in a game-theoretic framework. Read More

We introduce two variants of the information spectrum relative entropy defined by Tomamichel and Hayashi which have the particular advantage of satisfying the data-processing inequality, i.e. monotonicity under quantum operations. Read More

We consider a two-parameter family of R\'enyi relative entropies $D_{\alpha,z}(\rho||\sigma)$ that are quantum generalisations of the classical R\'enyi divergence $D_{\alpha}(p||q)$. This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum R\'enyi divergences, as well as the quantum R\'enyi relative entropies. All its members satisfy the quantum generalizations of R\'enyi's axioms for a divergence. Read More

Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's theorem. Here we establish a series of properties of subentropy, paralleling the well-developed analogous theory for von Neumann entropy. Further, we show that subentropy is a lower bound for min-entropy. Read More

Recently, an interesting quantity called the quantum Renyi divergence (or "sandwiched" Renyi relative entropy) was defined for pairs of positive semi-definite operators $\rho$ and $\sigma$. It depends on a parameter $\alpha$ and acts as a parent quantity for other relative entropies which have important operational significances in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Renyi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. Read More

We generalize the notion of the best separable approximation (BSA) and best W-class approximation (BWA) to arbitrary pure state entanglement measures, defining the best zero-$E$ approximation (BEA). We show that for any polynomial entanglement measure $E$, any mixed state $\rho$ admits at least one "$S$-decomposition," i.e. Read More

We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known expression for the entanglement-assisted quantum rate distortion function for asymptotically many copies of a memoryless quantum information source. Read More

We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding with the help of a classical side channel. Our result here is that the regularized entanglement of formation characterizes the quantum rate distortion function, extending earlier work of Devetak and Berger. Read More

We establish a theory of quantum-to-classical rate distortion coding. In this setting, a sender Alice has many copies of a quantum information source. Her goal is to transmit classical information about the source, obtained by performing a measurement on it, to a receiver Bob, up to some specified level of distortion. Read More

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data compression, and the source-channel separation theorem implies that a two-stage protocol consisting of compression and channel coding is optimal for transmitting a memoryless source over a memoryless channel. In spite of their importance in the classical domain, there has been surprisingly little work in these areas for quantum information theory. Read More

We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum hypothesis testing in terms of the smooth max-relative entropy of the two states representing the two hypotheses. Using then a relative entropy version of the Quantum Asymptotic Equipartition Property (QAEP), we can recover the strong converse rate of the i. Read More

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Read More

We establish bounds on the maximum entanglement gain and minimum quantum communication cost of the Fully Quantum Slepian-Wolf protocol in the one-shot regime, which is considered to be at the apex of the existing family tree in Quantum Information Theory. These quantities, which are expressed in terms of smooth min- and max-entropies, reduce to the known rates of quantum communication cost and entanglement gain in the asymptotic i.i. Read More

We evaluate the one-shot entanglement of assistance for an arbitrary bipartite state. This yields another interesting result, namely a characterization of the one-shot distillable entanglement of a bipartite pure state. This result is shown to be stronger than that obtained by specializing the one-shot hashing bound to pure states. Read More

We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under which Alice's messages can be inferred correctly by Bob, and yet Eve learns nothing about them. The code is universal in the sense that it does not depend on specific knowledge of the channel. Read More

We obtain the general formula for the optimal rate at which singlets can be distilled from any given noisy and arbitrarily correlated entanglement resource, by means of local operations and classical communication (LOCC). Our formula, obtained by employing the quantum information spectrum method, reduces to that derived by Devetak and Winter, in the special case of an i.i. Read More

We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can only be achieved approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Read More

We obtain expressions for the optimal rates of one- shot entanglement manipulation under operations which generate a negligible amount of entanglement. As the optimal rates for entanglement distillation and dilution in this paradigm, we obtain the max- and min-relative entropies of entanglement, the two logarithmic robustnesses of entanglement, and smoothed versions thereof. This gives a new operational meaning to these entanglement measures. Read More

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. Read More

We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity, but replacing the relative entropy with the Hoeffding distance. Similarly, our upper bound is in terms of a quantity obtained by replacing the relative entropy with the recently introduced max-relative entropy in the definition of the divergence radius of a channel. Read More

Properties of the max- relative entropy of entanglement are investigated, and its significance as an upper bound to the one shot rate for perfect entanglement dilution, under a particular class of quantum operations, is discussed. It is shown that it is in fact equal to another known entanglement monotone, namely the log robustness. It is known that the latter is not asymptotically continuous and it is not known whether it is weakly additive. Read More

Two new relative entropy quantities, called the min- and max-relative entropies, are introduced and their properties are investigated. The well-known min- and max- entropies, introduced by Renner, are obtained from these. We define a new entanglement monotone, which we refer to as the max-relative entropy of entanglement, and which is an upper bound to the relative entropy of entanglement. Read More

Many of the traditional results in information theory, such as the channel coding theorem or the source coding theorem, are restricted to scenarios where the underlying resources are independent and identically distributed (i.i.d. Read More

The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the capacity is expressed in terms of the communicating classes of the Markov chain. For an irreducible and aperiodic Markov chain, the channel is forgetful, and one retrieves the known expression for the capacity. Read More

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. Read More

The entanglement cost of arbitrary sequences of bipartite states is shown to be expressible as the minimization of a conditional spectral entropy rate over sequences of separable extensions of the states in the sequence. The expression is shown to reduce to the regularized entanglement of formation when the n-th state in the sequence consists of n copies of a single bipartite state. Read More

Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the states. In this paper, different asymptotic measures of entanglement assigned to arbitrary sequences of bipartite pure states are shown to coincide only when the sequence is information stable, in terms of the quantum spectral information rates of the sequence of subsystem states. Read More

In this paper we consider the transmission of classical information through a class of quantum channels with long-term memory, which are given by convex combinations of product channels. Hence, the memory of such channels is given by a Markov chain which is aperiodic but not irreducible. We prove the coding theorem and weak converse for this class of channels. Read More

The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum channels. Read More

The information spectrum approach gives general formulae for optimal rates of codes in many areas of information theory. In this paper the quantum spectral divergence rates are defined and properties of the rates are derived. The entropic rates, conditional entropic rates, and spectral mutual information rates are then defined in terms of the spectral divergence rates. Read More

In this paper we use the method of a recent paper (quant-ph/0509101) to compute complementary channels for certain important cases, such as depolarizing and transpose-depolarizing channels. This method allows us to easily obtain the minimal Kraus representations from non--minimal ones. We also study the properties of the output purity of the tensor product of a channel and its complement. Read More

We consider generalizations of depolarizing channels to maps in which the identity channel is replaced by a convex combinations of unitary conjugations. We show that one can construct unital channels of this type for which the input which achieves maximal output purity is unique. We give conditions under which multiplicativity of the maximal p-norm and additivity of the minimal output entropy. Read More

Additivity of the minimal output entropy for the family of transpose depolarizing channels introduced by Fannes et al. [quant-ph/0410195] is considered. It is shown that using the method of our previous paper [quant-ph/0403072] allows us to prove the additivity for the range of the parameter values for which the problem was left open in [quant-ph/0410195]. Read More

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. Read More

Recently, King and Ruskai [1] conjectured that the maximal p-norm of the Werner--Holevo channel is multiplicative for all $1\le p \le 2$. In this paper we prove this conjecture. Our proof relies on certain convexity and monotonicity properties of the p--norm. Read More