Related papers: A note on perfect quantum state transfers on trees
A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of…
We study the possibility of performing perfect teleportation of unknown quantum states from multiple senders to a single receiver with a previously shared stabilizer state. In the model we considered, the utilized stabilizer state is…
In this work, we study transfer of coherence matrices along spin-1/2 chains of various length. Unlike higher order coherence matrices, 0-order coherence matrix can be perfectly transferred if its elements are properly fixed. In certain…
By using some techniques such as spectral distribution and stratification associated with the graphs, employed in [1,2] for the purpose of Perfect state transfer (PST) of a single qubit over antipodes of distance-regular spin networks and…
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
We propose a quantum key distribution scheme which closely matches the performance of a perfect single photon source. It nearly attains the physical upper bound in terms of key generation rate and maximally achievable distance. Our scheme…
A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent…
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…
Predicting horizontal gene transfers often requires comparative sequence data, but recent work has shown that character-based approaches could also be useful for this task. Notably, perfect transfer networks (PTN) explain the character…
Quantum state transfer in a triangular domain of a two-dimensional, equally-spaced, spin lat- tice with non-homogeneous nearest-neighbor couplings is analyzed. An exact solution of the one- excitation dynamics is provided in terms of…
We introduce an analytical $XX$ spin chain with asymmetrical transport properties. It has an even number $N+1$ of sites labeled by $n=0,\cdots N$. It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first…
Efficient quantum-state transfer is achieved in a uniformly coupled spin-1/2 chain, with open boundaries, by application of local magnetic fields on the second and last-but-one spins, respectively. These effective \textit{barriers} induce…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
A continuous-time quantum walk on a graph evolves according to the unitary operator $e^{-iAt}$, where $A$ is the adjacency matrix of the graph. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node…
We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for…
In this paper, we study a general linear networked system that contains a tunable memory subsystem; that is, it is decoupled from an optical field for state transportation during the storage process, while it couples to the field during the…
The thesis covers various aspects of quantum state transfer in permanently coupled spin systems.