Quantum Computers as Fuzzy Computers

  • Jarosław Pykacz
  • Bart D’Hooghe
  • Roman R. Zapatrin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2206)

Abstract

An implementation of digitised fuzzy numbers on quantum computers is suggested. It is shown that due to the famous quantum parallelism quantum computers can operate “globally”on whole membership functions of fuzzy numbers,not by calculating them “point by point” as classical computers do, which leads to the considerable decrease in the number of operations involved in storing and calculating fuzzy numbers. In particular, we show that the standard quantum adder is perfectly suited to realize Kaufmann-like addition of fuzzy numbers encoded in the form of suitably prepared superpositions of input qubits and that it does it in a single run. Although this computational gain is to some extent lost while reading the output, which has to be done statistically on the enough big sample of single runs of the adder, suitably chosen method of defuzzyfication allows to save a great deal of the original gain.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dubois, D. Prade, H.: Fuzzy Sets and Systems. Theory and Applications, Academic Press, New York, (1980)MATHGoogle Scholar
  2. 2.
    Ekert, A., Jozsa, R.: Quantum Computation and Shor’s Factoring Algorithm, Rev. Mod. Phys. 68 (1996) 733–753CrossRefMathSciNetGoogle Scholar
  3. 3.
    Kaufmann, A.: Introduction to the Theory of Fuzzy Subsets, Vol. I, Academic Press, New York, (1975)MATHGoogle Scholar
  4. 4.
    Mareš, M., et al., (eds): Proc.7th IFSA World Congress, Prague, July 1997, Academia, Prague, (1997)Google Scholar
  5. 5.
    Pykacz, J.: Quantum Logic as a Basis for Computations, International Journal of Theoretical Physics, 39 (2000) 839–850MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Shor, P.W.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring, In: Goldwasser, S. (ed.): Proc. 35th Ann. Symp. Found. Comp. Sci. IEEE Computer Society Press, Los Alamitos, CA (1994) 124–134CrossRefGoogle Scholar
  7. 7.
    Vedral, V., Barenco, A., Ekert, A.: Quantum Networks for Elementary Arithmetic Operations, Phys. Rev. A 54 (1996) 147–153CrossRefMathSciNetGoogle Scholar
  8. 8.
    Vedral, V., Plenio, M.B.: Basics of Quantum Computation, Progress of Quantum Electronics 22 (1998) 1–40; see also e-print: quant-ph/9802065CrossRefGoogle Scholar
  9. 9.
    Zadeh, L.A.: A Fuzzy Set Theoretic Interpretation of Linguistic Hedges, J. of Cybernetics 2 (1972) 4–34MathSciNetCrossRefGoogle Scholar
  10. 10.
    Zalka, C.: Simulating Quantum Systems on a Quantum Computer, Proc. R. Soc. Lond. A454 (1998) 313–32; see also e-print:quant-ph/9603026Google Scholar
  11. 11.
    Zapatrin, R.R., Logic Programming As Quantum Measurement, International Journal of Theoretical Physics, 34, 1813–1821, (1995), see also e-print:quant-ph/9506041CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jarosław Pykacz
    • 1
  • Bart D’Hooghe
    • 2
  • Roman R. Zapatrin
    • 3
  1. 1.Uniwersytet GdańskiInstytut MatematykiGdańskPoland
  2. 2.Vrije Universiteit BrusselDepartement WiskundeBrusselBelgium
  3. 3.Starlab nv/saBrusselBelgium

Personalised recommendations