Submitted Manuscript: Confidential

Title: Probability Amplitude and Measurable State of AzadBinRajib (ABR)

Quantum gate A New type of Quantum Gate with Modified Karnaugh Map
and Logical AzadBinRajib (ABR) Quantum gate Unit Integrated Technology
(LAQUIT) Microprocessor Micro-architecture
5 Authors: A.B. Rajib Hazarika1

Affiliations:
1
Department of Mathematics, Diphu Government College,Diphu,Assam,India-782462 .
*Correspondence to: drabrh_dgc5163@rediffmail.com .drabrh02@gmail.com
Abstract: A new type of quantum gate namely AzadBinRajib (ABR) is studied for probability
10 amplitude and measurable state. It justifies the probability amplitude of 50% for 0th quantum
state and 50% for 1th quantum state and is measurable for up and down state as in the classical
as well as for Hadamard gate. It is unitary in nature is studied. Modified Karnaugh Map is
studied for ABR quantum gate with Literals. A microprocessor is designed with
microarchitecture Drabrh Logical AzadBinRajib (ABR) Quantum Gate Unit Integrated
15 Technology (LAQUIT) microprocessor microarchitecture.
Key words : Quantum gate, quantum microprocessor, probability amplitude, measurable state
One Sentence Summary: The probability amplitude of AzadBinRajib (ABR) quantum gate A
new type of quantum gate justifies for the 0th or up state and 1 th or down state with ½=50%
probability for each state and no decoherence is observed. Literals and Modified Karnaugh Map
20 studied
Past Studies: In past several authors have studied on different quantum gates Hadamard , CNOT gate ,X,Y,Z
Pauli’s gate, pi/8 gate (1,2, and 3). Modified Karnaugh map is studied by Wang et al (2) .As lot have been done on
different quantum gats a new type of quantum is studied which approves all properties required for being quantum
gate.
25
As it known for the Quantum gates lot of decoherence occurs while checking for the probability amplitude of the
quantum gates. Now, the question arises “what is decoherence, which people talk a lot for the calculation of
quantum gates?” The answer to this question lies in the fact when we calculate the probability amplitude in digital
form we get 50% and 50% for “0” and “1” respectively, without having any in-between values and probability
30 which we call as coherence. So, when we go for the quantum gate or combination of various quantum gates the
perfect value for the 0 and 1 state is not achieved, rather we get some values which lies between 0 and 1, which here
we call it as decoherence and probability amplitude thereon.
Now, regarding the present context quantum gates i.e. the AzadBinRajib (ABR) and Not AzadBinRajib (NABR)
quantum gates we will try to observe whether we achieve the milestone of getting coherence and avoiding any sort
35 of decoherence if at all occurs in calculations of such quantum gates. For that at first we try to see that “0 “state and
“1” state in terms of ket

For ABR Quantum Gate

0 1
|1> = [ ] “1” state |0> = [ ] “0” state
1 0
𝛼 1 0 1 𝛼 1 𝛽
40 ABR [𝛽 ] = [ ][ ] = [ ]
√2 1 1 𝛽 √2 𝛼 + 𝛽

|0> |1> |1> |0>+|1>

=𝛽 + (𝛼 + 𝛽) = 𝛼 + 𝛽( )
√2 √2 √2 √2

Probability amplitude are described as

1
 Submitted Manuscript: Confidential

𝑃𝛼 = 𝛼𝛼 ∗ ,
𝑃𝛽 = 𝛽𝛽 ∗
𝛼𝛼 ∗ + 𝛽𝛽 ∗ = 1 Linear superposition
𝑃𝛼 + 𝑃𝛽 = 1
̂ |0 >= 0 1 1 1
1
5 𝐴𝐵𝑅 ] [ ][
1 1 √2 0
√2
1 0 1 |1>
= [ ] = { } The 0th state
2 1 √2 √2
1
Here we find that the Eigen vector is 𝛼 =
√2

̂ |1 >= 0 1 0 1
𝐴𝐵𝑅 ][ ] [
1 1 1 √2
1 1 1 |0>+|1>
10 = [ ] = { } The 1st state
2 1 √2 √2
1
Also we find that the Eigen vector 𝛽 =
√2

𝛼 = 𝛼 ∗ & 𝛽 = 𝛽 ∗ as we are considering the real values the imaginary terms does not matter.
𝛼 2 + 𝛽2 = 1
1 2 1 2 1 1
15 ( ) +( ) = + =1
√2 √2 2 2

Hence we get 50% probability for 0th state and 50% probability for 1st state which is the required measurable stat for
the 0th state and the 1st state.

20 For complex numbers

Let us consider
𝛼 = 𝑥 ± 𝑖𝑦 , 𝛽 = 𝑢 ± 𝑖𝑣
Then the linear superposition is given as
|1 > |0 > +|1 >
𝑧 = (𝑥 ± 𝑖𝑦) + (𝑢 ± 𝑖𝑣) ( )
√2 √2
25 The inner product of the terms is given
< 𝛼|𝛼 ∗ > = (𝑥 + 𝑖𝑦)(𝑥 − 𝑖𝑦) = 𝑥 2 + 𝑦 2 = 1/2

< 𝛽|𝛽 ∗ > = (𝑢 + 𝑖𝑣)(𝑢 − 𝑖𝑣) = 𝑢2 + 𝑣 2 =1/2

1 1 1
30 < 𝛼|𝛼 ∗ > = (0
1) [ ] = 2 = 50%
√2 1
1 0 1
< 𝛽|𝛽 ∗ > = (1 1) [ ] = = 50%
√2 1 2
Therefore the ABR quantum gate is exact superposition having measure of |0> =50% and |1>=50%

For the nth state of the ABR Quantum gate we derive it as

1 𝑛−1
35 ̂ 𝑛 = 𝑛/2
𝐴𝐵𝑅 ∑2∅=1 |∅ >
2

𝜋
As for Quantum dots it rotates through an angle of 𝜃 =
4

̂ 𝜋 𝜋
cos(2. ) sin( )
4 4
𝐴𝐵𝑅 = [ 𝜋 𝜋 ]
sin( ) cos( )
4 4
40
1
0 1 0 1
√2
=[ 1 1] =
√2
[
1 1
]
√2 √2

For nth qubits it changes to

2
 Submitted Manuscript: Confidential

𝑛𝜋 𝑛𝜋
cos(2. ) sin( )
𝐴𝐵𝑅 𝑛 = [ 4 4
𝑛𝜋 𝑛𝜋 ]
sin( ) cos( )
4 4
Unitary Matrix
U|00> = |00>
And U |10>= |11>
5

𝐼 0 1 0 1 1 0 0 0
U=[ ] where 𝛼 = √2 [ ] and 𝐼 = [ ] , 0=[ ]
0 𝛼 1 1 0 1 0 0

Modified Karnaugh Map

10 Karnaugh map (K-Map) is very popular technique used for the simplification of Boolean algebra, here it is used as
Modified Karnaugh Map (K-Map) for Quantum Gate algebra expressions. It reduces the Boolean algebra expressions
more quickly and easily as compared to algebraic reduction. It is designed in the form of a diagram having rows and
columns into squares and the number of square corresponds to a row number in the truth table.
Each cell in modified K-map represents one particular combination of variables product form. For a total number of
15 n-variables modified K-map consists of 2n cells. Say for 2512 cells for n=512 variables (qubits).

TWO VARIABLE MODIFIED K-MAP

For two (qubits) variables A and B Modified K-Map have 22=4 cells. These are |A’B’>, | A’B >, |AB’> , |AB> viz.,
20 |00>, |01>, |10>, |11> . The two variables modified K-map must have 4 cells shown below.

Truth Table for two variables (qubits)

A B Output (F) Quantum Logic
25

|0> |0> A’B’ or m0 |00>

30

A”B or m1 |01>
|0> |1>
35
|1> |0> AB’ or m2 |10>
|1> |1> AB or m3 |11>
Fig.1 Truth table for two variables (qubits)
40

While designing the Quantum logical circuit one has to take care of two things
a. Inputs to the circuits
45 b. Desired output for each of the input
To know about the both steps described above we will have to undergo certain steps which is known as Minterms
and Maxterms
1. Minterms
Minterms are the products because they are logical AND gate for a set of variables. These are the product
50 terms for which the value of function is 1.

3
 Submitted Manuscript: Confidential

A + B = A.1 +B.1
=A (B + B’) + B (A + A’)
= AB + AB’ + BA + BA’
=AB + AB’ + A’B
5
The terms AB, AB’, A’B are the minterms because all the terms contains both A and B either in direct or in
compliment form.

Table for Minterms for three variables “1” means the variables are
10 “not complimented”
“0” means the variables are
A B C Minterms Shorthand Notations complimented.
|0> |0> |0> A'B'C' m0 |000>
|0> |0> |1> A'B'C m1 |001>
15
|0> |1> |0> A'BC' m2 |010>
|0> |1> |1> A'BC' m3 |011>

|1> |0> |0> AB'C' m4 |100>

20
|1> |0> |1> AB'C m5 |101>
|1> |1> |0> ABC' m6 |110>
!1> |1> |1> ABC' m7 |111>
25

30 Fig. 2 .Table of Minterms for three variables (qubits)

2. Maxterms
Maxterms are the sums because they are the logical OR of a set of variables. There are the sum forms for
which the value of the function is “0”.
35
A. B = (A+0) (0 + B)
= (A +BB’) (AA’ + B)
= (A + B) (A + B’) (A+ B) (A’ + B)
= (A + B) (A + B’) (A’ + B)
40 The terms (A+B), (A+B’), (A’+B) are known as the Maxterms because all the terms contain both the
variable A and B either in direct or in compliment form.

4
 Submitted Manuscript: Confidential

Column1 Column2 Column3 Column4 Column5 Column6

Table for Maxterms for three variables

A B C Minterms Shorthand Notations

|0> |0> |0> A+B+C M0 |000>
|0> |0> |1> A+B+C' M1 |001>
|0> |1> |0> A+B'+C M2 |010>
|0> |1> |1> A+B'C' M3 |011>
|1> |0> |0> A'+B+C M4 |100>
|1> |0> |1> A'+B+C' M5 |101>
|1> |1> |0> A'+B'+C M6 |110>
!1> |1> |1> A'+B'+C' M7 |111>
Fig.3 Table of Maxterms for three variables (qubits)

For Maxterms “0” means the variable is “not complicated”

5 “1” means the variable is “complimented”.

Detailed calculation of AzadBinRajib (ABR) Quantum logical algebra

1 0 1 1 0 1
𝐴= [ ] 𝐵= [ ]
√2 1 1 √2 1 1
1 0 1 1 0 1
A + B= [ ]+ [ ]
√2 1 1 √2 1 1
1 0 1 1 0 1
10 = [ ] OR gate [ ]
√2 1 1 √2 1 1
1 0 1
= [ ]
√2 1 1

1 0 1 1 0 1
A. B = [ ]. [ ]
√2 1 1 √2 1 1

1 0 1 1 0 1 1 0 1
15 = [ ] AND gate [ ] = [ ]
√2 1 1 √2 1 1 √2 1 1
0 1 1 1 0 1
𝐴′ = [ ] 𝐵′ = [ ] As it has got real terms only if complex terms are considered case will be
1
√2 1 √2 1 1
different.
1 0 1 1 0 1
A + A’ = [ ]+ [ ]
√2 1 1 √2 1 1
20

25

10 1 1 0 1
= [
] OR gate [ ]
1 1
√2 √2 1 1
10 1
= [ ] = A’ + B = A.B
√2 1 1
1 0 1 1 0 1
AB’ = [ ]. [ ]
√2 1 1 √2 1 1
1 0 1 1 0 1
30 = [ ] AND gate [ ]
√2 1 1 √2 1 1
1 0 1
= [ ] = A’B
√2 1 1

5
 Submitted Manuscript: Confidential

G=AB+AB’+A’B
1 0 1 1 0 1 1 0 1
= [ ]+ [ ] + [ ]
√2 1 1 √2 1 1 √2 1 1
1 0 1 1 0 1 1 0 1
= [ ] OR gate 𝐴 = [ ] OR gate [ ]
√2 1 1 √2 1 1 √2 1 1
1 0 1
5 = [ ]
√2 1 1

That means if we add three AzadBinRajib (ABR) Quantum gate together we get same value of one ABR Quantum
gate which performs Quantum algebra

10

Fig.4 .Drabrh Logical AzadBinRajib (ABR) Quantum Gate Unit Integrated Technology
15 (LAQUIT) Microprocessor microarchitecture
Discussion :( It has been observed in the present study that the AzadBinRajib (ABR) does not
show any type of decoherence in it, always showing appropriate results of equally distributed ½-
1/2 probability for each state of up or 0th state and down or 1th It is also observed that the ABR
quantum satisfies if we consider complex numbers which is calculated in the present study. It
20 follows all possible operation done in Boolean algebra is done for the quantum algebra which
works properly. It follows up with the unitary matrix form which is essential for any quantum
gate to be properly working quantum gate. ABR quantum gate satisfies modified Karnaugh map

6
 Submitted Manuscript: Confidential

operation with Minterms and the Maxterms shown vividly works properly. It has been shown
that the all literals and quantum algebra works. A new type quantum microprocessor
microarchitecture of Drabrh Logical AzadBinRajib (ABR) quantum gate Unit Integrated
Technology (LAQUIT) microprocessor. In the microprocessor Quantum dot cryptography is
5 used. Our study is in compliment with the studies done on Hadamard gate by authors (1, 2, and
3).

References and Notes:

10 1. “Quantum computation and Quantum Information:Nielson,M.A,Chuang,I (2000) Cambridge
University press. ISBN 0521632358.OCLC
2. Modified Karnaugh Mapnfor Quantum Boolean circuit
construction.:Wang,S.A,Lu,C.U,Tsai.I-Ming,Kuo.S-Yen: IEEE Xplore conference paper
Sept.(2003), doi:10.1109/NANO.2003.1230996
15 3. Wilde,M.M : Quantum Information Theory (2003)Cambridge University Press, ISBN
9781139525343 , doi.org/10.1017/CB09781139525343
Author contributions: Full done by the author
Competing interests: competing interests (including but not limited to patents, financial
holdings, professional affiliations, advisory positions, and board memberships) of any of the
20 authors must be listed (all authors must also fill out a separate, internal Conflict of Interest form).
Where authors have no competing interests, this should also be declared (e.g., “Authors declare
no competing interests.”); and
Data and materials availability: Include a note explaining any restrictions on materials, such as
materials transfer agreements. Note accession numbers to any data relating to the paper and
25 deposited in a public database; include a brief description of the data set or model with the
number. If all data are in the paper and supplementary materials include the sentence “All data is
available in the main text or the supplementary materials.” All data, code, and materials used in
the analysis must be available in some form to any researcher for purposes of reproducing or
extending the analysis.

30 Supplementary Materials:
Materials and Methods
Figures S1-S#
References (##-##)

7
 Submitted Manuscript: Confidential

Fig. 1. Truth Table of two variables (qubits) for ABR gate

Fig. 2. Table of Minterms for three variables (qubits)

Fig.3. Table of Maxterms for three variables (qubits)

Fig.4 .Drabrh Logical AzadBinRajib (ABR) Quantum Gate Unit Integrated Technology
5 (LAQUIT) Microprocessor microarchitecture

Fig.4. Drabrh Logical AzadBinRajib (ABR) Quantum gate Unit Integrated Technology
(LAQUIT) Microprocessor microarchitecture

10