arXiv subjects

Stephan Weis

Publications and source records attributed to Stephan Weis.

32 records · Page 2Linked to original sources

arXiv2016

Pre-images of extreme points of the numerical range, and applications

We extend the pre-image representation of exposed points of the numerical range of a matrix to all extreme points. With that we characterize extreme points which are multiply generated, having at least two linearly independent pre-images, as the extreme points which are Hausdorff limits of flat boundary portions on numerical ranges of a sequence converging to the given matrix. These studies address the inverse numerical range map and the maximum-entropy inference map which are continuous functions on the numerical range except possibly at certain multiply generated extreme points. This work also allows us to describe closures of subsets of 3-by-3 matrices having the same shape of the numerical range.

math.FA↗

arXiv2015

Maximum-entropy inference and inverse continuity of the numerical range

We study the continuity of the maximum-entropy inference map for two observables in finite dimensions. We prove that the continuity is equivalent to the strong continuity of the set-valued inverse numerical range map. This gives a continuity condition in terms of analytic eigenvalue functions which implies that discontinuities are very rare. It shows also that the continuity of the MaxEnt inference method is independent of the prior state.

math-ph↗

arXiv2015

Maximizing the divergence from a hierarchical model of quantum states

We study many-party correlations quantified in terms of the Umegaki relative entropy (divergence) from a Gibbs family known as a hierarchical model. We derive these quantities from the maximum-entropy principle which was used earlier to define the closely related irreducible correlation. We point out differences between quantum states and probability vectors which exist in hierarchical models, in the divergence from a hierarchical model and in local maximizers of this divergence. The differences are, respectively, missing factorization, discontinuity and reduction of uncertainty. We discuss global maximizers of the mutual information of separable qubit states.

math-ph↗

arXiv2015

Continuity of the maximum-entropy inference: Convex geometry and numerical ranges approach

We study the continuity of an abstract generalization of the maximum-entropy inference - a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a continuous function on the convex body. Using convex geometry we prove, amongst others, the existence of discontinuities of the maximizer at limits of extremal points not being extremal points themselves and apply the result to quantum correlations. Further, we use numerical range methods in the case of quantum inference which refers to two observables. One result is a complete characterization of points of discontinuity for $3\times 3$ matrices.

math-ph↗

arXiv2014

The MaxEnt extension of a quantum Gibbs family, convex geometry and geodesics

We discuss methods to analyze a quantum Gibbs family in the ultra-cold regime where the norm closure of the Gibbs family fails due to discontinuities of the maximum-entropy inference. The current discussion of maximum-entropy inference and irreducible correlation in the area of quantum phase transitions is a major motivation for this research. We extend a representation of the irreducible correlation from finite temperatures to absolute zero.

quant-ph↗

arXiv2014

Continuity of the Maximum-Entropy Inference

We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference can be a discontinuous map from the convex set of expected values to the convex set of states because the image contains states of reduced support, while this map restricts to a smooth parametrization of a Gibbsian family of fully supported states. Here we prove for arbitrary ranking functions that the inference is continuous up to boundary points. This follows from a continuity condition in terms of the openness of the restricted linear map from states to their expected values. The openness condition shows also that ranking functions with a discontinuous inference are typical. Moreover it shows that the inference is continuous in the restriction to any polytope which implies that a discontinuity belongs to the quantum domain of non-commutative observables and that a geodesic closure of a Gibbsian family equals the set of maximum-entropy states. We discuss eight descriptions of the set of maximum-entropy states with proofs of accuracy and an analysis of deviations.

quant-ph↗

arXiv2013

Discontinuities in the Maximum-Entropy Inference

We revisit the maximum-entropy inference of the state of a finite-level quantum system under linear constraints. The constraints are specified by the expected values of a set of fixed observables. We point out the existence of discontinuities in this inference method. This is a pure quantum phenomenon since the maximum-entropy inference is continuous for mutually commuting observables. The question arises why some sets of observables are distinguished by a discontinuity in an inference method which is still discussed as a universal inference method. In this paper we make an example of a discontinuity and we explain a characterization of the discontinuities in terms of the openness of the (restricted) linear map that assigns expected values to states.

quant-ph↗

arXiv2013

Information topologies on non-commutative state spaces

We define an information topology (I-topology) and a reverse information topology (rI-topology) on the state space of a C*-subalgebra of Mat(n,C). These topologies arise from sequential convergence with respect to the relative entropy. We prove that open disks, with respect to the relative entropy, define a base for them, while Csiszar has shown in 1967 that the analogue is wrong for probability measures on a countably infinite set. The I-topology is finer than the norm topology, it disconnects the convex state space into its faces. The rI-topology is intermediate between these topologies. We complete two fundamental theorems of information geometry to the full state space, by taking the closure in the rI-topology. The norm topology is too coarse for this aim only for a non-commutative algebra, so its discrepancy to the rI-topology belongs to the quantum domain. We apply our results to the maximization of the von Neumann entropy under linear constraints and to the maximization of quantum correlations.

math-ph↗

arXiv2012

Entropy Distance: New Quantum Phenomena

We study a curve of Gibbsian families of complex 3x3-matrices and point out new features, absent in commutative finite-dimensional algebras: a discontinuous maximum-entropy inference, a discontinuous entropy distance and non-exposed faces of the mean value set. We analyze these problems from various aspects including convex geometry, topology and information geometry. This research is motivated by a theory of info-max principles, where we contribute by computing first order optimality conditions of the entropy distance.

math-ph↗

arXiv2011

Geometry of the set of mixed quantum states: An apophatic approach

The set of quantum states consists of density matrices of order $N$, which are hermitian, positive and normalized by the trace condition. We analyze the structure of this set in the framework of the Euclidean geometry naturally arising in the space of hermitian matrices. For N=2 this set is the Bloch ball, embedded in $\mathbb R^3$. For $N \geq 3$ this set of dimensionality $N^2-1$ has a much richer structure. We study its properties and at first advocate an apophatic approach, which concentrates on characteristics not possessed by this set. We also apply more constructive techniques and analyze two dimensional cross-sections and projections of the set of quantum states. They are dual to each other. At the end we make some remarks on certain dimension dependent properties.

quant-ph↗

arXiv2011

Duality of non-exposed faces

Given any polar pair of convex bodies we study its conjugate face maps and we characterize conjugate faces of non-exposed faces in terms of normal cones. The analysis is carried out using the positive hull operator which defines lattice isomorphisms linking three Galois connections. One of them assigns conjugate faces between the convex bodies. The second and third Galois connection is defined between the touching cones and the faces of each convex body separately. While the former is well-known, we introduce the latter in this article for any convex set in any finite dimension. We demonstrate our results about conjugate faces with planar convex bodies and planar self-dual convex bodies, for which we also include constructions.

math.MG↗

arXiv2011

Quantum Convex Support

Convex support, the mean values of a set of random variables, is central in information theory and statistics. Equally central in quantum information theory are mean values of a set of observables in a finite-dimensional C*-algebra A, which we call (quantum) convex support. The convex support can be viewed as a projection of the state space of A and it is a projection of a spectrahedron. Spectrahedra are increasingly investigated at least since the 1990's boom in semidefinite programming. We recall the geometry of the positive semi-definite cone and of the state space. We write a convex duality for general self-dual convex cones. This restricts to projections of state spaces and connects them to results on spectrahedra. Really new in this article is an analysis of the face lattice of convex support by mapping this lattice to a lattice of orthogonal projections, using natural isomorphisms. The result encodes the face lattice of the convex support into a set of projections in A and enables the integration of convex geometry with matrix calculus or algebraic techniques.

math-ph↗

arXiv2011

A Note on Touching Cones and Faces

We study touching cones of a (not necessarily closed) convex set in a finitedimensional real Euclidean vector space and we draw relationships to other concepts in Convex Geometry. Exposed faces correspond to normal cones by an antitone lattice isomorphism. Poonems generalize the former to faces and the latter to touching cones, these extensions are non-isomorphic, though. We study the behavior of these lattices under projections to affine subspaces and intersections with affine subspaces. We prove a theorem that characterizes exposed faces by assumptions about touching cones. For a convex body K the notion of conjugate face adds an isotone lattice isomorphism from the exposed faces of the polar body to the normal cones of K. This extends to an isomorphism between faces and touching cones.

math.MG↗

arXiv2010

Polyhedral Voronoi Cells

Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using inversion at a sphere and a theorem of semi-infinite linear programming.

math-ph↗