Related papers: Deterministic Dense Coding and Faithful Teleportat…
We generalize the scalable tight-binding model for graphene, which allows for efficient quantum transport simulations in the Dirac regime, to account for elastic strain. We show that the original scalable model with scaling factor $s$ is…
Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…
Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In…
Graph translation is very promising research direction and has a wide range of potential real-world applications. Graph is a natural structure for representing relationship and interactions, and its translation can encode the intrinsic…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
Engineered substrates offer a promising avenue towards graphene devices having tunable properties. In particular, topographically patterned substrates can expose unique behavior due to their ability to induce local variations in strain and…
Traditional continuous variable teleportation can only approach unit fidelity in the limit of an infinite (and unphysical) amount of squeezing. We describe a new method for continuous variable teleportation that approaches unit fidelity…
The coherent transduction between microwave and optical frequencies is critical to interconnect superconducting quantum processors over long distances. However, it is challenging to establish such a quantum interface with high efficiency…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
We introduce three tunable parameters to optimize the fidelity of quantum teleportation with continuous-variable in nonideal scheme. Using the characteristic function formalism, we present the condition that the teleportation fidelity is…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
Recent breakthroughs in graph streaming have led to the design of single-pass semi-streaming algorithms for various graph coloring problems such as $(\Delta+1)$-coloring, degeneracy-coloring, coloring triangle-free graphs, and others. These…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
We investigate ideal and non-ideal continuous-variable quantum teleportation protocols realized by using an entangled displaced Fock state resource. The characteristic function formulation is applied to measure the relative performance of…
We calculate the highest possible information gain in a measurement of entangled states when employing a beamsplitter. The result is used to evaluate the fidelity, averaged over all unknown inputs, in a realistic teleportation protocol that…
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and…
We introduce a quantum teleportation scheme that can transfer a macroscopic spin coherent state between two locations. In the scheme a large number of copies of a qubit, such as realized in a coherent two-component Bose-Einstein condensate,…
A non-standard teleportation scheme is proposed, wherein probabilistic teleportation is achieved in conventionally non-teleporting channels. We make use of entanglement monogamy to incorporate an unknown state in a multipartite entangled…
Diagrammatic representation and manipulation of tensor networks has proven to be a useful tool in mathematics, physics, and computer science. Here we present several important and mostly well-known theorems regarding the dualities between…
In contrast to discrete-variable teleportation, a quantum state is imperfectly transferred from a sender to a remote receiver in a continuous-variable setting. We recall the ingenious scheme proposed by Braunstein and Kimble for teleporting…