Efficient quantum circuits for continuous-time quantum walks on composite graphs

T. Loke, J. B. Wang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform the simulation exactly, i.e.ϵ = 0, while maintaining poly(log(n)) efficiency. In particular, we discuss two classes of composite graphs, commuting graphs and Cartesian product of graphs, that contain classes of graphs which can be simulated in this fashion. This allows us to identify new families of graphs that we can efficiently simulate in a quantum circuit framework, providing practical and explicit means to explore quantum-walk based algorithms in laboratories.

Original languageEnglish
Article number055303
Pages (from-to)1-11
Number of pages11
JournalJournal of Physics A: Mathematical and Theoretical
Volume50
Issue number5
DOIs
Publication statusPublished - 6 Jan 2017
Externally publishedYes

Keywords

  • composite graph
  • quantum circuit
  • quantum walk

Fingerprint Dive into the research topics of 'Efficient quantum circuits for continuous-time quantum walks on composite graphs'. Together they form a unique fingerprint.

Cite this