Search arXivSearch

arXiv · 1811.11513

Optimal arrangements of classical and quantum states with limited purity

Abstract

We consider sets of trace-normalized non-negative operators in Hilbert-Schmidt balls that maximize their mutual Hilbert-Schmidt distance; these are optimal arrangements in the sets of purity-limited classical or quantum states on a finite-dimensional Hilbert space. Classical states are understood to be represented by diagonal matrices, with the diagonal entries forming a probability vector. We also introduce the concept of spectrahedron arrangements which provides a unified framework for classical and quantum arrangements and the flexibility to define new types of optimal packings. Continuing a prior work, we combine combinatorial structures and line packings associated with frames to arrive at optimal arrangements of higher-rank quantum states. One new construction that is presented involves generating an optimal arrangement we call a Gabor-Steiner equiangular tight frame as the orbit of a projective representation of the Weyl-Heisenberg group over any finite abelian group. The minimal sets of linearly dependent vectors, the so-called binder, of the Gabor-Steiner equiangular tight frames are then characterized; under certain conditions these form combinatorial block designs and in one case generate a new class of block designs. The projections onto the span of minimal linearly dependent sets in the Gabor-Steiner equiangular tight frame are then used to generate further optimal spectrahedron arrangements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernhard Bodmann, Emily J. King. 2020-01-10. Optimal arrangements of classical and quantum states with limited purity. https://doi.org/10.1112/jlms.12276

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO