{'fraction_non_alphanumeric': 0.05291866028708134, 'fraction_numerical': 0.014832535885167464, 'mean_word_length': 4.278282828282828, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 2, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Generalized Rough Sets via Quantum Implications on Quantum Logic

: This paper introduces some new concepts of rough approximations via ﬁve quantum implications satisfying Birkhoff–von Neumann condition. We ﬁrst establish rough approximations via Sasaki implication and show the equivalence between distributivity of multiplication over join and some properties of rough approximations. We further establish rough approximations via other four quantum implication and examine their properties.

Quantum computers were first introduced by Feynman [19,20] and formalized by Deutsch [21]. Shor [22] gave a polynomial-time quantum algorithm for factoring integers in 1994 and Grover [23] introduced a quantum algorithm for unstructured searching in 1996. Their works greatly stimulated the research of quantum computation. With the advent of quantum computation, it is natural to ask the question: how to use the rough sets method in quantum computation and vice versa. Our method is from a logical point of view. Since quantum computation is a beautiful combination of quantum theory and computer science. As early as in 1936, in order to give a logic of quantum mechanics, Birkhoff and von Neumann [24] introduced quantum logic, whose algebraic model is an orthomodular lattice. Then, the issue is how to apply quantum logic in the analysis and design of rough sets. In the recent years, some scholars studied rough sets based on quantum logic. In 2017, Hassan [25] showed that rough set model with quantum logic can be used for recognition and classification systems. In our previous work [26,27], we proposed a rough set model based on quantum logic. We defined rough approximation operators via join and meet on a complete orthomodular lattice (COL). Some properties in our previous work are based on the distributivity of meet over join. However, any orthomodular lattice satisfying distributivity of meet over join reduces to a Boolean algebra. Moreover, some straightforward equivalences between distributivity and properties are proved. This means that these properties of rough sets theory hold if, and only if, the orthomodular lattice is a Boolean algebra. So these properties of rough sets theory hold in the frame of classical logic and may not hold in the frame of quantum logic. It is necessary to consider other rough sets model based on quantum logic, making more properties of rough sets hold in the frame of quantum logic. Quantum implication operators are important in the study of quantum logic. For example, they can be used to define deduction rules in quantum reasoning. This paper, therefore, discusses the quantum rough approximation operators based on quantum implications.
The paper is organized as follows: Section 2, we recall the concepts of orthomodular lattices. Since there are five quantum implications satisfying Birkhoff-von Neumann condition. Section 3, we redefine the rough approximation operators via the multiplication and Sasaki implication. In Section 4, we introduce the rough approximation operators via other four quantum implications. The conclusion is given in the final section.

Quantum Implicator
First, we recall the concept of COL and its implicators [28][29][30][31][32][33][34]. A COL L =< L, ≤, ∧, ∨, ⊥, 0, 1 > is a complete bounded lattice with a unary operator ⊥ which has the following properties: for all u, v ∈ L where 0 and 1 are the least and greatest elements of L, ≤ is the partial ordering in L, u ∧ v and u ∨ v stand for the greatest lower bound and the least upper bound of u and v.
Quantum logic is a COL-valued logic and classical logic is treated as a Boolean algebra. The former is weaker than the latter. For example, the distributivity of meet over join holds in Boolean algebra, i.e., for all u, v, w ∈ L, However, it is not valid in a COL. Implication operators in quantum logic can be defined in terms of ⊥, ∨, and ∧. They are required to satisfy the Birkhoff-von Neumann condition [24]: for any u, v ∈ L, u → v = 1 if, and only if, u ≤ v. There are only five implication operators satisfying this condition [35,36]: Sasaki implication: Dishkant implication: Kalmbach implication: Non-tollens implication: Relevance implication: Moreover, the multiplication operator is defined as follows: for all u, v ∈ L,
The following are some properties of the Sasaki implication and the multiplication: Let l =< L, ≤, ∧, ∨, ⊥, 0, 1 > be a COL, then L is a Boolean algebra, if, and only if, any one of the following condition holds:

Dual Operator of Quantum Implicator
Based on ⊥, a dual operator → i of quantum implicator → i is defined as follow: for all Proof. It can be deduced from the following, for any Proof. It can be deduced from the following, The bi-implication operator corresponding to the Sasaki implication is defined as follows: for any u, v ∈ L, Clearly, u = v if, and only if, u ↔ v = 1. Let X be a finite set, L a COL, E a binary relation on X relative to L. Then,

Rough Approximations via Sasaki Implication → 1 and Multiplication &
In this section, the new rough approximations are defined by using the multiplication connective & and Sasaki implication → 1 . For convenience, we use → in place of → 1 in this section. Definition 1. Let U be a finite set, L a COL, E a binary relation on U relative to L, and X a l-valued set in U. A pair of lower and upper rough approximations of X, E & X and E & X, are defined, respectively, as follows: and In our previous work [26], rough approximations are defined based on ∧ and ∨, i.e., Remark 4. In [26,27], we gave some results of (E ∧ X) and (E ∧ X) rely on the distributivity of meet over join. For example, This is indeed a negative result since any orthomodular lattice satisfying distributivity of meet over join reduces to a Boolean algebra.

Remark 5.
A complete orthomodular lattice L is a Boolean algebra if, and only if, & is commutative, so X(y)&E(x, y) and E(x, y)&X(y) are different.

Example 1.
Consider the smallest orthomodular lattice which is not a Boolean algebra, called MO2 [39], as given in Figure 1. Let the universe U = {x, y}. Define a L-valued set and a L-valued relation R on MO2 in Table 1. Then, by the work in [26], we have
Proof. (1) ⇒ (2): By using the distributive law of & over ∨, we have (2) ⇒ (1): Take a = 1; then it follows from the proof of necessity and E &1 (u) ↔ 1(u) for every u ∈ X that v∈U E(u, v) = 1 holds for every u ∈ X. Hence E is serial.

Example 3.
Consider the following L-valued relation E on MO2, as given in Table 2. Define a L-valued set the universe U = {x, y}

R
x y By Equations (5) and (6), we have Thus, we obtain E is serial, but L does not satisfy the distributivity of & over ∨, so E &â =â and E &â =â.

Proposition 8.
If two of the following statements are hold, then the third statement holds: (1) For any u, v, w ∈ L, (v&u) Proof. Similar to that of Proposition 7.

Remark 6.
For the proof of Propositions 7 and 8, in this paper, we use the concept that E is &−transitive if E(u, w) ≥ ∨ v∈U E(v, w)&E(u, v) holds for all u, v, w ∈ U, not E(u, w) ≥ ∨ v∈U E(u, v)&E(v, w) holds for all u, v, w ∈ U.

Definition 2 ([34]
). Let U be a non-empty set and L a COL, a function int: L U → L U is an l−valued interior operator if for all G, H ∈ L U it satisfies:

Rough Approximations via Implicator → i and Its Dual Operator → i
For other quantum implication → i (i = 2, ..., 5), we use its dual operator → i to define the upper rough approximation. Definition 4. Let U be a finite set, L a COL, E a binary relation on U relative to L, and X a l-valued set in U. A pair of lower and upper rough approximations of X, E i X and E i X, are defined, respectively, as follows: and Example 4. Consider the orthomodular lattice MO2 [39], as given in Figure 1. Let the universe U = {x, y}. Define a L-valued set and a L-valued relation R on MO2 in Table 1. Then, by Equations (24) and (25), we have Thus, we obtain Clearly, see Example 1, From above example, we know that different quantum implications will lead to different rough approximations. Proposition 11. For any binary relation E, l-valued set X on U and i = 2, 3, 4, 5, Proof. It can be obtained from the definition of the dual operator, i.e., Equation (8) It is easy to verify that E 2 X = (E 2 X ⊥ ) ⊥ and E 2 X = (E 2 X ⊥ ) ⊥ .

Conclusions
In this paper, we redefined COL-valued rough approximations based on quantum implication. First, COL-valued rough approximations are defined by using the multiplication (&) and Sasaki implication → 1 instead of meet ∧ and join ∨, respectively. This leads to new results that only rely on the distributive law of ∨ over &, which is strictly weaker than the distributive law of ∨ over ∧. This is very important for COL-valued rough approximations since similar results in our previous work [26,27] rely on the distributive law of ∨ over ∧. So the new quantum rough model needs weaker condition, and is applicable to a bigger extension. We further establish rough approximations via other four quantum implication, which are different from rough approximations via Sasaki implication. Some properties of rough approximations via these four quantum implications do not rely on the distributive law of ∨ over &.
Obviously, underlying rules play an important part in the concept of rough approximations. Some fundamental properties of rough approximations can not hold without some underlying rules of logics. By setting the equivalence between underlying rules of logics and properties of rough approximations, rough models with different ranges can be established. Obviously, the results presented in this paper only considered the distributivity. As future work, we can consider the equivalence between properties of rough approximations and other underlying rules, such as modularity and compatibility in a COL and cancellation law in an effect algebra, which is an algebraic model of unsharp quantum logic [39]. Naturally, a more detailed discussion of other algebraic models and other quantum logics, such as quasi-MV algebras [40,41], quantum MV algebras [42] and quantum computational logics [43], will be both necessary and interesting.
The purpose of this paper and author's previous works [26,27] is to establish a theory of rough sets based on quantum logic. However, as mentioned in [44], quantum logic seems to have no obvious links to quantum computation. The issue how to combine rough set method with quantum computation should be further investigated.