Abstract
In this chapter we define a new model of discrete-time quantum walks on graphs without using an explicit coin operator. Instead, the model uses an auxiliary space by duplicating the original graph and forcing the walker to jump systematically from the original graph to the copy and vice versa. The graph and its copy form a bipartite graph. At the end, the copy is discarded. This model has many advantages over the standard quantum walk model and it allows to define the quantum hitting time in a natural and elegant way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aldous, D.J., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Book in preparation, http://www.stat.berkeley.edu/~aldous/book.html (200X)
Ambainis, A.: Quantum walk algorithm for element distinctness. In: FOCS ’04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 22–31. IEEE Computer Society, Washington, DC (2004)
Itakura, Y.K.: Quantum algorithm for commutativity testing of a matrix set. Master’s thesis, University of Waterloo, Waterloo (2005)
Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding is as easy as detecting for quantum walks. In: Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 6198, pp. 540–551. Springer, Berlin (2010)
Lovász, L.: Random walks on graphs: a survey. Combinatorics, Paul Erdös is Eighty, vol. 2), pp. 1–46 (1993)
Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221–232 (2007)
Magniez, F., Nayak, A., Richter, P., Santha, M.: On the hitting times of quantum versus random walks. In: Proceedings of 20th ACM-SIAM Symposium on Discrete Algorithms (2009)
Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of 39th ACM Symposium on Theory of Computing, pp. 575–584 (2007)
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413–424 (2007)
Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2001)
Motwani, R., Raghavan, P.: Randomized algorithms. ACM Comput. Surv. 28(1), 33–37 (1996)
Santos, R.A.M., Portugal, R.: Quantum hitting time on the complete graph. Int. J. Quant. Inform. 8(5), 881–894 (2010), arXiv:0912.1217
Szegedy, M.: Quantum speed-up of markov chain based algorithms. Annual IEEE symposium on foundations of computer science, pp. 32–41 (2004)
Szegedy, M.: Spectra of Quantized Walks and a δε Rule. (2004), quant-ph/0401053
Tulsi, A.: Faster quantum-walk algorithm for the two-dimensional spatial search. Phys. Rev. A 78(1), 012310 (2008)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Portugal, R. (2013). Hitting Time. In: Quantum Walks and Search Algorithms. Quantum Science and Technology. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6336-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6336-8_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6335-1
Online ISBN: 978-1-4614-6336-8
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)