Unextendible product bases from orthogonality graphs

• URL: http://arxiv.org/abs/2303.02553v1
• Date: Sun, 5 Mar 2023 02:33:22 GMT
• Title: Unextendible product bases from orthogonality graphs
• Authors: Fei Shi, Ge Bai, Xiande Zhang, Qi Zhao, Giulio Chiribella
• Abstract summary: Unextendible product bases play a key role in the study of quantum entanglement and nonlocality. We show that every minimal GUPB saturating our bound must be associated to regular graphs. We discuss a possible path towards the construction of a minimal GUPB in a tripartite system of minimal local dimension.
• Score: 24.740502616119606
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unextendible product bases (UPBs) play a key role in the study of quantum entanglement and nonlocality. A famous open question is whether there exist genuinely unextendible product bases (GUPBs), namely multipartite product bases that are unextendible with respect to every possible bipartition. Here we shed light on this question by providing a characterization of UPBs and GUPBs in terms of orthogonality graphs. Building on this connection, we develop a method for constructing UPBs in low dimensions, and we derive a lower bound on the size of any GUPB, significantly improving over the state of the art. Moreover, we show that every minimal GUPB saturating our bound must be associated to regular graphs. Finally, we discuss a possible path towards the construction of a minimal GUPB in a tripartite system of minimal local dimension.

Related papers

• A Simple and Generalist Approach for Panoptic Segmentation [57.94892855772925]
  Generalist vision models aim for one and the same architecture for a variety of vision tasks. While such shared architecture may seem attractive, generalist models tend to be outperformed by their bespoken counterparts. We address this problem by introducing two key contributions, without compromising the desirable properties of generalist models.
  arXiv  Detail & Related papers  (2024-08-29T13:02:12Z)
• CBGBench: Fill in the Blank of Protein-Molecule Complex Binding Graph [66.11279161533619]
  CBGBench is a benchmark for structure-based drug design (SBDD) By categorizing existing methods based on their attributes, CBGBench implements various cutting-edge methods. We have adapted these models to a range of tasks essential in drug design, which are considered sub-tasks within the graph fill-in-the-blank tasks.
  arXiv  Detail & Related papers  (2024-06-16T08:20:24Z)
• Self-organization Preserved Graph Structure Learning with Principle of Relevant Information [72.83485174169027]
  PRI-GSL is a Graph Structure Learning framework for identifying the self-organization and revealing the hidden structure. PRI-GSL learns a structure that contains the most relevant yet least redundant information quantified by von Neumann entropy and Quantum Jensen-Shannon divergence.
  arXiv  Detail & Related papers  (2022-12-30T16:02:02Z)
• Unextendible and uncompletable product bases in every bipartition [23.76183357793457]
  Unextendible product basis is an important object in quantum information theory. We find some unextendible product bases that are uncompletable product bases in every bipartition. Our results advance the understanding of the geometry of unextendible product bases.
  arXiv  Detail & Related papers  (2022-07-11T10:49:34Z)
• Negative result about the construction of genuinely entangled subspaces from unextendible product bases [0.0]
  Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. We show that there are always forbidden cardinalities for such UPBs, including the minimal ones corresponding to GESs of the maximal dimensions.
  arXiv  Detail & Related papers  (2022-02-16T22:15:49Z)
• Compact Graph Structure Learning via Mutual Information Compression [79.225671302689]
  Graph Structure Learning (GSL) has attracted considerable attentions in its capacity of optimizing graph structure and learning parameters of Graph Neural Networks (GNNs) We propose a Compact GSL architecture by MI compression, named CoGSL. We conduct extensive experiments on several datasets under clean and attacked conditions, which demonstrate the effectiveness and robustness of CoGSL.
  arXiv  Detail & Related papers  (2022-01-14T16:22:33Z)
• Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions [2.750124853532831]
  We prove a new universal lower bound on the number of atomic interventions that an algorithm would need to perform in order to orient a given MEC. Our lower bound is provably better than previously known lower bounds.
  arXiv  Detail & Related papers  (2021-11-09T11:58:44Z)
• A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs [117.82903457289584]
  We derive a novel problem-dependent lower-bound for regret in finite-horizon Markov Decision Processes (MDPs) We show that our lower-bound is considerably smaller than in the general case and it does not scale with the minimum action gap at all. We show that this last result is attainable (up to $poly(H)$ terms, where $H$ is the horizon) by providing a regret upper-bound based on policy gaps for an optimistic algorithm.
  arXiv  Detail & Related papers  (2021-06-24T13:46:09Z)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• The construction and local distinguishability of multiqubit unextendible product bases [7.238541917115604]
  An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs) We show that the UPB is locally indistinguishable in the bipartite systems of two qubits and five qubits, respectively. Taking the graphs as product vectors, we show that they are in three different orbits up to local unitary equivalence.
  arXiv  Detail & Related papers  (2021-02-23T08:50:19Z)
• Unextendible product bases, bound entangled states, and the range criterion [0.0]
  We consider reducible and irreducible UPBs of maximum size, which can produce bound entangled (BE) states. We provide different UPBs corresponding to the present BE states of minimum rank and discuss important properties of the UPBs.
  arXiv  Detail & Related papers  (2020-05-05T12:46:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.