Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
From MaRDI portal
Publication:6370022
DOI10.1007/S11128-021-03403-7arXiv2106.06015MaRDI QIDQ6370022
Author name not available (Why is that?)
Publication date: 10 June 2021
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.
No records found.
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)