We propose and analyze a potential induced random walk and its modification called random teleportation on finite graphs. The transition probability is determined by the gaps between potential values of adjacent and teleportation nodes. We show that the steady state of this process has a number of desirable properties. We present a continuous time analogue of the random walk and teleportation, ...

Faithful teleportation of an unknown state |φ in C d is considered, where a general entangled state ρ is served as the resource. The necessary conditions of mixed states to complete perfect teleportation are proved. Based on these results, the necessary and sufficient conditions of faithful teleportation channel ρ in C m ⊗ C d and C d ⊗ C n are derived. It is shown that for ρ in C m ⊗ C d , ρ m...

An explicit scheme (quantum circuit) is designed for the teleportation of an n-qubit quantum state. It is established that the proposed scheme requires an optimal amount of quantum resources, whereas larger amount of quantum resources has been used in a large number of recently reported teleportation schemes for the quantum states which can be viewed as special cases of the general n-qubit stat...

We present a high-fidelity quantum teleportation experiment over a high-loss free-space channel between two laboratories. We teleported six states of three mutually unbiased bases and obtained an average state fidelity of 0.82(1), well beyond the classical limit of 2/3. With the obtained data, we tomographically reconstructed the process matrices of quantum teleportation. The free-space channel...

Quantum teleportation allows the transmission of an unknown quantum state by combining the nonlocal quantum coherence of entangled states with the transmission of classical information obtained in a joint measurement of the unknown input state and one part of the entangled pair @1#. Ideally, the classical information transmitted contains no information about the input state, and the output stat...

We identify a design pattern for concurrent data structures, called teleportation, that uses besteffort hardware transactional memory to speed up certain kinds of legacy concurrent data structures. Teleportation unifies and explains several existing data structure designs, and it serves as the basis for novel approaches to reducing the memory traffic associated with fine-grained locking, and wi...

Quantum mechanics provides spectacular new information processing abilities . One of the most unexpected is a procedure called quantum teleportation 3 that allows the quantum state of a system to be transported from one location to another, without moving through the intervening space. Partial implementations of teleportation 4,5 over macroscopic distances have been achieved using optical systems,

The topics of the paper are: a) Some anti-linear maps governing EPR tasks if no reference bases are distinguished. b) Imperfect quantum teleportation and the composition rule. The ancilla is supposed pure but otherwise arbitrary. c) Quantum teleportation with distributed measurements. d) Remarks on EPR with a mixed state, triggered by a Lüders measurement.