S. Virmani

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distancelike measures of multipartite entanglement.

Optimal local discrimination of two multipartite pure states

In a recent paper, Walgate et. al. [1] demonstrated that any two orthogonal multipartite pure states can be optimally distinguished using only local operations. We utilise their result to show that this is true for any two multiparty pure states, in the sense of inconclusive discrimination. There are also certain regimes of conclusive discrimination for which the same also applies, although we can only conjecture that the result is true for all conclusive regimes. We also discuss a class of states that can be distinguished locally according to any discrimination measure, as they can be locally recreated in the possession of one party. A consequence of this is that any two maximally entangled states can always be optimally discriminated locally, according to any figure of merit.

Ordering states with entanglement measures

We demonstrate that all good asymptotic entanglement measures are either identical or place a different ordering on the set of all quantum states.

Asymptotic Relative Entropy of Entanglement

We present an analytical formula for the asymptotic relative entropy of entanglement with respect to positive partial transpose states for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. This is the first case in which the asymptotic value of a subadditive entanglement measure has been calculated.

Operator monotones, the reduction criterion and the relative entropy

We introduce the theory of operator monotone functions and employ it to derive a new inequality relating the quantum relative entropy and the quantum conditional entropy. We present applications of this new inequality and, in particular, we prove a new lower bound on the relative entropy of entanglement and other properties of entanglement measures.

Transition behavior in the channel capacity of two-quibit channels with memory

We prove that a general upper bound on the maximal mutual information of quantum channels is saturated in the case of Pauli channels with an arbitrary degree of memory. For a subset of such channels we explicitly identify the optimal signal states. We show analytically that for such a class of channels entangled states are indeed optimal above a given memory threshold. It is noteworthy that the resulting channel capacity is a non-differentiable function of the memory parameter.

Spin chains and channels with memory.

In most studies of quantum channels, it is assumed that the errors in each use of the channel are independent. However, recent investigations of the effect of memory or correlations in error have led to speculation that nonanalytic behavior may occur in the capacity. Motivated by these observations, we connect the study of channels with correlated error to the study of many-body systems. This enables us to use many-body theory to solve some interesting models of correlated error. These models can display nonanalyticities analogous to quantum phase transitions.

Classical simulability, entanglement breaking, and quantum computation thresholds

We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modeled classically. This question is useful for providing upper bounds on fault-tolerant thresholds, and for understanding the nature of the quantum-classical computational transition. We refine some previously known upper bounds using two different strategies. The first one involves the introduction of bientangling operations, a class of classically simulable machines that can generate at most bipartite entanglement. Using this class we show that it is possible to sharpen previously obtained upper bounds in certain cases. As an example, we show that under depolarizing noise on the controlled-NOT gate, the previously known upper bound of 74% can be sharpened to around 67%. Another interesting consequence is that measurement-based schemes cannot work using only two-qubit nondegenerate projections. In the second strand of the work we utilize the Gottesman-Knill theorem on the classically efficient simulation of Clifford group operations. The bounds attained using this approach for the {pi}/8 gate can be as low as 15% for general single-gate noise, and 30% for dephasing noise.

Tripartite entanglement and quantum relative entropy

We establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.

Many-body physics and the capacity of quantum channels with memory

In most studies of the capacity of quantum channels, it is assumed that the errors in the use of each channel are independent. However, recent work has begun to investigate the effects of memory or correlations in the error, and has led to suggestions that there can be interesting non-analytic behaviour in the capacity of such channels. In a previous paper, we pursued this issue by connecting the study of channel capacities under correlated error to the study of critical behaviour in many-body physics. This connection enables the use of techniques from many-body physics to either completely solve or understand qualitatively a number of interesting models of correlated error with analogous behaviour to associated many-body systems. However, in order for this approach to work rigorously, there are a number of technical properties that need to be established for the lattice systems being considered. In this paper, we discuss these properties in detail, and establish them for some classes of many-body system.