Simplifying continuous-time quantum walks on dynamic graphs

Rebekah Herrman, Thomas G. Wong

Research output: Contribution to journalArticlepeer-review

Abstract

A continuous-time quantum walk on a dynamic graph evolves by Schrödinger’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.

Original languageEnglish (US)
Article number54
JournalQuantum Information Processing
Volume21
Issue number2
DOIs
StatePublished - Feb 2022

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Statistical and Nonlinear Physics
  • Theoretical Computer Science
  • Signal Processing
  • Modeling and Simulation
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Simplifying continuous-time quantum walks on dynamic graphs'. Together they form a unique fingerprint.

Cite this