Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be mainly interested in local Hamiltonians with certain interaction patterns, such as nearest-neighbor interactions on some types of lattices. A necessary condition for a space
V to be the ground-state space of some local Hamiltonian with a given interaction pattern is that the maximally mixed state supported on
V is uniquely determined by its reduced density matrices associated with the given pattern, based on the principle of maximum entropy. However, it is unclear whether this condition is in general also sufficient. We examine the situations for the existence of such a local Hamiltonian to have
V satisfying the necessary condition mentioned above as its ground-state space by linking to faces of the convex body of the local reduced states. We further discuss some methods for constructing the corresponding local Hamiltonians with given interaction patterns, mainly from physical points of view, including constructions related to perturbation methods, local frustration-free Hamiltonians, as well as thermodynamical ensembles.
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of correlations, denoted Q , is fundamental for quantum information theory. We review and systematize what is known about Q , and add many details, visualizations, and complete proofs. In particular, we provide a detailed description of the boundary, which consists of three-dimensional faces isomorphic to elliptopes and sextic algebraic manifolds of exposed extreme points. These patches are separated by cubic surfaces of non-exposed extreme points. We provide a trigonometric parametrization of all extreme points, along with their exposing Tsirelson inequalities and quantum models. All non-classical extreme points (exposed or not) are self-testing, i.e., realized by an essentially unique quantum model.Two principles, which are specific to the minimal scenario, allow a quick and complete overview: The first is the pushout transformation, i.e., the application of the sine function to each coordinate. This transforms the classical correlation polytope exactly into the correlation body Q , also identifying the boundary structures. The second principle, self-duality, is an isomorphism between Q and its polar dual, i.e., the set of affine inequalities satisfied by all quantum correlations (“Tsirelson inequalities''). The same isomorphism links the polytope of classical correlations contained in Q to the polytope of no-signalling correlations, which contains Q .We also discuss the sets of correlations achieved with fixed Hilbert space dimension, fixed state or fixed observables, and establish a new non-linear inequality for Q involving the determinant of the correlation matrix.
We investigate the geometric structure of the set of spectra of bipartite absolute separable states (
ASEPm,n) and absolute positive partial transpose states (
APPTm,n), \emph{i.e.}, bipartite quantum states that remain separable or PPT, respectively, under all global unitary transformations. First, we establish general geometric properties of absolute convex sets of matrices, their spectra and extreme points. Regarding absolute separability, we present a permutation-symmetric reformulation of the absolute PPT criterion and use it to demonstrate that
APPTm,n is a spectrahedron for all
m≤n: in particular, all its faces are exposed. While
ASEP2,n is a spectrahedron, too, for
ASEPm,n we can in general only show that it is a semialgebraic set for all
m,n≥3. Furthermore, we provide a complete characterization of the faces and extreme points of
APPTm,n and demonstrate that the dimension of a face is determined by the rank of a certain matrix, with maximal proper faces having dimension
mn−m−1.
In the quantitative setting, we provide a rigorous lower bound on the maximal attainable purity of
APPTm,n via an inscribed polytope
Pm,n and conjecture that the maximal purity of
APPTm,n (along with its spectra) coincides with the polytope for arbitrary dimensions except when
m=n=2. Additionally, we also provide a rigorous upper bound on the minimal von Neumann entropy of
APPTm,n and demonstrate numerically that the minimum entropy eventually coincides with the polytope
Pm,n as the local system dimension
n increases. Finally, we show that the relative spectral volume of
APPTm,n decays exponentially in
n by a constant multiplicative factor of the relative volume of the inscribed polytope
Pm,n.
Abstract Marginal problems naturally arise in a variety of different fields: basically, the question is whether some marginal/partial information is compatible with a joint probability distribution. To this aim, the characterization of marginal sets via quantifier elimination and polyhedral projection algorithms is of primal importance. In this work, before considering specific problems, we review polyhedral projection algorithms with focus on applications in information theory, and, alongside known algorithms, we also present a newly developed geometric algorithm which walks along the face lattice of the polyhedron in the projection space. One important application of this is in the field of quantum non-locality, where marginal problems arise in the computation of Bell inequalities. We apply the discussed algorithms to discover many tight entropic Bell inequalities of the tripartite Bell scenario as well as more complex networks arising in the field of causal inference. Finally, we analyze the usefulness of these inequalities as nonlocality witnesses by searching for violating quantum states.
Convex sets of quantum states and processes play a central role in quantum theory and quantum information. Many important examples of convex sets in quantum theory are spectrahedra, that is, sets of positive operators satisfying affine constraints. These examples include sets of quantum states with given expectation values of a set of observables, sets of multipartite quantum states with given marginals, sets of quantum measurements, channels and multitime quantum processes, as well as sets of higher-order quantum maps and quantum causal structures. This contribution provides a characterization of the extreme points of general spectrahedra, and bounds on the ranks of the corresponding operators. The general results are applied to several special cases, and then used to retrieve classic results such as Choi’s characterization of the extreme quantum channels, Parthasarathy’s characterization of the extreme quantum states with given marginals and the quantum version of Birkhoff’s theorem for qubit unital channels. Finally, we propose a notion of positive operator valued measures (POVMs) with general affine constraints for their normalization, and we characterize the extremal POVMs.
Determining whether a mixed quantum state is uniquely determined among all states by its k-body marginals (k-UDA) is a fundamental problem in quantum system certification. We develop a range-based approach to this problem by analyzing the structure of the range of the global state. For three-qubit states, we show that states with GHZ-SLOCC-free ranges are 2-UDA at ranks one, three, and four. We derive a necessary and sufficient range criterion for rank-two 2-UDA states and reduce it to a finite quadratic-form test. To cover the remaining range configurations, we formulate an exact range-restricted semidefinite programming criterion and extend it to arbitrary finite-dimensional tripartite states. We also show that every three-qubit state of rank at least five is not 2-UDA, and further extend high-rank obstructions to multipartite systems. For a channel-based multipartite family, we characterize exactly when a state is
(n−1)-UDA and show that lower-order marginals never suffice. Finally, we apply these results to the certification of genuine multipartite entanglement.