Advertisement

Quantum Distributed Computing Applied to Grover’s Search Algorithm

  • Debabrata GoswamiEmail author
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8808)

Abstract

Grover’s Algorithm finds a unique element in an unsorted stock of \(N\)-elements in \(\sqrt{N}\) queries through quantum search. A single-query solution can also be designed, but with an overhead of \(N\log _2 N\) steps to prepare and post process the query, which is worse than the classical \(N/2\) queries. We show here that by distributing the computing load on a set of quantum computers, we achieve better information theoretic bounds and relaxed space scaling. Howsoever small one quantum computing node is, by virtue of networking and sharing of data, we can virtually work with a sufficiently large qubit space.

Keywords

Distributed quantum computing Grover’s quantum search Optical networking 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gruska, J.: Foundations of Computing, ITCP Computer Science Series: (International Thomson Computer Press), 716 pages (1997)Google Scholar
  2. 2.
    Feynman, R.P.: Int. J. Theor. Physics 21, 467 (1982)Google Scholar
  3. 3.
    Deutsch, D.: Proc. Roy. Soc. London 97, 400 (1985)Google Scholar
  4. 4.
    Shor, P.W.: Proceedings of the Symposium on the Foundations of Computer Science: Los Alamos, California, pp. 124–134. IEEE Computer Society Press, New York (1994)Google Scholar
  5. 5.
    Bell, J.S.: The Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press (1987)Google Scholar
  6. 6.
    Nielsen, M.A., Chuang, I.L.: Quantum Computing and Quantum Information. Cambridge University Press, Cambridge (2000)Google Scholar
  7. 7.
    Grover, L.K.: Proceedings of the Twenty-Eighth Annual Symposium on the Theory of Computing: Philadelphia, Pennsylvania, pp. 212–218. ACM Press, New York (1996)Google Scholar
  8. 8.
    Grover, L.K.: Quantum Mechanics Helps in Searching for a Needle in a Haystack. Phys. Rev. Letters, 325–328 (1997)Google Scholar
  9. 9.
    Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: SIAM J. Computing, 1510–1524 (1997)Google Scholar
  10. 10.
    Grover, L.K.: Quantum Computers Can Search Arbitrarily Large Databases by a Single Query. Phys. Rev. Letters, 4709 (1997)Google Scholar
  11. 11.
    Goswami, D.: Laser Phase Modulation Approaches towards Ensemble Quantum Computing. Phys. Rev. Letters, 177901 (2002)Google Scholar
  12. 12.
    Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature, 390–393 (1999)Google Scholar
  13. 13.
    Sinha, M., Goswami, D.: System and method for improved coherent pulsed communication system having spectrally shaped pulses. US Patent (2004) US2004/0208613 A1 (October 21, 2004)Google Scholar
  14. 14.
    Schuch, N., Siewert, J.: Programmable Networks for Quantum Algorithms. Phys. Rev. Letters, 027902 (2003)Google Scholar
  15. 15.
    Miranowicz, A., Tamaki, K.: An Introduction to Quantum Teleportation. Math. Sciences, 28–34 (2002)Google Scholar
  16. 16.
    Boyer, M., Brassard, G., Hyer, P., Tapp, A.: Proceedings of 4th Workshop on Physics and Computation, Boston, MA, pp. 36–43 (1996)Google Scholar
  17. 17.
    Feller, W.: An Introduction to Probability Theory and Its Applications, vols. I and II. John Wiley, New York (1971),Google Scholar
  18. 18.
    Knuth, D.E.: Fundamentals of Algorithms: The Art of Computer Programming. Addison-Wesley, Reading(1973)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Indian Institute of Technology KanpurKanpurIndia

Personalised recommendations