Self-Organizing Quantum Neural Network

RiGui Zhou,HongYuan Zheng, Nan Jiang,QiuLin Ding

Abstract--This paper combines quantum computa-
tion with conventional artificial neural network
theory to present a novel networkSelf
-Organizing Quantum Neural Network (SOQNN)
that can perform pattern classification self-organi-
zationally and automatically through quantum
competitive process. It does not need to prestore
some givern patterns but can classify input patterns
with higher classification rapidity than that of
classical neural networks(CNN).Further, SOQNN
make the analogical pattern win easily in the next
quantum competitive process by modifying the
value of the quantum register(QR) corresponding
to the pattern classified.
I. INTRODUCTION
n1995,Kak firstly presented the concept of
quantum neural computation[7] that is one of a
young and outlying science. Recently,
researchers from around the world have also

This work is supported by grand groundwork advanced
research project of national defence (S0500A001)the Science
and Technology Foundation of the Education Department of
JiangXi Province(No. DB200508116) and The education
science fifteen planning topic of JiangXi
Province(No.04YB145).
Ri.Gui Zhou is with the Department of Computer Science
and Technology,Nanjing University of Aeronautics and
Astronautics,Nanjing,Jiangsu,210016,P.R.China.And Nanch-
ang Institute of Aeronautical Technology Nanchang,
Jiangxi,330034,P.R.China. e-mail:riguizhou@nuaa.edu.cn
HongYuan Zheng, Nan Jiang and QiuLin Ding are with the
Department of Computer Science and Technology,Nanjing
University of Aeronautics and Astronautics, Nanjing,Jiangsu,
210016,P.R.China
begun considering the implications of quantum
computation for fields such as neural networks
(both biological and artificial),so the studies in
quantum computation have been enriched by new
works addressing the idea of developing quantum
neural networks.Quantum Artificial Neural
Network (QANN) produced from this is a new
paradigm based on the combination of classical
neural computation and quantum comp- uting
and it has the high value for theoretic study and
the potential application. These QANNs have
many promising characteristics, both in the case
of supervised and unsupervised learning. In 1998,
A first systematic and deep examination of
QANN was done by T Menneer in his Ph.D.
thesis[8].At the same time, many QANN model
were presented.For example,in 1995,Quantum
Inspired Neural Nets[10] and Entangled Neural
Nerworks [11]was proposed by Narayanan et al;
In particular, an associative memory[5] based
on the use of Grover's quantum search algorithm
has been presented by Ventura and Martinez.
This network solves the completion problem; that
is, it can restore the full pattern when initially
presented with just a part of that pattern. One of
the most attractive properties of this memory is
its exponential capacity,which may have distinct
adventages over its classical cousin.
This paper presents SOQNN that can perform
pattern classification Self-organizationally and
automatically through quantum competitive
process. It does not need to prestore some givern
pattern required by quantum associative
memory[5] but can classify input pattern with
higher classification rapidity than that of CNN.It
receives different input pattern from input end,
then the different node on the output layer
I
0-7803-9490-9/06/$20.00/2006 IEEE
2006 International Joint Conference on Neural Networks
Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada
July 16-21, 2006
1067
responses to input modes freely,the node having
the maximum reaction was activated,this node
denotes this kind of pattern,so the network
validated the classification.this is analogical to
pallium matching the graph corresponding to
pattern observed.this process is called quantum
competitive process and the node activated is
referred to as winner.
The rest of the paper is as follows:in the
section ,the working process and algorithm
description of the SOQNN is discussed;Section
presents an example to understand the
SOQNN;In the section this paper concludes
with final remarks and defect of the SOQNN.
II. SOQNN
A. The Working Process Description of
SOQNN
SOQNN with n qubits input and m qubits
output is detailed in Fig.1,so it can classify m
patterns at the most.SOQNN firstly initial m
n-qubit T QRs(t
1
,t2 t
n
) and a n-qubit
C(c
1
,c2 c
n
) QR,then input quantum state
x on the F1 layer.On the F2 layer,the
winning quantum neuron j*(generally have
more one) is produced by quantum competitive
process through the comparison of the x
and the C QR.then QR
*
j i
T (i is the ith qubit in
the QR,i=1 n, j*=1m) that is
corresponding to winning quantum neuron
must be modified,which makes that clustering
center win easily in the next analogical pattern
matching,in this way, SOQNN may attain the
goal of self-organizing pattern classification.
B.Algorithm Description
The algorithm of SOQNN is described as
following:
initializing T and C QR,setting pattern
matching threshold a.
initializing input quantum statein other
words, given a set T of prototype patterns, we
require a wave function such that
z T
1
x f (z) f
m

= =


where m is the number of patterns in the set T.
{ }
n
z 0, 1 , f can be constructed using a
polynomial number (in n and m) of elementary
operations on one,two,or three qubits.This
initialization of quantum state is a process that is
beyond the scope of this paper.(detailed in[1])
quantum coding by the mothod of vector
coding.for example,a 3-qubit quantum state
( 101 ) can be coded
T
(00000100) .where T
indicates the vector transpose.
renewing the C QR through the
formula
i ji i
C T x = ,the C QR decides if
the new clustering center is produced after
comparing the similarity of the pattern.supposing
input pattern X=(x
1
,x
2
,,x
n
and pattern
P=(C
1
,C
2
,,C
n
) in the C QR,the Hamming
distance between X and P can be calculated,i.e.
m 1
j*


1 j j i j n
t t t

i n
c c c
1
"
1 j m
y y y
1 i n
x x x
F2
F1


Fig.1. hint figure of SOQNN
1068
n X P
HD(X, P)
2

=
i
Where XP is a inner
product of two patterns.If X and P is denoted in
binary pattern, the Hamming distance presents
the number of component having the different
value in the two patterns,which can measure
these two pattern discrepancy. The less the value
of the Hamming distance ,the closer these two
patterns,so the Hamming distance of homology
pattern equals to zero and the maximum of the
Hamming distance equals to n.
But it is very difficult that quantum neural
computation realize the function such that
i ji i
C T x = which denotes AND operator
among the corresponding bits of two registers
and stores the result in the one of the register,i.e.
realizing the function A,B A,AB .This
paper adopts the quantum networks to implement
this kind of mathematical operation which is
similar to reference[4](see Fig.2). Because
arbitrary muli-quantum bit gate can be
constructed with control-not gate and a single
qubit gate,we can realize arbitrary muli-quantum
bit gate operator using a limited times of
elementary operations on one,two,or three
qubits[12].For example,a 2-qubit realize AND
operator as following:
AB
1 1 0 0
0 0 0 0
U
0 0 1 0
0 0 0 1
(
(
(
=
(
(

For example:
AB
AB
1 1 0 0 0 1
0 0 0 0 1 0
U 01 00
0 0 1 0 0 0
0 0 0 1 0 0
1 1 0 0 0 0
0 0 0 0 0 0
U 11 11
0 0 1 0 0 0
0 0 0 1 1 1
( ( (
( ( (
( ( (
= = =
( ( (
( ( (

( ( (

( ( (

( ( (
= = =
( ( (

( ( (

Where
AB
U is a unitary transformation
matrix,From above we can see the result was
stored in the second qubit.
quantum competitive learning[2,3],

RC = ,accomplishing quantum
competitive learning need two operators,the first
of these operators,

C,is defined as:

1 if i=j, ( , )
1 if ( , ) ,
C c ( , ) ,
( , ) ( , )
0 otherwise
n
n
n
ij
n n
HD X i n a
HD X i n a
HD X i n a
HD X i HD X j

= =

(2)
where n is the number of binary inputs, i
n

represents the first n bits of I,HD returns the
Hamming distance between two binary
patterns,and is a threshold indicating how c-
lose potential patterns must be to X in order to
compete.The non-zero diagonal entries in the
matrix indicate which states can compete within
the restrictions of the threshold .the non-zero
off-diagonal elements represent extra inhibition
for patterns with lower Hamming distance from
X over those with higher Hamming distance from
X.
The second operator,

R ,is defined as:

A
B
AB
Fig. 2. AND operator
1069
n
p , ,
1 if i=j and p
R HD(x,i )=n
0 otherwise
ij
p x c
r
| |

|
= =

\ .

(3)
This operator will have non-zero entries only on
the diagonal and only corresponding to
prototypes. This operator ensures that some legal
prototype is the winner of the competition. Now
taking obtained from Equation(1) , the
classification phase of the algorithm can be
written:

RC collapse p =

with the collapse due to observation of the
quantum system.
renewing
* j
T QR corresponding to quantum
neuron j* that wins the quantum competition to
store this new pattern.The renewing method is:
*
j*i j*i i
T T x (i 1,2 n; j 1,2 m) = = =
(4)
This is the same to renew
i
C ,but
i
C and
j*i
T is very different in function.The
j*i
T modified ensure that the analogical pattern
come close together to a clustering center.Further,
it make the analogical pattern can easily win in
the next quantum competitive process ,which is
propitious to pattern classification.
When input a new pattern, the algorithm of
SOQNN jump to ,so SOQNN can classify
input pattern continuously and realize its
function.
III. CASE ANALYSIS
For example,we want to classify four
patternsABC and D in the Fig.3,because of
only four patterns,they are classified to four
groups at the most,so M4,here we select
m=4.The dimension of input pattern X equals to
4,i.e.n=4, ( )
4
0,1 X .1 denotes the black and
0 denotes white,therefore,four input patterns
vector are:
(1, 0, 0, 0)
(0,1, 0, 0)
(0, 0,1, 0)
(0, 0, 0,1)
a
b
c
d
X
X
X
X
=
=
=
=



This paper deploys a 4-qubit input QR and a
4-qubit output QR to match this example,C is a
4-qubit auxiliary QR and T is four 4-qubit
auxiliary QRs.
Step1: Supposing initial value of the auxiliary C
and T QR equals to 1 and the threshold a=2,i.e.if
there are two equivalent bits in the 4 dimensions
of pattern vectors,we can think these patterns can
be classified a classification.
Step2:Preparing initial state;there are 2
4
quantum
basis states in all,but this case has only 4 basis
states(m=4),so input equiprobable superposition
state after applying Eq.(1) is:

1
[(1,0,0,0) (0,1,0,0) (0,0,1,0) (0,0,0,1)]
2
= + + +
Step3: Quantum coding.For convenience,these 2
4
basis states may be rewritten in vector notation
as(the basis state with 0 coefficient have been
written out):
T
(1 1 1 1 ) =
Where the first 1 corresponding to the last term
of the equal weight superposition state,and so on.
and T indicates the vector transpose
Fig. 3. four patterns
1070
Step4: C T x x = = = ,because C
QR stored input pattern X,each dimension of X
and P=(C
1
,C
2
,C
3
,C
4
is the same that is greater
than the threshold a, which indicates X may
participate in quantum competition.
Step5: Quantum competitive learning,
Combination input pattern with C QR can
calculate the

R and

C ,which are 2
4
2
4

matrixs.therefore:

RC 1 1 1 1,0 0 = =
That is, 4 input patterns close to 4 different
clustering center,which indicates input patterns
was classified four classifications.
Step6: renewing T QR corresponding to winning
unit as:
T
1
=(1,0,0,0), T
2
=(0,1,0,0), T
3
=(0,0,1,0),
T
4
=(0,0,0,1)
Step7:Preparing for next input.
IV. CONCLUSION AND ANALYSIS
The working mechanism of SOQNN can be
gone further and explained by Fig.4.Supposing
input pattern being two dimension vector,its
vector end with o denoting can be regard as
being unit circle after normalization.With F2
layer having 4 quantum neuron,four T QRs are
also denoted with in unit circle.From the
distribution of input pattern,they congregate four
clusters(denoting with slim dashed arrowhead
line)on the whole,but there aret any trutorial
message about classification except for input
pattern training collection of the SOQNN.How
does the SOQNN find category of the input
sample from quantum competitive mechanism?
Before the training of quantum network,the value
of T QR is random .when X is inputed,it
compares similariry with four T QRs and
quantum neuron having the minimum of the
Hamming distance with X wins.From the adjust
formulate of the T we can see that T is closer to
X than that of the beginning,which is very clear
from the moving of vector in Fig.4,further,the
winner win more easily when patterns that is
analogical to X are inputed.
The classification speed of the SOQNN is
much greater than its classicial counterpart,
because it can classify all patterns inputed with
equal weight superposition state at one
time,moreover,the more the pattern,the faster
the speed,which is unrealizable with a classical
neural network. But there is a defect that it
takes much classification time because of
unitary transformation accomplished by
networks in renewing C and T QR of this
SOQNN.So the ongoing work is focused on
discovering new operators to improve
performance.Besides,Future work includes
searching for further applications of this
SOQNN.
REFERENCE
[1] Ventura DMartinez T R,Initializing the amplitude
distribution of a quantum state, Foundations of Physics
Letters,1999,12(6):547-559
[2] Dan Ventura,Implementing Competitive Learning in a
Quantum SystemProceedings of the International Joint
Conference on Neural Networks ({IJCNN}'99), paper
513,1999.
1071
[3] Xie Guangjun,Zhang Zhenquan,A Quantum Computitive
Learning Algorithm.Chinese Journal Of Quantum
Electronics,Vol.20,No.1,Feb.,2003(in Chinese).
[4] Vlatko Vedral, Adriano Barenco, and Artur Ekert,
Quantum networks for elementary arithmetic operations.
Physical Review, Vol.54,Number 1,July 1996
[5] Ventura D,Martinez T R,Quantum Associative Memory.
Information Sciences,2000,124:273-296.
[6] A.A.Ezhov a,A.V.Nifanova,Dan Ventura,Quantum
associative memory with distributed queries, Information
Sciences,128 (2000),271-293
[7] Kak S. C.,On Quantum Neural Computing.Information
Sciences,1995,83:143-160
[8] Menneer T.,Quantum Artificial Neural Networks. Ph. D.
thesis of The Univ. of Exeter, UK, 1998.
[9] Kouda, N., Matsui, N., Nishimura, H. and Peper, F., Qubit
Neural Network and Its Learning Efficiency, Neural
Computing and Applications, Springer-Verlag,
DOI:10.1007/s00521-004 -0446-8, 2005
[10] Menneer T,Narayanan A.,Quantum-inspired Neural
Networks.Tech. Rep. R329, Univ. of Exeter, 1995
[11] Li Wei-gang:Entangled Neural Networks.http://www.cic.
unb.br/~weifang/qc/enn2000.pdf
[12] M.Nielsen and I.Chuang:Quantum Computation and
Quantum Information,Cambridge University
Press,Cambridge,2000.
[13] Bob Ricks, Dan Ventura,Training a Quantum Neural
network, http://books.nips.cc/papers/files/nips16/NIPS
2003_ET05.pdf
[14] Li Fei,Zhao Shengmei,Zheng Baoyu,Performance of a
single quantum neuron.Chinese Journal of Electronics,
Vol.14,No.1,Jan.2005:111-114.
[15] D.Ventura:Learning Quantum Operators, Proceedings of
the International Conference on Computational
Intelligence and Neuroscience, 2000, pp.750-752.
1072