Bounds on probability of state transfer with respect to readout time and edge weight
arXiv:1510.05550 · doi:10.1103/PhysRevA.93.022309
Abstract
We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the probability of state transfer. At the heart of our analysis is the concept of the numerical range of a matrix; our analysis of edge weight errors additionally makes use of the spectral and Frobenius norms.
8 pages; fixed numerous typos (in particular, in proofs of Proposition III.2 and Theorem III.3
References in corpus (6)
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Perfect State Transfer: Beyond Nearest-Neighbor Couplings
- From perfect to fractal transmission in spin chains
- Quantum Networks on Cubelike Graphs
- Effect of perturbations on information transfer in spin chains
- Spin systems dynamics and faults detection in threshold networks