Related papers: Modeling Pauli measurements on graph states with n…
A central aspect of quantum information is that correlations between spacelike separated observers sharing entangled states cannot be reproduced by local hidden variable (LHV) models, a phenomenon known as Bell nonlocality. If one wishes to…
A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…
Graph learning problems are typically approached by focusing on learning the topology of a single graph when signals from all nodes are available. However, many contemporary setups involve multiple related networks and, moreover, it is…
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by…
We present a novel methodology for modeling and forecasting multivariate realized volatilities using customized graph neural networks to incorporate spillover effects across stocks. The proposed model offers the benefits of incorporating…
We consider general settings of Bell inequality experiments with many parties, where each party chooses from a finite number of measurement settings each with a finite number of outcomes. We investigate the constraints that Bell…
Broad claims about whether adaptivity helps in quantum state tomography can be misleading unless the state family, measurement architecture, and error metric are specified carefully. We study a restricted but physically important regime:…
Graphical models are commonly used to represent conditional dependence relationships between variables. There are multiple methods available for exploring them from high-dimensional data, but almost all of them rely on the assumption that…
Quantum state tomography is a fundamental problem in quantum computing. Given $n$ copies of an unknown $N$-qubit state $\rho \in \mathbb{C}^{d \times d},d=2^N$, the goal is to learn the state up to an accuracy $\epsilon$ in trace distance,…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…
There has been an increased interest in applying machine learning techniques on relational structured-data based on an observed graph. Often, this graph is not fully representative of the true relationship amongst nodes. In these settings,…
We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…
Low probability of detection (LPD) has recently emerged as a means to enhance the privacy and security of wireless networks. Unlike existing wireless security techniques, LPD measures aim to conceal the entire existence of wireless…
As quantum devices scale, quantifying how close an experimental state aligns with a target becomes both vital and challenging. Fidelity is the standard metric, but existing estimators either require full tomography or apply only to…
We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a…
Bell's theorem states that quantum mechanics is not a locally causal theory. This state is often interpreted as nonlocality in quantum mechanics. Toner and Bacon [Phys. Rev. Lett. \textbf{91}, 187904 (2003)] have shown that a shared…
We demonstrate how to universally simulate ensemble statistics of projective local measurements on any $n$-qubit state shared among $n$ observers with classical communication and shared randomness. Our technique originates from protocols…