Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Notes on Intuitionistic Fuzzy Sets

How to represent uncertainty via qudits: Probability distributions, regular, intuitionistic and picture fuzzy sets, F-transforms, etc.

Olga M. Kosheleva, Владик Крейнович

Published Sep 8, 2022• 0 citations
Publisher

Abstract

While modern computers are fast, there are still many important practical situations in which we need even faster computations. It turns out that, due to the fact that the speed of all communications is limited by the speed of light, the only way to make computers drastically faster is to drastically decrease the size of computer’s components. When we decrease their size to sizes comparable with micro-sizes of individual molecules, it becomes necessary to take into account specific physics of the micro-world – known as quantum physics. Traditional approach to designing quantum computers – i.e., computers that take effect of quantum physics into account – was based on using quantum analogies of bits (2-state systems). However, it has recently been shown that the use of multi-state quantum systems – called qudits – can make quantum computers even more efficient. When processing data, it is important to take into account that in practice, data always comes with uncertainty. In this paper, we analyze how to represent different types of uncertainty by qudits.

DOI
10.7546/nifs.2022.28.3.203-210

Related papers

Fast quantum algorithms for handling probabilistic and interval uncertainty

Владик Крейнович, Luc Longpré

Abstract In many real‐life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier‐to‐measure quantities x1, … , xn which are related to y by a known relation y = f(x1, … , xn). Measurements are never 100% accurate; hence, the measured values $ \tilde {x} _{i} $ are different from xi, and the resulting estimate $ \tilde {y} = f( \tilde {x} _{1} \ldots , \tilde {x} _{n}) $ is different from the desired value y = f(x1, … , xn). How different can it be? Traditional engineering approach to error estimation in data processing assumes that we know the probabilities of different measurement errors $ \Delta x_i {\mathop {=} \limits ^{\rm def}} \tilde x _i - x_i $. In many practical situations, we only know the upper bound Δi for this error; hence, after the measurement, the only information that we have about xi is that it belongs to the interval $ {\bf x}_i {\mathop {=} \limits ^{\rm def}} [ \tilde x _i - \Delta _i, \tilde x_i + \Delta _i] $. In this case, it is important to find the range y of all possible values of y = f(x1, … , xn) when xi ∈ xi. We start the paper with a brief overview of the computational complexity of the corresponding interval computation problems: Most of the related problems turn out to be, in general, at least NP‐hard. In this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether (and how) “hypothetic” physical devices can compute NP‐hard problems faster than in exponential time. Most of the paper's results were first presented at NAFIPS'2003 [30]. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Mathematical logic quarterly•Aug 18, 2004•20 citations

Fuzzy Logic on Quantum Annealers

Amir Pourabdollah, Giovanni Acampora, Roberto Schiattarella

Quantum computation is going to revolutionize the world of computing by enabling the design of massive parallel algorithms that solve hard problems in an efficient way, thanks to the exploitation of quantum mechanics effects, such as superposition, entanglement, and interference. These computational improvements could strongly influence the way how fuzzy systems are designed and used in contexts, such as Big Data, where computational efficiency represents a nonnegligible constraint to be taken into account. In order to pave the way toward this innovative scenario, this article introduces a novel representation of fuzzy sets and operators based on quadratic unconstrained binary optimization problems, so as to enable the implementation of fuzzy inference engines on a type of quantum computers known as quantum annealers.

IEEE Transactions on Fuzzy Systems•Sep 20, 2021•27 citations

Fuzzy Approach for Quantum Processors using Qutrits

Pradheep Kumar K

In this work, a fuzzy approach for Quantum processors using Qutrits has been proposed. Today Quantum computing has gained importance, as we need to have more computing power for transmitting large amount of data. Use of bits to transfer data, limits the amount of data and power as bits are capable of transmitting data in only two states namely 0 and 1. Qubits and Qutrits facilitate transmitting data in multiple states. This approach creates more states compared to those provided by bits. However, it would be ideal if more number of states are available for large amount of data processing. The fuzzy qubit approach attempts to enhance the number of states by using fuzzy membership functions. It takes into account the photon spin motion in generating the number of states. The Fuzzy Qutrit approach has been on Python platform using Qiskit package and it was observed that the computation time has reduced by 33%, compared to the conventional Fuzzy Qubit approach.

•Jan 1, 2019•1 citation

Fast quantum algorithms for handling probabilistic, interval, and fuzzy uncertainty

M. Martinez, Luc Longpré, Владик Крейнович +2 more

We show how quantum computing can speed up computations related to processing probabilistic, interval, and fuzzy uncertainty.

Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)•Jun 22, 2004•12 citations

Towards Parallel Quantum Computing: Standard Quantum Teleportation Algorithm Is, in Some Reasonable Sense, Unique

Oscar Galindo, Olga M. Kosheleva, Владик Крейнович

In many practical problems, the computation speed of modern computers is not sufficient. Due to the fact that all speeds are bounded by the speed of light, the only way to speed up computations is to further decrease the size of the memory and processing cells that form a computational device. At the resulting size level, each cell will consist of a few atoms -- thus, we need to take quantum effects into account. For traditional computational devices, quantum effects are largely a distracting noise, but new quantum computing algorithms have been developed that use quantum effects to speed up computations. In some problems, however, this expected speed-up may not be sufficient. To achieve further speed-up, we need to parallelize quantum computing. For this, we need to be able to transmit a quantum state from the location of one processor to the location of another one; in quantum computing, this process is known as teleportation. A teleportation algorithm is known, but it is not clear how efficient it is: maybe there are other more efficient algorithms for teleportation? In this paper, we show that the existing teleportation algorithm is, in some reasonable sense, unique -- and thus, optimal.

•Jan 1, 2018•2 citations

Representation of Classical Data on Quantum Computers

Thomas Lang, Anja Heim, Kilian Dremel +6 more

Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem which may be tackled using quantum computing, it is imperative to represent the data used onto a quantum computing system. Depending on the application, many different types of data and data structures occur, including regular numbers, higher-dimensional data structures, e.g., n-dimensional images, up to graphs. This report aims to provide an overview of existing methods for representing these data types on gate-based quantum computers.

arXiv:2410.00742•Oct 1, 2024•6 citations
While modern computers are fast, there are still many important practical situations in which we need even faster computations. It turns out that, due to the fact that the speed of all communications is limited by the speed of light, the only way to make computers drastically faster is to drastically decrease the size of computer’s components. When we decrease their size to sizes comparable with micro-sizes of individual molecules, it becomes necessary to take into account specific physics of the micro-world – known as quantum physics. Traditional approach to designing quantum computers – i.e., computers that take effect of quantum physics into account – was based on using quantum analogies of bits (2-state systems). However, it has recently been shown that the use of multi-state quantum systems – called qudits – can make quantum computers even more efficient. When processing data, it is important to take into account that in practice, data always comes with uncertainty. In this paper, we analyze how to represent different types of uncertainty by qudits.
Abstract In many real‐life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier‐to‐measure quantities x1, … , xn which are related to y by a known relation y = f(x1, … , xn). Measurements are never 100% accurate; hence, the measured values $ \tilde {x} _{i} $ are different from xi, and the resulting estimate $ \tilde {y} = f( \tilde {x} _{1} \ldots , \tilde {x} _{n}) $ is different from the desired value y = f(x1, … , xn). How different can it be? Traditional engineering approach to error estimation in data processing assumes that we know the probabilities of different measurement errors $ \Delta x_i {\mathop {=} \limits ^{\rm def}} \tilde x _i - x_i $. In many practical situations, we only know the upper bound Δi for this error; hence, after the measurement, the only information that we have about xi is that it belongs to the interval $ {\bf x}_i {\mathop {=} \limits ^{\rm def}} [ \tilde x _i - \Delta _i, \tilde x_i + \Delta _i] $. In this case, it is important to find the range y of all possible values of y = f(x1, … , xn) when xi ∈ xi. We start the paper with a brief overview of the computational complexity of the corresponding interval computation problems: Most of the related problems turn out to be, in general, at least NP‐hard. In this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether (and how) “hypothetic” physical devices can compute NP‐hard problems faster than in exponential time. Most of the paper's results were first presented at NAFIPS'2003 [30]. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Quantum computation is going to revolutionize the world of computing by enabling the design of massive parallel algorithms that solve hard problems in an efficient way, thanks to the exploitation of quantum mechanics effects, such as superposition, entanglement, and interference. These computational improvements could strongly influence the way how fuzzy systems are designed and used in contexts, such as Big Data, where computational efficiency represents a nonnegligible constraint to be taken into account. In order to pave the way toward this innovative scenario, this article introduces a novel representation of fuzzy sets and operators based on quadratic unconstrained binary optimization problems, so as to enable the implementation of fuzzy inference engines on a type of quantum computers known as quantum annealers.
In this work, a fuzzy approach for Quantum processors using Qutrits has been proposed. Today Quantum computing has gained importance, as we need to have more computing power for transmitting large amount of data. Use of bits to transfer data, limits the amount of data and power as bits are capable of transmitting data in only two states namely 0 and 1. Qubits and Qutrits facilitate transmitting data in multiple states. This approach creates more states compared to those provided by bits. However, it would be ideal if more number of states are available for large amount of data processing. The fuzzy qubit approach attempts to enhance the number of states by using fuzzy membership functions. It takes into account the photon spin motion in generating the number of states. The Fuzzy Qutrit approach has been on Python platform using Qiskit package and it was observed that the computation time has reduced by 33%, compared to the conventional Fuzzy Qubit approach.
In many practical problems, the computation speed of modern computers is not sufficient. Due to the fact that all speeds are bounded by the speed of light, the only way to speed up computations is to further decrease the size of the memory and processing cells that form a computational device. At the resulting size level, each cell will consist of a few atoms -- thus, we need to take quantum effects into account. For traditional computational devices, quantum effects are largely a distracting noise, but new quantum computing algorithms have been developed that use quantum effects to speed up computations. In some problems, however, this expected speed-up may not be sufficient. To achieve further speed-up, we need to parallelize quantum computing. For this, we need to be able to transmit a quantum state from the location of one processor to the location of another one; in quantum computing, this process is known as teleportation. A teleportation algorithm is known, but it is not clear how efficient it is: maybe there are other more efficient algorithms for teleportation? In this paper, we show that the existing teleportation algorithm is, in some reasonable sense, unique -- and thus, optimal.
Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem which may be tackled using quantum computing, it is imperative to represent the data used onto a quantum computing system. Depending on the application, many different types of data and data structures occur, including regular numbers, higher-dimensional data structures, e.g., n-dimensional images, up to graphs. This report aims to provide an overview of existing methods for representing these data types on gate-based quantum computers.