Related papers: State Transfer on Paths with Weighted Loops
We provide a bound for the trace distance between two quantum states. The lower bound is based on the superfidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be…
For many quantum information protocols such as state transfer, entanglement transfer and entanglement generation, standard notions of controllability for quantum systems are too strong. We introduce the weaker notion of accessible pairs,…
This paper concerns branching simulation for weighted Kripke structures with parametric weights. Concretely, we consider a weighted extension of branching simulation where a single transitions can be matched by a sequence of transitions…
We investigate quantum teleportation through dissipative channels and calculate teleportation fidelity as a function of damping rates. It is found that the average fidelity of teleportation and the range of states to be teleported depend on…
We consider an inhomogeneous XX spin chain which interpolates between the Krawtchouk one with perfect state transfer and the homogeneous XX chain. This model can be exploited in order to perform state transfer of a qubit with sufficiently…
We present a general theoretical formalism to compute the fidelity of transformations of unknown quantum states. We then focus on the case of Gaussian transformations of continuous variable quantum systems, where, for the case of a Gaussian…
We study transfer of a quantum state through XX spin chains with static imperfections. We combine the two standard approaches for state transfer based on (i) modulated couplings between neighboring spins throughout the spin chain and (ii)…
The transport of quantum states is a crucial aspect of information processing systems, facilitating operations such as quantum key distribution and inter-component communication within quantum computers. Most quantum networks rely on…
We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. In particular, we focus on states associated to vertices of a graph. We call such states vertex type states. Perfect state transfer…
Connections between the electron eigenstates and conductivity of one-dimensional disordered electron systems is studied in the framework of the tight-binding model. We show that for weak disorder only part of the states exhibit resonant…
Quantum teleportation can transfer an unknown quantum state between distant quantum nodes, which holds great promise in enabling large-scale quantum networks. To advance the full potential of quantum teleportation, quantum states must be…
We provide a class of initial encodings that can be sent with a high fidelity over an unmodulated, linear, XY spin chain. As an example, an average fidelity of ninety-six percent can be obtained using an eleven-spin encoding to transmit a…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
Quantum state transfer (QST) describes the coherent passage of quantum information from one node in a network to another. Experiments on QST span a diverse set of platforms and currently report transport across up to tens of nodes in times…
Entangled coherent states can be used to determine the entanglement fidelity for a device that is designed to teleport coherent states. This entanglement fidelity is universal, in that the calculation is independent of the use of entangled…
We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…
The determination of the state fidelity and the detection of entanglement are fundamental problems in quantum information experiments. We investigate how these goals can be achieved with a minimal effort. We show that the fidelity of GHZ…