Searcharxiv⌕ Search

arXiv subjects

Nolan R. Wallach

Publications and source records attributed to Nolan R. Wallach.

25 records · Page 2Linked to original sources

Necessary and sufficient conditions for local manipulation of multipartite pure quantum states

Suppose several parties jointly possess a pure multipartite state, |ψ>. Using local operations on their respective systems and classical communication (i.e. LOCC) it may be possible for the parties to transform deterministically |ψ> into another joint state |ϕ>. In the bipartite case, Nielsen majorization theorem gives the necessary and sufficient conditions for this process of entanglement transformation to be possible. In the multipartite case, such a deterministic local transformation is possible only if both the states in the same stochastic LOCC (SLOCC) class. Here we generalize Nielsen majorization theorem to the multipartite case, and find necessary and sufficient conditions for the existence of a local separable transformation between two multipartite states in the same SLOCC class. When such a deterministic conversion is not possible, we find an expression for the maximum probability to convert one state to another by local separable operations. In addition, we find necessary and sufficient conditions for the existence of a separable transformation that converts a multipartite pure state into one of a set of possible final states all in the same SLOCC class. Our results are expressed in terms of (1) the stabilizer group of the state representing the SLOCC orbit, and (2) the associate density matrices (ADMs) of the two multipartite states. The ADMs play a similar role to that of the reduced density matrices, when considering local transformations that involves pure bipartite states. We show in particular that the requirement that one ADM majorize another is a necessary condition but in general far from being also sufficient as it happens in the bipartite case.

quant-ph↗

All Maximally Entangled Four Qubits States

We find an operational interpretation for the 4-tangle as a type of residual entanglement, somewhat similar to the interpretation of the 3-tangle. Using this remarkable interpretation, we are able to find the class of maximally entangled four-qubits states which is characterized by four real parameters. The states in the class are maximally entangled in the sense that their average bipartite entanglement with respect to all possible bi-partite cuts is maximal. We show that while all the states in the class maximize the average tangle, there are only few states in the class that maximize the average Tsillas or Renyi $α$-entropy of entanglement. Quite remarkably, we find that up to local unitaries, there exists two unique states, one maximizing the average $α$-Tsallis entropy of entanglement for all $α\geq 2$, while the other maximizing it for all $0<α\leq 2$ (including the von-Neumann case of $α=1$). Furthermore, among the maximally entangled four qubits states, there are only 3 maximally entangled states that have the property that for 2, out of the 3 bipartite cuts consisting of 2-qubits verses 2-qubits, the entanglement is 2 ebits and for the remaining bipartite cut the entanglement between the two groups of two qubits is 1ebit. The unique 3 maximally entangled states are the 3 cluster states that are related by a swap operator. We also show that the cluster states are the only states (up to local unitaries) that maximize the average $α$-Renyi entropy of entanglement for all $α\geq 2$.

quant-ph↗

Entanglement of Subspaces and Error Correcting Codes

We introduce the notion of entanglement of subspaces as a measure that quantify the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces it is additive. Furthermore, we show that maximally entangled subspaces can play an important role in the study of quantum error correction codes. We discuss both degenerate and non-degenerate codes and show that the subspace spanned by the logical codewords of a non-degenerate code is a 2k-totally (maximally) entangled subspace. As for non-degenerate codes, we provide a mathematical definition in terms of subspaces and, as an example, we analyze Shor's nine qubits code in terms of 22 mutually orthogonal subspaces.

quant-ph↗

A class of gradings of simple Lie algebras

In this paper we give a classification of parabolic subalgebras of simple Lie algebras over $\mathbb{C}$ that satisfy two properties. The first property is Lynch's sufficient condition for the vanishing of certain Lie algebra cohomology spaces for generalized Whittaker modules associated with the parabolic subalgebra and the second is that the moment map of the cotangent bundle of the corresponding generalized flag variety be birational onto its image. We will call this condition the moment map condition.

math.RT↗

Global entanglement in multiparticle systems

We define a polynomial measure of multiparticle entanglement which is scalable, i.e., which applies to any number of spin-1/2 particles. By evaluating it for three particle states, for eigenstates of the one dimensional Heisenberg antiferromagnet and on quantum error correcting code subspaces, we illustrate the extent to which it quantifies global entanglement. We also apply it to track the evolution of entanglement during a quantum computation.

quant-ph↗

An Unentangled Gleason's Theorem

The purpose of this note is to give a generalization of Gleason's theorem inspired by recent work in quantum information theory on "nonlocality without entanglement." For multipartite quantum systems, each of dimension three or greater, the only nonnegative frame functions over the set of unentangled states are those given by the standard Born probability rule. However, if one system is of dimension 2 this is not necessarily the case.

quant-ph↗