We present an algorithm to design networks that feature pretty good state transfer (PGST), which is of interest for high-fidelity transfer of information in quantum computing. Realizations of PGST networks have so far mostly relied either on very special network geometries or imposed conditions such as transcendental on-site potentials. However, it was recently shown that PGST generally arises when a network's eigenvectors and the factors ${P}_{\ifmmode\pm\else\textpm\fi{}}$ of its characteristic polynomial
P fulfill certain conditions, where ${P}_{\ifmmode\pm\else\textpm\fi{}}$ correspond to eigenvectors which have $\ifmmode\pm\else\textpm\fi{}1$ parity on the input and target sites. We combine this result with the so-called isospectral reduction of a network to obtain ${P}_{\ifmmode\pm\else\textpm\fi{}}$ from a dimensionally reduced form of the Hamiltonian. Equipped with the knowledge of the factors ${P}_{\ifmmode\pm\else\textpm\fi{}}$, we show how a variety of setups can be equipped with PGST by proper tuning of ${P}_{\ifmmode\pm\else\textpm\fi{}}$. Having demonstrated a method of designing networks featuring pretty good state transfer of single site excitations, we further show how the obtained networks can be manipulated such that they allow for robust storage of qubits. We hereby rely on the concept of compact localized states, which are eigenstates of a Hamiltonian localized on a small subdomain, and whose amplitudes completely vanish outside of this domain. Such states are natural candidates for the storage of quantum information, and we show how certain Hamiltonians featuring pretty good state transfer of single site excitation can be equipped with compact localized states such that their transfer is made possible.
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an involution that fixes at least one vertex or at least one edge, then there exists a choice of potential on the vertex set of the graph for which we get pretty good state transfer between symmetric vertices of the graph. We show further that in many cases, the potential can be chosen so that it is only non-zero at the vertices between which we want pretty good state transfer. As a special case of this, we show that such a potential can be chosen on the endpoints of a path to induce pretty good state transfer in paths of any length. This is in contrast to the result of [6], in which the authors show that there cannot be perfect state transfer in paths of length 4 or more, no matter what potential is chosen.