Abstract
In number of Internet applications we need to search for objects to down load them. This includes peer-to-peer (P2P) file sharing, grid computing and content distribution networks. Here the single object will be searched for in multiple servers. There are many searching algorithms existing today for this purpose and uses the concept of classical physics and classical algorithms. The principles of quantum mechanics can be used to build and analyze a quantum computer and its algorithms. Quantum searching is one such algorithm. In this paper we are proposing a search method based on quantum physics and quantum algorithms.
Chapter PDF
Similar content being viewed by others
References
Apoorva Patel, Quantum Database Search can do without Sorting, quant-ph/0012149.
Graciela perera, Ken Christensen and Allen Roginsky, Targeted search: Reducing the Time and Cost for Searching for Objects in Multiple-Server Networks, IEEE transaction, 2005, pp 143–149.
Grover L.K, (1996), A Fast Quantum mechanical Algorithm for Database Search, In proceedings of the 28th Annual ACM Symposium on the Theory of Computing,pp.212–219,quant-ph/9605043.
Nielsen M and Chaung, I (2000), Quantum Computation and Quantum Information, Cambridge University press, Cambridge, United Kingdom.
S. Saroiu, P. Gummadi, and S. Gribble, A measurement Study of Peer-to-Peer File Sharing Systems, Proceedings of SPIE, pp. 156–170, 2001.
R. Schollmeier and G. Schollmeier, Why Peer-to-Peer (P2P) Does Scale: An Analysis of P2P Traffic Patterns, Proceedings of the 2nd International Conference on Peer-to-Peer Computing, pp. 112–119, 2002.
B. Yang, P. Cao, and H. Molina, Efficient Search in Peer-to-Peer Networks, Proceedings of the International Conference on Distributed Computing Systems, pp. 5–14,2002.
Terry Rudolph and Dr. Lov Grover, (2002), Quantum Searching a classical database, quant-ph/0206066.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Phaneendra, H.D., Shivakumar, M.S. (2006). Quantum Search: Reduces the Time and Cost for Searching for Objects in Multiple-Server Peer-To-Peer Networks. In: Shi, Z., Shimohara, K., Feng, D. (eds) Intelligent Information Processing III. IIP 2006. IFIP International Federation for Information Processing, vol 228. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-44641-7_19
Download citation
DOI: https://doi.org/10.1007/978-0-387-44641-7_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-44639-4
Online ISBN: 978-0-387-44641-7
eBook Packages: Computer ScienceComputer Science (R0)