The n th Root of NOT Operators of Quantum Computers

This chapter proposes a novel approach to resolve the n th root of NOT problem for quantum computers using ( − 1, 0, 1) permutation matrices. Only logic NOT and exchange operations are required. This result provides a complete solution to design and implement the n th root of NOT operators of quantum computers.


Introduction
Feynman [1] first proposed 'universal quantum simulator' towards a true quantum computer. Since then, research and development activities of quantum computation and quantum computers have become the new frontal of next-generation computers for two decades [2,3]. Classical quantum mechanics use complex number vectors in Hilbert space to represent quantum states [4]. Any complex number is composed of two parts: a real part and an imaginary part. The imaginary number i √ −1 plays the essential role in the quantum mechanics construction. However, the mystery of the imaginary number causes severe difficulties for its manipulation, imagination and understanding [4][5][6]. Considering that modern computers are constructed by Boolean logic principles, how traditional logic structure is used to implement √ −1 has been puzzling and deeply entangled in quantum computing for at least two decades [7][8][9][10]. Nothing in the published literature has described a way to implement this untamed operator using traditional logic operations [2,11,12].

The Square Root of NOT Problem
Following traditional logic, negation corresponds to logic NOT (¬). Initiated by Feynman [1] and further developed by Deutsch [9,13], this problem has been represented as √ ¬ 'the Square Root of NOT' as one of the most difficult issues in quantum computation especially in general quantum gates. They suggested resolving ¬ 0 1 1 0 equation using logic operations for the solution. Maglicki and Wang [11] provided an example of how to resolve the problem this way.
Let ¬ operation reverse two quantum spin states |0 To apply unitary rotational matrices, √ ¬ operator can be expressed as In the equations, both e iπ and i symbols are involved. From a representative viewpoint, equations are useless because the symbols i and √ ¬ are both logic equivalent. The equations are in circular definitions.
To explore how to use traditional logic implementing √ ¬, it is necessary to analyse what has been established at the foundation levels of modern complex number construction.

Complex Number in History
The origin and development of complex number has a long and mysterious history [14][15][16]. In the nineteenth century, Gauss and Euler [15] made their foundation contributions to formally identifying imaginary parts as the most essential components to resolve solutions from nth algebraic equations. After their work, the imaginary number has been gradually accepted by mainstream mathematicians to be one of the most important parts of mathematics [15]. Hamilton established consistent operations on complex number in 1837 [17]. He constructed a complex number a + bi as an ordered number pair (a, b).
For example, let a + bi and c + di be two complex numbers. Four essential operations: {±, •, /} can be expressed as Using ordered pair representation, complex number operations are firmly established on real number operations. No further mysterious characteristics of imaginary numbers remain in the equations because all operations are well defined in real number construction.

Solution of the Square Root of NOT Problem
If we apply an imaginary number to an ordered pair, we have When we do not restrict √ ¬ solution in {0, 1} field but extend the field to {−1, 0, 1}. A permutation matrix can be constructed. Let Because Z 2 provides the same result as the imaginary number when applied to the pair, it is necessary for us to explore Z 2 features in details.
Two eigenvalues of Z 2 can be determined from its determinant.
This corresponds to either i 0 0 −i or −i 0 0 i as the solution. There are two unitary matrices U + , U − and two Hermite conjugate matrices U * + , U * − undertaken similarity transformation on Z 2 to produce the two diagonal matrices: Although three matrices belong to one matrix group under similarity transformation, five matrices can be distinguished without any direct equality.
To apply the five matrices twice separately, they all equal to −I 2 .
Therefore, the Z 2 matrix is an equivalent form of the imaginary number under the transformation.
For any ordered pair (a, b), Therefore, Z 2 is a homologous form of the √ ¬ operator. Under this construction, the square root of NOT problem in quantum computation is solved entirely. Only two elementary operations are involved in the transformation: logic NOT operation and pair-state exchange, respectively. They can be implemented readily using traditional logic constructions.

General Solution of the nth Root of NOT Operation
In this part, a general solution of n √ ¬ 'the nth root of NOT' for quantum computers is explored.
Let J n denote a conjugate permutation matrix which contains n columns and n rows and each row (column) has one non-zero element.
Let I n be a unit matrix, For example, matrices Let P n be a (0, 1)-permutation matrix in which each column (row) contains only one element, and P S(n) denote a permutation space containing all P n matrices.
Let J S(n) denote a conjugate permutation space.

Lemma For a given n, P S(n) contains a total number of n! distinguishable matrices, that is, |P S(n)| n!.
Theorem For a given n, J S(n) contains a total number of 2 n n! distinguishable matrices, |J S(n)| 2 n n!.
Proof Each non-zero element of J n has two values {−1, 1}, and n different elements have 2 n selections. The n elements can select a total number of n! different positions. Both symbol and position selections are independent, and each combination determines a J n matrix. So there are 2 n n! distinguishable matrices.

Corollary J S(n) is a matrix space that is 2 n times larger than P S(n).
Theorem A matrix group of simple rotation in J S(n) may contain 2n distinguishable matrices.
Proof Using a rotation matrix Z n ∈ J S(n), To apply 2n Z n matrices sequentially to the vector X, the following 2n vectors are produced: ⎛ . .
Theorem For any state vector X, X n √ ¬ n ¬X.

Conclusion
Using (−1,0,1) permutation matrices as basic tools, the nth root of NOT operators for quantum computers can be constructed and implemented by the traditional logic structure. Considering that this problem has puzzled advanced research of quantum computer for 20 years, this solution can provide quantum computer designers to practically implement quantum computers using traditional logic. The details of this construction will investigate in other places and the relationships among conjugate logic, quantum logic, quantum gates and complex number structures will be explored for foundation of Quantum computers and quantum computation of future computers.
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.