Complexity and capacity bounds for quantum channels

We generalise some well-known graph parameters to operator systems by considering their underlying quantum channels. In particular, we introduce the quantum complexity as the dimension of the smallest co-domain Hilbert space a quantum channel requires to realise a given operator system as its non-commutative confusability graph. We describe quantum complexity as a generalised minimum semidefinite rank and, in the case of a graph operator system, as a quantum intersection number. The quantum complexity and a closely related quantum version of orthogonal rank turn out to be upper bounds for the Shannon zero-error capacity of a quantum channel, and we construct examples for which these bounds beat the best previously known general upper bound for the capacity of quantum channels, given by the quantum Lov\'asz theta number

Schur multipliers of Cartan pairs

We define the Schur multipliers of a separable von Neumann algebra M with Cartan masa A, generalising the classical Schur multipliers of $B(\ell^2)$. We characterise these as the normal A-bimodule maps on M. If M contains a direct summand isomorphic to the hyperfinite II_1 factor, then we show that the Schur multipliers arising from the extended Haagerup tensor product $A \otimes_{eh} A$ are strictly contained in the algebra of all Schur multipliers

State convertibility in the von Neumann algebra framework

We establish a generalisation of the fundamental state convertibility theorem in quantum information to the context of bipartite quantum systems modelled by commuting semi-finite von Neumann algebras. Namely, we establish a generalisation to this setting of Nielsen's theorem on the convertibility of quantum states under local operations and classical communication (LOCC) schemes. Along the way, we introduce an appropriate generalisation of LOCC operations and connect the resulting notion of approximate convertibility to the theory of singular numbers and majorisation in von Neumann algebras. As an application of our result in the setting of $II_1$-factors, we show that the entropy of the singular value distribution relative to the unique tracial state is an entanglement monotone in the sense of Vidal, thus yielding a new way to quantify entanglement in that context. Building on previous work in the infinite-dimensional setting, we show that trace vectors play the role of maximally entangled states for general $II_1$-factors. Examples are drawn from infinite spin chains, quasi-free representations of the CAR, and discretised versions of the CCR.Comment: 36 pages, v2: journal version, 38 page

Reflexivity of the translation-dilation algebras on L^2(R)

The hyperbolic algebra A_h, studied recently by Katavolos and Power, is the weak star closed operator algebra on L^2(R) generated by H^\infty(R), as multiplication operators, and by the dilation operators V_t, t \geq 0, given by V_t f(x) = e^{t/2} f(e^t x). We show that A_h is a reflexive operator algebra and that the four dimensional manifold Lat A_h (with the natural topology) is the reflexive hull of a natural two dimensional subspace.Comment: 10 pages, no figures To appear in the International Journal of Mathematic

A stochastic model for the evolution of the web allowing link deletion

Recently several authors have proposed stochastic evolutionary models for the growth of the web graph and other networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get richer'' phenomenon. We present a generalisation of the basic model by allowing deletion of individual links and show that it also gives rise to a power-law distribution. We derive the mean-field equations for this stochastic model and show that by examining a snapshot of the distribution at the steady state of the model, we are able to tell whether any link deletion has taken place and estimate the link deletion probability. Our model enables us to gain some insight into the distribution of inlinks in the web graph, in particular it suggests a power-law exponent of approximately 2.15 rather than the widely published exponent of 2.1