Perfect edge state transfer on cubelike graphs
arXiv:2003.10624
Abstract
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we show that every bent function, and some semi-bent functions as well, can produce some graphs having PEST. Some concrete constructions of such graphs are provided. Notably, using our method, one can obtain some classes of infinite graphs possessing PEST.
References in corpus (8)
- Quantum Communication Through an Unmodulated Spin Chain
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- Universal computation by quantum walk
- Exponential algorithmic speedup by quantum walk
- Quantum Networks on Cubelike Graphs
- Perfect state transfer in cubelike graphs
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs