Compatibility of subsystem states and convex geometry
Abstract
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilizing the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a compatibility witness, and prove a number of properties about these objects. We show that the subsystem compatibility problem can be solved numerically and efficiently using semidefinite programming, and that the numerical results from this solution can be used to extract exact analytic results, an idea which we use to disprove a conjecture about the subsystem problem made by Butterley et al. [Found. Phys. 36, 83 (2006)]. Finally, we consider how the ideas can be used to tackle some important variants of the compatibility problem; in particular, the case of identical particles (known as Nrepresentability in the case of fermions) is considered.
 Authors:
 Department of Mathematics, University of York, Heslington, York YO10 5DD (United Kingdom)
 Publication Date:
 OSTI Identifier:
 20982233
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Physical Review. A; Journal Volume: 75; Journal Issue: 3; Other Information: DOI: 10.1103/PhysRevA.75.032102; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; COMPATIBILITY; FERMIONS; MATHEMATICAL SOLUTIONS; PROGRAMMING; QUANTUM ENTANGLEMENT; QUANTUM MECHANICS
Citation Formats
Hall, William. Compatibility of subsystem states and convex geometry. United States: N. p., 2007.
Web. doi:10.1103/PHYSREVA.75.032102.
Hall, William. Compatibility of subsystem states and convex geometry. United States. doi:10.1103/PHYSREVA.75.032102.
Hall, William. Thu .
"Compatibility of subsystem states and convex geometry". United States.
doi:10.1103/PHYSREVA.75.032102.
@article{osti_20982233,
title = {Compatibility of subsystem states and convex geometry},
author = {Hall, William},
abstractNote = {The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilizing the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a compatibility witness, and prove a number of properties about these objects. We show that the subsystem compatibility problem can be solved numerically and efficiently using semidefinite programming, and that the numerical results from this solution can be used to extract exact analytic results, an idea which we use to disprove a conjecture about the subsystem problem made by Butterley et al. [Found. Phys. 36, 83 (2006)]. Finally, we consider how the ideas can be used to tackle some important variants of the compatibility problem; in particular, the case of identical particles (known as Nrepresentability in the case of fermions) is considered.},
doi = {10.1103/PHYSREVA.75.032102},
journal = {Physical Review. A},
number = 3,
volume = 75,
place = {United States},
year = {Thu Mar 15 00:00:00 EDT 2007},
month = {Thu Mar 15 00:00:00 EDT 2007}
}

Geometry of convex polygons and locally minimal binary trees spanning these polygons
In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed. 
The MaxEnt extension of a quantum Gibbs family, convex geometry and geodesics
We discuss methods to analyze a quantum Gibbs family in the ultracold regime where the norm closure of the Gibbs family fails due to discontinuities of the maximumentropy inference. The current discussion of maximumentropy 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. 
Continuity of the maximumentropy inference: Convex geometry and numerical ranges approach
We study the continuity of an abstract generalization of the maximumentropy inference—a maximizer. It is defined as a rightinverse 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 ofmore »