Related papers: Deterministic Dense Coding and Faithful Teleportat…
In this work we consider a quantum network consisting of nodes and entangled states connecting the nodes. In evrey node there is a single player. The players at the intermediate nodes carry out measurements to produce an entangled state…
We present a general formalism to describe continuous-variable (CV) quantum teleportation of discrete-variable (DV) states with gain tuning, taking into account experimental imperfections. Here the teleportation output is given by…
Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology for realizing distributed quantum computation and communication protocols on near-term hardware. We present a…
We investigate the resources needed for secure teleportation of coherent states. We extend continuous variable teleportation to include quantum tele-amplification protocols, that allow non-unity classical gains and a pre-amplification or…
By sending a classical two-level system, one can transfer information about only \emph{two} distinguishable outcomes. Here we show that in quantum mechanics, using both the spin and path degrees of freedom of a spin-1/2 particle, and a…
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated…
A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
When designing large-scale distributed controllers, the information-sharing constraints between sub-controllers, as defined by a communication topology interconnecting them, are as important as the controller itself. Controllers implemented…
There is much interest in the multiparty quantum communications where quantum teleportation using high dimensional entangled quantum channel is one of the promising tools. In this paper, we propose a more general scheme for M-party…
We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein {\it et al.} [Phys. Rev. A \textbf{73}, 012320 (2006)]. The conjecture states…
We propose a deterministic scheme for teleporting an unknown qubit through continuous-variable entangled states in superconducting circuits. The qubit is a superconducting two-level system and the bipartite quantum channel is a photonic…
Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex…
We present linear optical schemes to perform generalized measurements for conclusive teleportation when the sender and the receiver share nonmaximal entanglement resulting from amplitude errors during propagation or generation. Three…
The ability to teleport entanglement through maximally entangled mixed states as defined by concurrence and linear entropy is studied. We show how the teleported entanglement depends on the quality of the quantum channel used, as defined…
The role of the off-diagonal density matrix elements of the entangled pair is investigated in quantum teleportation of a qbit. The dependence between them and the off-diagonal elements of the teleported density matrix is shown to be linear.…
We propose a scheme to realize deterministic quantum teleportation using linear optics and hybrid qubits. It enables one to efficiently perform teleportation and universal linear-optical gate operations in a simple and near-deterministic…
We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting…
Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network,…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…