Talk page
Title:
Quantum State Transfer on Graphs
Speaker:
Abstract:
Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer is the transmission of information from one part of the computer to another. This transmission can be implemented by spin chains, which can be modeled as a graph, and analyzed using algebraic graph theory. The ideal situation is that of perfect state transfer, where there exists a time interval during which the information is perfectly moved from one location to another. As perfect state transfer is relatively rare, we also consider pretty good state transfer, where for any desired level of accuracy, there exists a time interval during which the information transfer achieves this accuracy. We will discuss determining whether graphs admit perfect or pretty good state transfer.
Link:
Workshop: