Analysis of absorbing times of quantum walks

被引：23

作者：

Yamasaki, T

Kobayashi, H

Imai, H

机构：

[1] Univ Tokyo, Grad Sch Sci, Dept Informat Sci, Bunkyo Ku, Tokyo 113033, Japan

[2] Japan Sci & Technol Corp, Exploratory Res Adv Technol, Quantum Computat & Informat Project, Bunkyo Ku, Tokyo 1130033, Japan

[3] Univ Tokyo, Grad Sch Informat Sci & Technol, Dept Comp Sci, Bunkyo Ku, Tokyo 1130033, Japan

来源：

PHYSICAL REVIEW A | 2003年 / 68卷 / 01期

关键词：

D O I：

10.1103/PhysRevA.68.012302

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.

引用

页数：9

共 17 条

[1]

Andris Ambainis, 2001, P 33 ANN ACM S THEOR, P37, DOI DOI 10.1145/380752.380757

[2]

[Anonymous], LNCS

[3]

[Anonymous], PROBABILISTIC ALGORI

[4]

Bach E., QUANTPH0207008

[5]

CHILDS AM, P 35 ANN ACM S THEOR

[6] An Example of the Difference Between Quantum and Classical Random Walks [J].

Childs, Andrew M. ;

Farhi, Edward ;

Gutmann, Sam .

QUANTUM INFORMATION PROCESSING, 2002, 1 (1-2) :35-43

[7]

Dorit Aharonov, 2001, P 33 ANN ACM S THEOR, P50, DOI DOI 10.1145/380752.380758

[8] A RANDOM POLYNOMIAL-TIME ALGORITHM FOR APPROXIMATING THE VOLUME OF CONVEX-BODIES [J].

DYER, M ;

FRIEZE, A ;

KANNAN, R .

JOURNAL OF THE ACM, 1991, 38 (01) :1-17

[9] Quantum computation and decision trees [J].

Farhi, E ;

Gutmann, S .

PHYSICAL REVIEW A, 1998, 58 (02) :915-928

[10]

Grover L. K., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC'96, P212, DOI [10.1145/237814.237866, DOI 10.1145/237814.237866]

← 1 2 →