Related papers: Deterministic Dense Coding and Faithful Teleportat…
A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…
The aim of this paper is to swap the entanglement between two separate long distant locations. The well-known entangled coherent states as two-mode continuous-variable states are very interesting in quantum teleportation and entanglement…
We provide a novel new approach for aligning geometric models using a dual graph structure where local features are mapping probabilities. Alignment of non-rigid structures is one of the most challenging computer vision tasks due to the…
Dynamic wavelength tunability has long been the holy grail of photodetector technology. Because of its atomic thickness and unique properties, graphene opens up new paradigms to realize this concept, but so far this has been elusive…
This paper deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim to find graph-theoretic conditions under which the state…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and…
In this work, we develop an efficient decoding method for graph codes, a class of stabilizer quantum error-correcting codes constructed from graph states. While optimal decoding is generally NP-hard, we propose a faster decoder exploiting…
Using invariance of the $n$-th tensored state w.r.t. the $n$-th symmetric group, we propose a 'variable length' universal entanglement concentration without classical communication. Like variable length data compression, arbitrary unknown…
A method is presented for producing analytical results applicable to the standard two-party deterministic dense coding protocol, wherein communication of K perfectly distinguishable messages is attainable with the aid of K selected local…
We investigate quantum teleportation through dissipative channels and calculate teleportation fidelity as a function of damping rates. It is found that the average fidelity of teleportation and the range of states to be teleported depend on…
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in…
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's…
Despite remarkable success in diverse web-based applications, Graph Neural Networks(GNNs) inherit and further exacerbate historical discrimination and social stereotypes, which critically hinder their deployments in high-stake domains such…
We introduce a refinement of the standard continuous variable teleportation measurement and displacement strategies. This refinement makes use of prior knowledge about the target state and the partial information carried by the classical…
Measurement-based quantum computation relies on single qubit measurements of large multipartite entangled states, so-called lattice-graph or cluster states. Graph states are also an important resource for quantum communication, where tree…
We propose a protocol ${\cal D}_n$ for faithfully teleporting an arbitrary $n$-qudit state with the tensor product state (TPS) of $n$ generalized Bell states (GBSs) as the quantum channel. We also put forward explicit protocol ${\cal D}'_n$…
We propose two types of quantum dense coding communication networks with optical continuous variables, in which a quadripartite entangled state of the optical field with totally three-party correlations of quadrature amplitudes is utilized.…
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can…
Random Linear Network Coding (RLNC) has been proved to offer an efficient communication scheme, leveraging an interesting robustness against packet losses. However, it suffers from a high computational complexity and some novel approaches,…