Maximum Likelihood Based Quantum Set Separation

  • Sándor Imre
  • Ferenc Balázs
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3036)


In this paper we introduce a method, which is used for set separation based on quantum computation. In case of no a-priori knowledge about the source signal distribution, it is a challenging task to find an optimal decision rule which could be implemented in the separating algorithm. We lean on the Maximum Likelihood approach and build a bridge between this method and quantum counting. The proposed method is also able to distinguish between disjunct sets and intersection sets.


Quantum Search Optimal Decision Rule Conditional Probability Density Function Quantum Search Algorithm Separation Decision 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Fukunaga, K.: Introduction to Statistical Pattern Recognition, 2nd edn. Electrical Science, H.G. Booker & N. DeClaris, Ed. Academia Press, INC., New York (1972)Google Scholar
  2. 2.
    Shor, P.: Quantum computing. Documenta Mathematica, vol. 1-1000 (1998), extra Volume ICMGoogle Scholar
  3. 3.
    Deutsch, D.: Quantum theory of probability and decisions. Proc. R. Soc. London, Ser. A (2000)Google Scholar
  4. 4.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  5. 5.
    Ekert, A., Hayden, P., Inamori, H.: Basic concepts in quantum computation (January 16, 2000)Google Scholar
  6. 6.
    Imre, S., Balázs, F.: Quantum multi-user detection. In: Proc. 1st. Workshop on Wireless Services & Applications, Paris-Evry, France, July 2001, pp. 147–154 (2001) ISBN: 2-7462-0305-7Google Scholar
  7. 7.
    Imre, S., Balázs, F.: Non-coherent multi-user detection based on quantum search. In: IEEE International Conference on Communication, ICC (2002)Google Scholar
  8. 8.
    Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. London, Ser. A, 439–553 (1992)Google Scholar
  9. 9.
    Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings, 28th Annual ACM Symposium on the Theory of Computing, May 1996, pp. 212–219 (1996) e-print quant-ph/9605043Google Scholar
  10. 10.
    Grover, L.: How fast can a quantum computer search? (April 1999) Google Scholar
  11. 11.
    Zalka, C.: Grover’s quantum searching algorithm is optimal, e-print quantph/ 9711070v2 (December 1999)Google Scholar
  12. 12.
    Imre, S., Balázs, F.: The generalized quantum database search algorithm. Submitted to Computing Journal (2003)Google Scholar
  13. 13.
    Brassard, G., Hoyer, P., Tapp, A.: Quantum counting. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 820. Springer, Heidelberg (1998), [Online]. Available:

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Sándor Imre
    • 1
  • Ferenc Balázs
    • 1
  1. 1.Mobile Communications & Computing Laboratory, Department of TelecommunicationsBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations