5 papers
Laziness of Quantum Walks on Graphs
Amulya Mohan, Christino Tamon, Yichi Xu +1
The trace of the average mixing matrix of a quantum walk measures the "laziness" of the walk: the higher the trace, the more likely that the walker returns home in the long run. In…
Uniform Mixing in Chiral Quantum Walks
Luke Levine, Jessy Jacob Mesapam, Benjamin Mustico +3
This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing , the complete graph has probabilistic uniform mixing. In con…
The strength of weak coupling
Alastair Kay, Christino Tamon
A paradoxical idea in quantum transport is that attaching weakly-coupled edges to a large base graph creates high-fidelity quantum state transfer. We provide a mathematical treatme…
Matrix Inversion by Quantum Walk
Alastair Kay, Christino Tamon
The HHL algorithm for matrix inversion is a landmark algorithm in quantum computation. Its ability to produce a state that is the solution of , given the input st…
Optimising Perfect Quantum State Transfer for Timing Insensitivity
Alastair Kay, Sooyeong Kim, Christino Tamon
When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with…