Hitting time of quantum walks with perturbation
From MaRDI portal
Publication:1937291
DOI10.1007/s11128-012-0368-9zbMath1263.81235arXiv1107.2965MaRDI QIDQ1937291
Chen-Fu Chiang, Guillermo L. Gómez M.
Publication date: 28 February 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2965
Markov chain; random walk; hitting time; quantum walk; matrix perturbation; delayed perturbed hitting time; delayed perturbed quantum hitting time
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the relationship between continuous- and discrete-time quantum walk
- Norms and exclusion theorems
- Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
- On the distribution of the largest eigenvalue in principal components analysis
- On the hitting times of quantum versus random walks
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Polynomial-Time Approximation Algorithms for the Ising Model
- Quantum Walk Based Search Algorithms
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds
- Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices
- Comparison of perturbation bounds for the stationary distribution of a Markov chain