Quantum walks on general graphs

Kendon, Viv (2006) Quantum walks on general graphs. International Journal of Quantum Information, 4 (5). pp. 791-805. ISSN 1793-6918 (https://doi.org/10.1142/S0219749906002195)

Preview

Text. Filename: Kendon_IJQI_2006_Quantum_walks_on_general_graphs.pdf Accepted Author Manuscript Download (155kB)| Preview

Abstract

Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are compared and found to be very similar for both discrete and continuous time walks. The role of the oracle, and how it changes if more prior information about the graph is available, is also discussed.

ORCID iDs

Kendon, Viv ORCID: https://orcid.org/0000-0002-6551-3056

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	78872
  Dates:	Date Event 31 October 2006 Published 5 February 2006 Accepted
  Subjects:	Science > Physics Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Physics
  Depositing user:	Pure Administrator
  Date deposited:	09 Dec 2021 16:43
  Last modified:	11 Nov 2024 13:19
  Related URLs:	Related item
  URI:	https://strathprints.strath.ac.uk/id/eprint/78872