Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/hitting-time-of-quantum-walks-with-perturbation-n3Od0zPzpE
References (17)
-
M. Jerrum, A. Sinclair, E. Vigoda (2004)
A polynomial-time approximation algorithm for the permanent of a matrix non-negative entriesJ. ACM, 51
-
B. Parlett (1998)
The Symmetric Eigenvalue Problems -
C. Chiang, D. Nagaj, P. Wocjan (2010)
Efficient circuits for the quantum walksQIC, 10
-
G. Cho, C. Meyer (2001)
Comparison of perturbation bounds for the stationary distribution of a Markov chainLinear Algebra Appl., 335
-
R. Bhatia (1997)
Matrix Analysis -
I. Bezáková, D. Štefankovič, V. Vazirani, E. Vigoda (2008)
Accelerating simulated annealing for the permanent and combinatorial counting problemsSIAM J. Comput., 37
-
E. Farhi, S. Gutmann (1998)
Quantum computation and decision treesPhys. Rev. A, 58
-
S. Eisenstat, I. Ipsen (1999)
Three absolute perturbation bounds for matrix eigenvalues imply relative boundsSIAM J. Matrix Anal. Appl., 20
-
M.A. Jafarizadeh, S. Salimi (2007)
Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrixAnn. Phys., 322
-
M. Jerrum, A. Sinclair (1993)
Polynomial-time approximation algorithms for the Ising modelSIAM J. Comput., 22
-
Y. Aharonov, L. Davidovich, N. Zagury (1993)
Quantum random walksPhys. Rev. A, 48
-
I. Ipsen, B. Nadler (2009)
Refined perturbation bounds for eigenvalues of Hermitian and non-Hermitian matricesSIAM J. Matrix Anal. Appl., 31
-
F. Bauer, C. Fike (1960)
Norms and exclusion theoremsNumer. Math., 2
-
A. Childs (2010)
On the relationship between continuous- and discrete-time quantum walkCommun. Math. Phys., 294
-
I. Johnstone (2001)
On the distribution of the largest eigenvalue in principal components analysisAnn. Stat., 29
-
L. Lovász, S. Vempala (2006)
Simulated annealing in convex bodies and an O*(n 4) volume algorithmJ. Comput. Syst. Sci., 72
-
G. Golub, C. Loan (1996)
Matrix Computations
- Publisher
- Springer Journals
- Copyright
- Copyright © 2012 by Springer Science+Business Media, LLC
- Subject
- Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
- ISSN
- 1570-0755
- eISSN
- 1573-1332
- DOI
- 10.1007/s11128-012-0368-9
- Publisher site
- See Article on Publisher Site
Abstract
The hitting time is the required minimum time for a Markov chain-based walk (classical or quantum) to reach a target state in the state space. We investigate the effect of the perturbation on the hitting time of a quantum walk. We obtain an upper bound for the perturbed quantum walk hitting time by applying Szegedy’s work and the perturbation bounds with Weyl’s perturbation theorem on classical matrix. Based on the definition of quantum hitting time given in MNRS algorithm, we further compute the delayed perturbed hitting time and delayed perturbed quantum hitting time (DPQHT). We show that the upper bound for DPQHT is bounded from above by the difference between the square root of the upper bound for a perturbed random walk and the square root of the lower bound for a random walk.
Journal
Quantum Information Processing – Springer Journals
Published: Feb 9, 2012