Quantum walks on general graphs

被引：68
作者：
Kendon, Viv [1 ]
机构：
[1] Univ London Imperial Coll Sci Technol & Med, Blackett Lab, Opt Sect, London SW7, England
来源：
INTERNATIONAL JOURNAL OF QUANTUM INFORMATION | 2006年 / 4卷 / 05期
基金：
英国工程与自然科学研究理事会;
关键词：
quantum walks; quantum algorithms; quantum information;
D O I：
10.1142/S0219749906002195
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：791 / 805
页数：15
相关论文
共 28 条
  • [1] Aharonov Dorit, 2001, arXiv: quant-ph/0012090, P50
  • [2] QUANTUM RANDOM-WALKS
    AHARONOV, Y
    DAVIDOVICH, L
    ZAGURY, N
    [J]. PHYSICAL REVIEW A, 1993, 48 (02): : 1687 - 1690
  • [3] Ahmadi A, 2003, QUANTUM INFORM COMPU, V3, P611
  • [4] AMBAINIS A, 2001, P 33 ACM S THEOR COM, P60, DOI DOI 10.1145/380752.380757
  • [5] QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
    Ambainis, Andris
    [J]. INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2003, 1 (04) : 507 - 518
  • [6] [Anonymous], 1964, DISKRET ANAL
  • [7] Climbing mount scalable: Physical resource requirements for a scalable quantum computer
    Blume-Kohout, R
    Caves, CM
    Deutsch, IH
    [J]. FOUNDATIONS OF PHYSICS, 2002, 32 (11) : 1641 - 1670
  • [8] Childs A. M., 2003, P 35 ANN ACM S THEOR, P59, DOI DOI 10.1145/780542.780552
  • [9] Spatial search and the Dirac equation
    Childs, AM
    Goldstone, J
    [J]. PHYSICAL REVIEW A, 2004, 70 (04): : 042312 - 1
  • [10] Spatial search by quantum walk
    Childs, AM
    Goldstone, J
    [J]. PHYSICAL REVIEW A, 2004, 70 (02): : 022314 - 1
123