Advertisement

Quantum Search: Reduces the Time and Cost for Searching for Objects in Multiple-Server Peer-To-Peer Networks

  • Phaneendra H. D. 
  • M. S. Shivakumar
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 228)

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.

Keywords

Quantum mechanics Quantum algorithm qubits Quantum search linear search object 

References

  1. 1.
    Apoorva Patel, Quantum Database Search can do without Sorting, quant-ph/0012149.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Nielsen M and Chaung, I (2000), Quantum Computation and Quantum Information, Cambridge University press, Cambridge, United Kingdom.zbMATHGoogle Scholar
  5. 5.
    S. Saroiu, P. Gummadi, and S. Gribble, A measurement Study of Peer-to-Peer File Sharing Systems, Proceedings of SPIE, pp. 156–170, 2001.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    Terry Rudolph and Dr. Lov Grover, (2002), Quantum Searching a classical database, quant-ph/0206066.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Phaneendra H. D. 
    • 1
    • 2
  • M. S. Shivakumar
    • 1
    • 2
  1. 1.Department of Computer Science and EngineeringThe National Institute of EngineeringMysore, KarnatakaIndia
  2. 2.The National Institute of EngineeringMysore, KarnatakaIndia

Personalised recommendations