Related papers: Quantitatively visualizing bipartite datasets
We study the quantum separability problem by using general symmetric informationally complete measurements and present a separability criterion for arbitrary dimensional bipartite systems. We show by detailed examples that our criterion is…
We give an introduction to the theory of multi-partite entanglement. We begin by describing the "coordinate system" of the field: Are we dealing with pure or mixed states, with single or multiple copies, what notion of "locality" is being…
Merging datafiles containing information on overlapping sets of entities is a challenging task in the absence of unique identifiers, and is further complicated when some entities are duplicated in the datafiles. Most approaches to this…
We present a detailed investigation of minimum detection efficiencies, below which locality cannot be violated by any quantum system of any dimension in bipartite Bell experiments. Lower bounds on these minimum detection efficiencies are…
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts,…
Background noise in many fields such as medical imaging poses significant challenges for accurate diagnosis, prompting the development of denoising algorithms. Traditional methodologies, however, often struggle to address the complexities…
Bipartite graph embedding has recently attracted much attention due to the fact that bipartite graphs are widely used in various application domains. Most previous methods, which adopt random walk-based or reconstruction-based objectives,…
The principle of tomographic locality states that the operational state of a multipartite system can be fully characterized by the statistics obtained from measurements that are local to the individual subsystems. This property holds in…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
Relations between discrete quantities such as people, genes, or streets can be described by networks, which consist of nodes that are connected by edges. Network analysis aims to identify important nodes in a network and to uncover…
The localization problem in relativistic quantum theory has persisted for more than seven decades, yet it is largely unknown and continues to perplex even those well-versed in the subject. At the heart of this problem lies a fundamental…
Community detection or clustering is a fundamental task in the analysis of network data. Many real networks have a bipartite structure which makes community detection challenging. In this paper, we consider a model which allows for matched…
In a recent paper \cite{mySEPvsLOCC}, we showed how to construct a quantum protocol for implementing a bipartite, separable quantum measurement using only local operations on subsystems and classical communication between parties (LOCC)…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite…
Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…
We propose an optimal numerical test for genuine multipartite nonlocality based on linear programming. In particular, we consider two non-equivalent models of local hidden variables, namely the Svetlichny and the no-signaling bilocal model.…
We propose a more general method for detecting a set of entanglement measures, i.e. negativities, in an \emph{arbitrary} tripartite quantum state by local operations and classical communication. To accomplish the detection task using this…
One of the main challenges for the manipulation and storage of multipartite entanglement is its fragility under noise. We present a simple recipe for the systematic enhancement of the resistance of multipartite entanglement against any…
If a measurement is made on one half of a bipartite system, then, conditioned on the outcome, the other half has a new reduced state. If these reduced states defy classical explanation -- that is, if shared randomness cannot produce these…