Skip to main content
Log in

Quantum Computation of Fuzzy Numbers

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

We study the possibility of performing fuzzy set operations on a quantum computer. After giving a brief overview of the necessary quantum computational and fuzzy set theoretical concepts we demonstrate how to encode the membership function of a digitized fuzzy number in the state space of a quantum register by using a suitable superposition of tensor product states that form a computational basis. We show that a standard quantum adder is capable to perform Kaufmann's addition of fuzzy numbers in the course of only one run by acting at once on all states in the superposition, which leads to a considerable gain in the number of required operations with respect to performing such addition on a classical computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  • Dubois, D. and Prade, H. (1980). Fuzzy Sets and Systems. Theory and Applications, Academic Press, New York.

    Google Scholar 

  • Ekert, A. and Jozsa, R. (1996). Quantum computation and Shor's factoring algorithm. Reviews of Modern Physics 68, 733–753.

    Google Scholar 

  • Kaufmann, A. (1975). Introduction to the Theory of Fuzzy Subsets, Vol. I, Academic Press, New York.

    Google Scholar 

  • Pykacz, J. (1987). Quantum logics as families of fuzzy subsets of the set of physical states. In Preprints of the Second IFSA Congress, Tokyo, Vol. 2, International Fuzzy Systems Association, Japan Chapter, Tokyo, 1987, pp. 437–440.

    Google Scholar 

  • Pykacz, J. (1994). Fuzzy quantum logics and infinite-valued L ukasiewicz logic. International Journal of Theoretical Physics 33, 1403–1416.

    Google Scholar 

  • Pykacz, J. (1998). Fuzzy quantum logics as a basis for quantum probability theory, International Journal of Theoretical Physics 37, 281–290.

    Google Scholar 

  • Pykacz, J. (2000a). L ukasiewicz operations in fuzzy set and many-valued representation of quantum logics. Foundations of Physics 37, 1503–1524.

    Google Scholar 

  • Pykacz, J. (2000b). Quantum logic as a basis for computations. International Journal of Theoretical Physics 39, 839–850.

    Google Scholar 

  • Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, S. Goldwasser, ed., IEEE Computer Society Press, Los Alamitos, CA, pp. 124–134.

    Google Scholar 

  • Vedral, V., Barenco, A., and Ekert, A. (1996). Quantum networks for elementary arithmetic operations, Physical Review A 54, 147–153.

    Google Scholar 

  • Vedral, V. and Plenio, M. B. (1998). Basics of quantum computation. Progress of Quantum Electronics 22,1–40; see also e-print: quant-ph/9802065.

    Google Scholar 

  • Zalka, C. (1998). Simulating quantum systems on a quantum computer. Proceedings of the Royal Society of London Series A 454, 313–32; see also e-print: quant-ph/9603026.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

D'hooghe, B., Pykacz, J. & Zapatrin, R.R. Quantum Computation of Fuzzy Numbers. International Journal of Theoretical Physics 43, 1423–1432 (2004). https://doi.org/10.1023/B:IJTP.0000048625.57350.4f

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:IJTP.0000048625.57350.4f

Navigation