Related papers: Deterministic Dense Coding and Faithful Teleportat…
Since linear-optical two-photon gates are inherently probabilistic, measurement-based implementations are particularly well suited for photonic platforms: a large highly-entangled photonic resource state, called a graph state, is consumed…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
Quantum teleportation plays a key role in modern quantum technologies. Thus, it is of much interest to generate alternative approaches or representations aimed at allowing us a better understanding of the physics involved in the process…
Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially…
Transformations involving only local operations assisted with classical communication are investigated for multipartite entangled pure states having tensor rank 2. All necessary and sufficient conditions for the possibility of…
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle…
The need for high fidelity quantum teleportation arises in a variety of quantum algorithms and protocols. Unfortunately, conventional continuous variable teleportation schemes rely on EPR states that yield a fidelity that approaches unity…
We present a scheme to generate a continuous variable (CV) multipartite entangled state using an array of plasmonic graphene waveguides that are activated by nonclassical driving microwave modes. Within this scheme, we can exploit the…
Quantum teleportation enables deterministic and faithful transmission of quantum states, provided a maximally entangled state is pre-shared between sender and receiver, and a one-way classical channel is available. Here, we prove that these…
We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity…
We study tensor network states defined on an underlying graph which is sparsely connected. Generic sparse graphs are expander graphs with a high probability, and one can represent volume law entangled states efficiently with only polynomial…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
A novel deep learning method for improving the belief propagation algorithm is proposed. The method generalizes the standard belief propagation algorithm by assigning weights to the edges of the Tanner graph. These edges are then trained…
We propose genuine ($k$, $m$)-threshold controlling schemes for controlled teleportation via multi-particle entangled states, where the teleportation of a quantum state from a sender (Alice) to a receiver (Bob) is under the control of $m$…
Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
We consider dense coding with partially entangled states on bipartite systems of dimension $d\times d$, studying the conditions under which a given number of messages, $N$, can be deterministically transmitted. It is known that the largest…
We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be…
We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in…