Related papers: Deterministic Dense Coding and Faithful Teleportat…

Exploiting the cluster of three Bell coherent-states as quantum channel, we presented a scheme wherein quantum-informations encoded in three arbitrary superposed coherent states, i.e., Schrodinger Cat coherent-states are simultaneously…

Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…

Schemes for generation and protocols for network teleportation of multimode entangled cat-states are proposed. Explicit expressions for probability of successful teleportation are derived for both symmetric and asymmetric networks.

We consider quantum teleportation when the given entanglement channel is an arbitrary multiparticle state. A general criterion is presented, which allows one to judge if the channel can be used to teleport faithfully an arbitrary quantum…

We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of…

We investigate the connection between sub-Planck structure in the Wigner function and the output fidelity of continuous-variable teleportation protocols. When the teleporting parties share a two-mode squeezed state as an entangled resource,…

We solve, in a fully decentralised way (\ie with no message passing), the classic problem of colouring a graph. We propose a novel algorithm that is automatically responsive to topology changes, and we prove that it converges quickly to a…

Quantum dense coding is a protocol for transmitting two classical bits of information from a sender (Alice) to a remote receiver (Bob) by sending only one quantum bit (qubit). In this article, we propose an experimentally feasible scheme to…

Graph-based representations underlie a wide range of scientific problems. Graph connectivity is typically represented as a sparse matrix in the Compressed Sparse Row format. Large-scale graphs rely on distributed storage, allocating…

We study the entanglement of entangled coherent states in vacuum environment by employing the entanglement of formation and propose a scheme to probabilistically teleport a coherent superposition state via entangled coherent states, in…

An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient…

Quantum metrology seeks to push the boundaries of measurement precision by harnessing quantum phenomena. Conventional methods often rely on maximally entangled resources, with states that are usually challenging to produce and sustain in…

Graphs are ubiquitous data structures for representing interactions between entities. With an emphasis on the use of graphs to represent chemical molecules, we explore the task of learning to generate graphs that conform to a distribution…

Inspired by the tremendous success of deep generative models on generating continuous data like image and audio, in the most recent year, few deep graph generative models have been proposed to generate discrete data such as graphs. They are…

We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements…

A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief…

In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…

Quantum teleportation is a key ingredient of quantum networks and a building block for quantum computation. Teleportation between distant material objects using light as the quantum information carrier has been a particularly exciting goal.…

The topology of entanglement in multipartite states with translational invariance is discussed in this article. Two global features are foundby which one can distinguish distinct states. These are the cyclic unit and the quantised geometric…

Large-scale quantum information processing networks will most probably require the entanglement of distant systems that do not interact directly. This can be done by performing entangling gates between standing information carriers, used as…