Simplifying Continuous-Time Quantum Walks on Dynamic Graphs

DOI10.1007/S11128-021-03403-7MaRDI QIDQ6370022arXivFDO

Authors Rebekah Herrman, Thomas G. Wong

Publication date 10 June 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11128-021-03403-7

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

arXiv classification

math.COquant-ph

Abstract: A continuous-time quantum walk on a dynamic graph evolves by Schr"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that implements a quantum circuit can be quite complicated. In this paper, we give six scenarios under which a dynamic graph can be simplified, and they exploit commuting graphs, identical graphs, perfect state transfer, complementary graphs, isolated vertices, and uniform mixing on the hypercube. As examples, we simplify dynamic graphs, in some instances allowing single-qubit gates to be implemented in parallel.

This page was built for publication: Simplifying Continuous-Time Quantum Walks on Dynamic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370022)