Neutrosophic Logic Based Quantum Computing

We introduce refined concepts for neutrosophic quantum computing such as neutrosophic quantum states and transformation gates, neutrosophic Hadamard matrix, coherent and decoherent superposition states, entanglement and measurement notions based on neutrosophic quantum states. We also give some observations using these principles. We present a number of quantum computational matrix transformations based on neutrosophic logic and clarify quantum mechanical notions relying on neutrosophic states. The paper is intended to extend the work of Smarandache by introducing a mathematical framework for neutrosophic quantum computing and presenting some results.


Neutrosophy Theory
Neutrosophic set concept, introduced by Smarandache [1,2], is a more universal structure that extends the concepts of the classic set, fuzzy set [3] and intuitionistic fuzzy set [4].Unlike intuitionistic fuzzy sets, the indeterminacy is explicitly defined in neutrosophic sets.A neutrosophic set has three basic components defined separately: Truth T, indeterminacy I and falsity F, regarding membership.Neutrosophy was proposed as an ambitious project by Smarandache as a new branch of philosophy as well, concerning "the origin, nature, and scope of neutralities, as well as their mutual effects with different intellectual spectra".The key assumption of neutrosophy is that every idea has not only a certain degree of truth, as is generally taken in many-valued logic contexts, but also degrees of falsity and indeterminacy need to be considered independently from each other.Neutrosophy has settled the baseline for a number of new mathematical theories generalizing both their classical and fuzzy counterparts, such as neutrosophic set theory, geometry, statistics, topology, analysis, probability, and logic.The neutrosophic framework has already been applied to practical applications in many different fields, such as decision-making, semantic web, and data analysis in medicine.Now, let us look at the concepts of some subfields of neutrosophy.Neutrosophic set has a formal definition as follows: Let U be a universe of discourse or space, and M be a set in U.An element x from U is stated related to the set M as x(T, I, F) and belongs to M in the following way: it is t % true in the set, i % indeterminate in the set, and f % false, where t varies in T, i varies in I, f varies in F. Statically T, I, F are subsets, but dynamically T, I, F are functions/operators depending on many known or unknown parameters.Neutrosophic logic is a general framework for the unification of many existing logics.The main idea of neutrosophic logic is to characterize each logical statement in a 3-dimensional neutrosophic space, where each dimension of the space represents respectively the truth (T), the falsehood (F), and the indeterminacy (I) of the statement under consideration, where T, I, F are standard or non-standard real subsets of [0 − , 1 + ].For instance, a statement can be between [0.21, 0.55] true, 0.23 or between (0.35, 0.45) indeterminate, and either 0.32 or 0.75 false.Neutrosophic statistics is the analysis of events characterized by the neutrosophic probability.The function that models the neutrosophic probability of a random variable x is called neutrosophic distribution: NP(x) = (T(x), I(x), F(x)), where T(x) represents the probability that value x occurs, F(x) represents the probability that value x does not occur, and I(x) represents the indeterminate/unknown probability of value x.Neutrosophic probability is an extension of the classical probability and imprecise probability where a case, event or fact A occurs is t % true-where t varies in the subset T, i % indeterminate-where i varies in the subset I, and f % false-where f varies in the subset F. In classical probability n s up ≤ 1, while in neutrosophic probability n s up ≤ 3 + .In imprecise probability, the probability of an event is a subset T in [0, 1], not a number p in [0, 1], the rest was supposed to be the opposite, subset F (also from the unit interval [0, 1]); there is no indeterminate subset I in imprecise probability.

Quantum Mechanics and Computing
Quantum mechanics was started with Planck [5] and interpreted as real life problem by Einstein [6].The mechanics was developed by Bohr, Heisenberg, Broglie, Schrödinger, Born, Dirac, Hilbert, Sommerfeld, Dyson, Wien, Pauli, Von Neumann and others [7][8][9][10][11][12] in the first 30 years of the 20th century.Computers are mechanisms that support transaction information by executing algorithms.An algorithm is a well-defined process to perform an information processing task.The task can always be translated into a realization.When creating complicated algorithms for a variety of tasks, working with some improved computational models is very useful, probably very important.However, when examining the actual limitations of a computation mechanism, it is key to remember the connection between computation and realization.Quantum computation explores how efficiently nature allows us to compute.The standard computational model is based on classical mechanics; the mechanics of the Turing machine relies on classical mechanics.Quantum information processing changes not only the physical paradigm used for computing and communication but also the concepts of knowledge and computation.Quantum computation is not synonymous with quantum effects to make calculations.Actual computing mechanisms of the quantum are based on a larger physical reality than is represented by the idealized computational model.Quantum information processing is the result of the use of the physical reality that quantum theory states to perform tasks that were previously thought to be infeasible or impossible.The mechanisms that perform quantum information processing are known as quantum computers.In the last few decades of the twentieth century, researchers tried to follow two of the most influential and revolutionary theories: information science and quantum mechanics.Their success provided an unfamiliar computation and information range of vision.This new insight has significantly changed how the relationship between quantum information theory, computation, knowledge, and physics is considered and has given rise to new applications and epoch-making algorithms.The theory of information, which contains the foundations of computer science and communication, made possible to address the important issues in computer science and communication.The Turing machine is a classical model that behaves entirely according to classical mechanical principles.Quantum mechanics has become an increasingly significant line in the progress of developing more efficient computing mechanisms.Until recently, the effect of quantum mechanics had been limited to low-level applications and it had no effect on how computation or communication was carried or worked.At the beginning of the 1980s, a number of scientists found that quantum mechanics had eye-opening effects that could be used in information processing.Richard Feynman [13], Yuri Manin [14], and other influential scientists realized that some quantum mechanical phenomena could not be efficiently simulated by a standard Turing machine.This observation has led to speculation that perhaps these quantum phenomena could be used to make computations more efficient in general.
Such programme required re-thinking the underlying theoretical model of informatics and completely removed it from the classical circle.Quantum computing, a field that includes quantum information, quantum algorithms, quantum cryptography, quantum communication, and quantum games, explores the effects of using quantum mechanical phenomena for information modeling and processing instead of using the rules of classical mechanics in computations.
In the following sections, we will introduce a mathematical framework of the unification of neutrosophic theory and quantum theory, in a fully computational approach.In this context, we will reveal how one can have a computational approach to the solution of mathematical and algorithmic problems of a model that can be encountered in both the neutrosophic and quantum universes.In this sense, this paper presents a more computational approach to the neutrosophic quantum concept, i.e., neutrosophic quantum computation, whose groundwork was laid by the work of Smarandache [15].

Neutrosophic Quantum Computing
In this part, we define some fundamental notions of neutrosophic quantum computing.Some concepts will involve new interpretations and others will be straightforward generalizations.As also mentioned in Smarandache [15], we should note in the beginning of our paper that the reversibility condition of quantum computing has some challenging issues in the neutrosophic counterpart of this ambitious field.It is mainly due to the fact that neutrosophic states involve indeterminacy, so the inverse function of such states might not always be definable, hence the domain may not be uniquely recovered from the image.We propose an interesting open problem regarding a special case of this issue at the end of the paper.
We assume some basic familiarity with linear algebra and complex numbers including their basic properties like the norm of a complex vector, complex conjugation, complex number multiplication, etc.The reader may refer to Yanofsky and Mannucci's [16] or Nielsen and Chuang's [17] book for a detailed account on quantum computing and quantum information.
In comparison to classical quantum computation, the reader may have noticed a new basis vector |I introduced above.We call this vector the indeterminacy basis.
A coherent neutrosophic quantum state |ψ is a linear combination (superposition) of the basis vectors |0 , |1 and |I which is in the form Thus, a coherent neutrosophic quantum state is three-dimensional complex vector, which is of unit length.
Quantum systems evolve via special kind of matrix transformations.We define neutrosophic Pauli gates as given below: The matrix X is actually the NOT gate which the reader might be familiar from classical quantum computation.That is, if k ∈ {0, 1}, then X|k = |1 − k .Notice that X|I = |I .Thus, we define the negation of the indeterminacy basis as itself.The next two gates are Y-rotation and Z-rotation (phase change).The new gate here is the W-transformation which can be simply thought of as a rotation around the |I basis with an equal coefficient distribution of the bases between |I and the basis on which the rotation is applied.The intuition behind these rotation gates will be understood better once we give the unit ball representation of neutrobits later on.
An important quantum gate in classical quantum computing is the Hadamard transform, which is defined as the matrix Standard Hadamard transform is defined on a single qubit since it is a 2 × 2 matrix.Hadamard matrix used in classical quantum computing is a unitary matrix.Thus, it is reversible, and is actually its own inverse.To introduce the neutrosophic counterpart of this transformation, we first need to define the notion of indeterminate (decoherent) superpositions to make sense of the use of the Hadamard transform in neutrosophic quantum computing.The terms coherent and decoherent superpositions of neutrobits were first introduced by Smarandache [15] for denoting quantum states with some indeterminacy.We modify these notions to make the Hadamard transform work on neutrobits.Definition 2. The reserved three-dimensional vector I is called the decoherent state of the |0 basis vector.We define |1 I similarly.That is, I is defined to be the decoherent state of |1 .Any linear combination that includes either of these vectors is called a decoherent superposition.
The motivation behind this definition is to mix the coherent (stable) basis state |0 with the intrinsic property of neutrosophic logic, which is indeterminacy.A quantum system may still have a degree of indeterminancy even if the system appears to be in a pure basis state.A scalar α for any of these decoherent vectors is denoted by α I .Thus, when we write α I , for some number α, the reader should understand that we are refering to the coefficient of a decoherent state.For example, the vector denotes the decoherent superposition state We could also define a decoherent state for |I , but, since the state |I naturally involves an indeterminacy regarding which classical bit the state refers to, there is no need to repeat this decoherence.Thus, we adopt |0 I and |1 I as reserved basis vectors that will be used in decoherent superposition states.We should once again emphasize that |0 I is different than the coherent basis state |0 .It is also different than the coherent superposition state |ψ = 1 |I .The latter says that the system is in a superposition of basis states |0 and |I the former says that the system is in a possibly indetermined state |0 .If |ψ = |0 , this tells us that |ψ is for certain in the basis state |0 .The state |0 I + |I says that the system is in a decoherent superposition of |I and a possibly indetermined state |0 .The distinction between coherent and decoherent states should now be clear.However, another way to imagine |0 I as the state |0 with a bounded error > 0.
Given the information above, we define the neutrosophic Hadamard transform as Then, it is easy to verify that

Observables and Measurement
In classical mechanics, it is intuitively understood what is meant by an observable.An observable in classical mechanics is a quantity like velocity, momentum, position, temperature, etc.It is intuitively clear what these quantities are.In quantum mechanics, one needs to be more specific when talking about observables.Definition 3. Let A be an n × n matrix.We say that A is Hermitian if A † A = AA † , where A † is called the Hermitian conjugate of A and is defined as the transpose of the complex conjugate matrix of A. An n × n matrix A is called unitary if A † A = AA † = Id, where Id is the identity matrix.
We note that, in classical quantum computing, state evolution is obtained by applying unitary operators.There are two reasons for this.The first reason is that classical quantum computations are reversible.The second reason is that unitary transformations preserve inner products, hence they preserve the norm of the vectors.As we shall discuss later, this requirement is questionable in neutrosophic quantum computing.
In classical quantum computing, it is assumed that, for every observable, there corresponds a Hermitian operator.We use the same postulate for the neutrosophic case.

Measurement postulate. Observables in neutrosophic quantum computing are Hermitian operators.
Measurements are the outcomes of observables applied on the physical system in consideration.Classical quantum computing usually takes projective measurements in the sense that when we measure a state, the new state of the system becomes one of the basis states of the system.Thus, after the measurement, a general superposition state gets projected onto one of the basis vectors.We shall not adopt this requirement in neutrosophic quantum computing.The reason is the following.If the outcome were to be projected onto one of the basis states, the logic used here would be no different than the classical interpretation.Even if the state of the quantum system is projected onto a single basis state, we would still require a degree of probability of the same basis state being on other basis states.This is one reason why we should decoherent superposition states into account in neutrosophic quantum computing.It relies on the very nature of neutrosophic logic.For that matter, observables we take into consideration are non-projective.
Measuring an observable on a neutrosophic quantum bit yields not a single classical state, but a probability distribution of the basis states |0 , |1 , |I .This is perhaps one of the most important difference between classical quantum computation and neutrosophic quantum computation.It should be noted that the neutrosophic quantum state should not be confused with an ordinary superposition state of a classical quantum system.Thus, a pure state in a neutrosophic quantum system always looks like a superposition.A neutrosophic quantum state is in a coherent superposition of three basis states |0 , |1 , |I .However, as soon as we make a measurement on state |ψ , it yields a decoherent superposition, which is merely a triplet containing the information of probability distributions for each basis states.We state this as a theorem.
Proof.Suppose that we are given a coherent state |ψ = α|0 + β|1 + γ|I .Without loss of generality, we may assume that the state is in a superposition rather than in a single coherent basis.Assume that we are given a Hermitian operator Ω which is not necessarily unitary and projective.Applying Ω on |ψ , since we assumed that Ω is non-projective, will still yield a linear combination of vectors, particularly a three-dimensional vector.Since the probability of seeing a single coherent basis state is a magnitude square of the coefficient corresponding to that basis vector, the probability of observing |0 is some p |0 .Similarly, the probability of observing |1 is p |1 and the probability of seeing |I is some p |I .Since Ω is non-projective, we observe a vector containing these probabilites as elements.However, since the outcome is decoherent, it should be that each probability value can be taken to be indetermined.That is, the outcome of the observation will be a vector The vector above is a decoherent superposition state with numbers p |0 , p |1 , and p |I .Since each number is the magnitude square of the coefficients of the state vector being measured, they cannot be complex valued.Thus, each of these numbers are real valued.

Tensor Products and Entanglement
The usual tensor product of classical qubits generalizes to the neutrosophic case.Given two neutrobits the tensor product is defined as The tensor product of measurement outcomes can also be defined.Assume that |ψ = p Then, we write the tensor product as |ψ ⊗ |φ The tensor product of measurement outcomes provides us with the ability to use compound outcome information of multiple neutrobit systems.We shall now look at the neutrosophic entanglement property.In classical quantum computation, a two qubit system is entangled if it is not the tensor product of two single-qubit systems.We adopt the same definition for neutrosophic coherent superposition states.However, entanglement is not defined on decoherent states.Suppose that we are given two neutrobits |ψ the tensor product is defined exactly the same as in the classical case.That is, This is completely a coherent superposition.If we measure this two-neutrobit system, though, we get a 9-tuple containing probability distributions where each element of the 9-tuple denotes the probability of the compound system |ψ ⊗ |φ being in the ith basis state for a two-neutrobit system.The reader should easily be able to verify that, for an n-neutrobit system, there are 3 n basis states.

More on Quantum Operators
As noted earlier, most quantum transformations are defined similarly as in the classical case.For a better understanding though, we shall discuss more about the action of the neutrosophic Hadamard transform.The neutrosophic Hadamard transform is defined as We leave the action of H N on two reserved decoherent vectors |0 I and |1 I undefined for the reason that creating a superposition from an already decoherent neutrosophic quantum state might prevent us to obtain the original input decoherence from the output decoherence.Thus, due to this reversibility problem, it is better if we leave the mentioned transformations undefined.Since |I is a legitimate coherent state in neutrosophic quantum computation, we defined We may imagine a coherent neutrobit as a vector on a three-dimensional unit ball as given in Figure 1.Of course, we assume in this image, for simplicity, that the amplitudes are real values.Allowing complex coefficients would require us to represent a neturobit on a four-dimensional geometry since an additional imaginary axis would need to be introduced.The basis vectors here are all mutually orthogonal.That is, the inner product of any of the two basis vectors is 0.
When we make a measurement on the state |ψ , we get a triplet p |0 , p |1 , p |I which was defined earlier, where p |0 = |α| 2 , p |1 = |β| 2 , p |I = |γ| 2 .The new state of the system in this case is a decoherent superposition of |0 , |1 and |I each with a degree of probability p |0 , p |1 , p |I , respectively.

Results
We introduced a refined mathematical framework for neturosophic quantum computing based on the original work of Smarandache [15] and we gave a few standard transformations and notions that are to be used in neutrosophic quantum computations.Perhaps the most important difference from the classical quantum computation is the involvement of the indeterminacy basis and the separation between coherent and decoherent states.Treating the Hadamard transform as a function creating a superposition from a coherent state, we introduced the reserved decoherent vectors for this purpose.The measurement process is also slightly different in this case.The outcome of any measurement on a neutrobit gives a probability distribution, a decoherent state, of all possible basis states each with a certain degree of probability determined by the corresponding coefficients.
The computational complexity of the neutrosophic quantum gates, when applied to a quantum state, would be the same as their classical counterparts since the size of the transformation matrices in the neutrosophic counterpart does not change asymtotically.That is, for the neutrosophic Hadamard transform for instance, multiplying a 3 × 3 matrix with a three-dimensional vector does not give any difference in terms of computational complexity compared to its classical counterpart.The same observation can be easily seen with the other gates.The only complexity difference is with the tensor product that, since we are not working on a three-dimensional vector space, the size of the vector space grows by factors of 3 instead of 2 when taking tensor products of n many neutrobits.It should be noted that this is still a constant difference.
A practical application of neutrosophic quantum computing in the future would be used to solve hard problems involving indeterminate cases of multiple states when taken as a whole system.For example, it may not be known which one of the many possible channels that a quantum information is transferred through quantum communication channels.If we were to study the behavior of the transferred superposition quantum state, we would have to use neutrosophic quantum computing notions to describe the state of the transfer process that will involve the probability of the information being transferred on one particular channel, probability of the information not being transferred on the same channel, and a degree of indeterminacy of the information being transferred on that channel.This is required for a single channel.Thus, we would have a superposition of all possible probability distributions if we consider every channel taken together.The entire distribution will naturally define a decoherent quantum superposition state.
As stated in Smarandache [15], satisfying the reversibility condition of quantum computing is more problematic in the neutrosophic case due to the inclusion of indeterminate states.The first attempt to settle this problem is to try to make the neutrosophic Hadamard transform unitary, and hence reversible.We shall give the following open problem, for which we hope to encourage researchers in neutrosophic computation or quantum computing for finding a possible solution.
Open problem.Define a "reasonable" neutrosophic Hadamard transformation matrix, which is unitary.
By "reasonable", we mean preserving the original properties of the standard Hadamard transform such as creating a superposition of basis states, etc.
Another future work is to find a legitimate protocol for the teleportation of the state of a neutrobit from one location to another.This particularly has many applications in networks and communication.A typical quantum teleportation of a standard qubit is performed through classical bit channels.In order to send the state of a qubit, the first party sends two classical bits and the second part recovers the state of a qubit from the received classical bits.What kind of channels do we need to transport the state of a neutrobit?A classical channel may be a solution.A quantum channel, on the other hand, may not be sufficient to teleport a neutrobit due to the fact that the preservation of indeterminate states through the teleportation process becomes questionable.One idea is to separate the indeterminate state from the superposition and treat it as a classical quantum superposition state of all coherent basis states and then use the classical quantum teleportation protocol on this system.
Neutrosophic quantum computing is at its very early stage of development.We believe that this new field will attract many researchers in computer science, physics and mathematics for further advancement along with discovering many useful future applications.

. The indeterminate values 1 √ 2 in
the neutrosophic Hadamard transform denote the indeterminate decoherent counterpart of the basis states |0 and |1 .Any state which involves any of these decoherent vectors is also decoherent.Despite that we leave H N |0 I and H N |1 I undefined, we define the logical NOT operator over the decoherent states as NOT|0 I = |1 I , NOT|1 I = |0 I .

Figure 1 .
Figure 1.Representation of a neutrobit vector on a unit ball with real coefficients.
Given a neutrobit |ψ = α|0 + β|1 + γ|I , making a measurement on state |ψ yields a triplet p |0 , p |1 , p |I , where p |0 denoting the probability of |ψ being in state |0 , p |1 denoting the probability of |ψ being in state |1 , and p |I denoting the probability of |ψ being in the indetermined basis state |I .Thus, the outcome of observing a neutrobit gives a probability distribution of basis states.In classical quantum computing, the outcome of measurement on a qubit is a classical bit information.Let us illustrate this idea.For example, given the neutrobit in a coherent superposition, measuring some observable Ω on the state |ψ should yield a neutrosophic quantum state |ψ = α|0 + β|1 + γ|I , of decoherent superposition.