Related papers: Deterministic Dense Coding and Faithful Teleportat…
A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that…
Graph neural network (GNN) is an efficient neural network model for graph data and is widely used in different fields, including wireless communications. Different from other neural network models, GNN can be implemented in a decentralized…
The problem of recovering graph signals is one of the main topics in graph signal processing. A representative approach to this problem is the graph Wiener filter, which utilizes the statistical information of the target signal computed…
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The…
In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…
This paper introduces a design method for densergraph-frequency graph Fourier frames (DGFFs) to enhance graph signal processing and analysis. The graph Fourier transform (GFT) enables us to analyze graph signals in the graph spectral domain…
We study bipartite entangled states in arbitrary dimensions and obtain different bounds for the entanglement measures in terms of teleportation fidelity. We find that there is a simple relation between negativity and teleportation fidelity…
Quantum teleportation is a process in which an unknown quantum state is transferred between two spatially separated subspaces of a bipartite quantum system which share an entangled state and communicate classically. In the case of photonic…
A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…
By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph…
There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high…
We investigate quantum teleportation of ensembles of coherent states of light with a Gaussian distributed displacement in phase space. Recently, the following general question has been addressed in [P. Liuzzo-Scorpo et al.,…
In this paper we present an optimal protocol by which an unknown state on a Hilbert space of dimension $N$ can be approximately stored in an $M$-dimensional quantum system or be approximately teleported via an $M$-dimensional quantum…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
We present a framework of a multimode dense coding network with multiple senders and a single receiver using continuous variable systems. The protocol is scalable to arbitrary numbers of modes with the encoding being displacements while the…
Quantum teleportation~\cite{Bennett1993} is of both fundamental interest and great practical importance in quantum information science. To date, quantum teleportation has been implemented in various physical systems~\cite{Pirandola2015},…
We study a non-exchangeable multi-agent system and rigorously derive a strong form of the mean-field limit. The convergence of the connection weights and the initial data implies convergence of large-scale dynamics toward a deterministic…
Quantum teleportation is an essential application of quantum entanglement. The examination of teleportation fidelity in two-party standard teleportation schemes reveals a critical threshold distinguishing separable and entangled states. For…
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…