Volume 5 Number 0405 ISSN 1979-3898

Journal of
Theoretical and Computational
Studies

Adding-Memory Operator on Quantum Computer Memory

A.N. Atmaja, F.P. Zen, B.E. Gunara
J. Theor. Comput. Stud. 5 (2006) 0405
Received: October 2nd , 2006; Accepted for publication: December 12th , 2006

Published by
Indonesian Theoretical Physicist Group Indonesian Computational Society
http://situs.opi.lipi.go.id/gfti/ http://situs.opi.lipi.go.id/mki/
 Journal of Theoretical and Computational Studies
Journal devoted to theoretical study, computational science and its cross-disciplinary studies
URL : http://situs.jurnal.lipi.go.id/jtcs/

Editors
A. Purwanto (ITS) J.M. Tuwankotta (ITB)
A. S. Nugroho (BPPT) L.T. Handoko (LIPI)
A. Sopaheluwakan (LabMath) M. Nurhuda (UNIBRAW)
A. Sulaksono (UI) M. Sadly (BPPT)
B. E. Gunara (ITB) M. Satriawan (UGM)
B. Tambunan (BPPT) P. Nurwantoro (UGM)
F.P. Zen (ITB) P. W. Premadi (ITB)
H. Alatas (IPB) R.K. Lestari (ITB)
I.A. Dharmawan (UNPAD) T. Mart (UI)
I. Fachrudin (UI) Y. Susilowati (LIPI)
Z. Su’ud (ITB)
Honorary Editors
B.S. Brotosiswojo (ITB) M.O. Tjia (ITB)
M. Barmawi (ITB) P. Anggraita (BATAN)
M.S. Ardisasmita (BATAN) T.H. Liong (ITB)
Guest Editors
H. Zainuddin (UPM) K. Yamamoto (Hiroshima)
T. Morozumi (Hiroshima)

Coverage area
1. Theoretical study : employing mathematical models and abstractions of a particular field in an attempt to explain known or
predicted phenomenon. E.g. : theoretical physics, mathematical physics, biomatter modeling, etc.
2. Computational science : constructing mathematical models, numerical solution techniques and using computers to analyze
and solve natural science, social science and engineering problems. E.g. : numerical simulations, model fitting and data
analysis, optimization, etc.
3. Cross-disciplinary studies : inter-disciplinary studies between theoretical study and computational science, including the
development of computing tools and apparatus. E.g. : macro development of Matlab, paralel processing, grid infrastructure,
etc.
Types of paper
1. Regular : an article contains an original work.
2. Comment : an article responding to another one which has been published before.
3. Review : an article which is a compilation of recent knowledges in a particular topic. This type of article is only by invitation.
4. Proceedings : an article which has been presented in a scientific meeting.
Paper Submission
The submitted paper should be written in English using the LATEX template provided in the web. All communication thereafter
should be done only through the online submission page of each paper.
Referees
All submitted papers are subject to a refereeing process by an appropriate referee. The editor has an absolute right to make the
final decision on the paper.

Reprints
Electronic reprints including covers for each article and content pages of the volume are available from the journal site for free.

Indonesian Theoretical Physicist Group Indonesian Computational Society

Secretariat Office : c/o Group for Theoretical and Computational Physics, Research Center for Physics -
LIPI, Kompleks Puspiptek Serpong, Tangerang 15310, Indonesia
http://situs.opi.lipi.go.id/gfti/ http://situs.opi.lipi.go.id/mki/

c 2006 GFTI & MKI ISSN 1979-3898
J. Theor. Comput. Stud. Volume 5 (2006) 0405

Adding-Memory Operator on Quantum Computer Memory

A.N. Atmajaa , F.P. Zenb , B.E. Gunarab
a)
Group for Theoretical and Computational Physics, Research Center for Physics, Indonesian Institute of
Sciences, Kompleks Puspiptek Serpong, Tangerang 15310, Indonesia
b)
Theoretical High Energy Physics and Instrumentation (THEPI), Department of Physics, Institut Teknologi
Bandung, Jl. Ganesha 10, Bandung 40132, Indonesia

Abstract : There are two models of quantum memory design that are Associative, which mainly focus on memory
content, and Address-Oriented, which includes address for each data as an important component in its design. This
paper investigates how to build those models using Adding-Memory operator to store classical data in quantum memory
(one possibility value). We write general formalism of Adding-Memory operator in matrix representation, which is
developed from rotation operators in Hilbert space. We also show how Address-Oriented model has most possible
development to store quantum data (more than one possibility value) in quantum memory.
Keywords : quantum memory, Associative, Address-Oriented, Adding-Memory operator, classical data, quantum
dat
E-mail : ardian@teori.fisika.lipi.go.id

Received: October 2nd , 2006; Accepted for publication: December 12th , 2006

1 INTRODUCTION
Quantum computer [1] is associated as new complex-
ity class type [2] which unattainable by classical Tur-
ing machine (in polynomial time). Moreover, quan-
tum algorithm [3] drastically speed up solving the
problems compared to classical algorithm for exam-
ples are Deutsch algorithm [4], Shor factorization al-
gorithm [5] and Grover searching algorithm [6]. Beside
processing faster then its classical counterpart, quan-
tum computer also has the main advantage on the
capacity to stores more data, and all the data itself is
located in a memory of the computer.
Furthermore, similar to the classical computer, the
function of memory [7] in quantum computer (so-
called quantum memory) also stores the required data,
which will be processed to become worthy informa-
tion. Characteristic of this memory should be dy-
namic in the sense that it must be able to keep a
number of required data by adding or deleting amount
of data in the quantum memory.
There are two kinds of data processed by quantum
only stores one value (see table 1). Quantum data is
best fit to store information about state of particles
system used to simulate quantum system. For exam-
ple, an n-qubit classical data can only store one of
2n combinations of data while n-qubit quantum data
can store amount of data from one to 2n combinations
with probability amplitude that might difference for
each data.
1.1 Clasical Memory
Memory in classical computer (so-called classical
memory) represents collection of cells related to cir-
cuit required for transferring information from and to
classical memory [8]. Classical memory stores binary
information in a group of bits, which known as a word.
A word in classical memory is a unit of bits, represent
collection of bit 1 and 0, and interpreted as a number,
Table 1: n-qubit classical data and quantum data
classical data quantum data
computer, which are classical data and quantum data.  i ∑2n −1 i  i 
a 
i=0 p a
The difference between classical and quantum data is ∑2n −1  i 2
p  = 1
in ability of quantum data to store more information i=0

with variation on probability amplitude for each data

in quantum memory compared to classical data that where ai = {0, 1}n for i = 0 . . . 2n − 1.

c 2006 GFTI & MKI 0405-1
2 Adding-Memory Operator on Quantum Computer...
Figure 1: Data flow diagram in classical memory
instruction code, one or more alphanumeric character,
or other binary codes. A group of 8-bits refers as a
byte and most of classical memory uses a word with
amount of bits is multiplication of byte. For example,
16-bits of word contain 2 byte and 32-bits of word
contain 4 byte. The number of byte stored determines
capacity of memory in classical computer.
Internal structure of classical memory is specified
by amount of word contained and number of bit in a
word. Special input lines in classical memory compo-
nent refer as address − line and used to choose par-
ticular word in classical memory. Each word in clas-
sical memory is identified with a number and called
address start from 0 until 2k − 1 where k is the num-
ber of address − line. Particular word can be ex-
tracted from classical memory by giving k − bit input
to classical memory through address − line. Capacity
of classical memory depends on number of bit of the
address. For example, capacity of 1024 = 210 words
required 10-bits address while capacity of 223 words
require 23-bit address.
1.2 Quantum Memory
Quantum memory has similar function to classic mem-
ory, which stores information required for further pro-
cess and keeping result from computational process.
Different with classical memory, quantum memory do
not only stores classical data but also quantum data.
Using its nature of parallelism and massive content of
the state (linear combination of bases state), quantum
memory has many advantages especially in the case of
its capacity and ability of storing quantum data which
useful in simulation of a quantum system effectively.
0405-2
There are two-type model of quantum memory de-
veloped today, which are Associative and Address-
Oriented. Associative model has an advantage in sim-
ple process however it suffers from capacity short-
ages [9]. Utilizing of Associative model can be seen
in collectively computation on networks neural [10]
which one of the example is Hopfield model [11] and its
generalization in bidirectional Associative model [12].
Address-Oriented model has advantage in depository
capacities but building and using this model is compli-
cated enough. Difficulty in a process of turning back
information in Address-Oriented memory model re-
quires precise and correct information about address
of quantum memory [13]. It means this Address-
Oriented model cannot handle incomplete input (ad-
dress) to quantum memory, for example input dis-
turbed by noise from surrounding.
This paper will study about design of Adding-
Memory operator as component to build quantum
memory model. In section II, Adding-Memory oper-
ator is designed through geometrical approach of the
rotation in Hilbert space about quantum states in the
form of rotation operators. Generally, we also show
how to build Associative model of quantum memory
using Adding-Memory operator. Section III discuss
about implementation of Adding-Memory operator in
Address-Oriented model with classical data by adding
qubit address as identification for each data. Possi-
bility development of Address-Oriented model with
quantum data explained in section IV. Finally, con-
clusion about Address-Oriented design model using
Address-Memory operator stated in section V.
2 BASIC THEORY
Quantum computer have some advantage compared
to existing classical computer. Using the nature of
superposition from quantum states then an n-qubit
can contain data as much 2n data of n − bits. For
example, 3-bits in classical computer have only one
value from eight possibility data bellows:
000, 001, 010, 011, 100, 101, 110, 111 (1)
while for 3-qubit in quantum computer can have all
the possible data represented by a ket |ψi which is
superposition of all its base kets:
1
|ψi = √ (|000i + |001i + . . . + |111i) (2)
8
Amplitude probability of each value is assigned to
be equal in order to facilitate calculation of Adding-
Memory operator design (A(x, B)) in Address-
Oriented model but in general it doesn’t have to.
3 Adding-Memory Operator on Quantum Computer...

Operators work on ket represents devices for quan-
tum computer, so operators have function to manip-
ulate data from a qubit. During operation, operators
must not change the probability of a ket, thereby an
operator has to be uniter [14].
Unitary operator is an operator where its adjoin
equivalent to its inverse (U † = U −1 ). If we measure
the probability of a ket after we do a unitary operator
on it then as shown below probability of the ket is
same as before.
|ψi −→ |ψ 0 i = U |ψi (3)
hψ|ψi −→ hψ 0 |ψ 0 i = †
hψ| U U |ψi
= hψ|ψi (4)
One of the unitary operators is rotation operator as in
geometry operate to rotate a vector in Hilbert space.
In principle, an operator needs two kets to operate
in computer quantum, which are ket |xi as an input
ket and |yi as control ket.Actually, only ket |y 0 i that
will be manipulated by the operator as a result. In a
diagram below, operator U described by [15]:
|xi ⊗ |yi −→ |xi ⊗ |y 0 i = |xi ⊗ (U |yi) (7)
In Adding-Memory operator, ket |xi act as qubit
data that will be added to quantum memory and ket
|yi as initial condition of quantum memory before the
operation and ket |y 0 i as a final condition of quantum
memory after the operation of Adding-Memory oper-
ator. In the final condition, quantum memory will
contain superposition of ket |xi and ket |yi.
|y 0 i ≡ |xi + |yi (8)

2.1 Rotation in N -dimension Adding-Memory operator for the n-qubit can be

constructed from rotation operators in N -dimension
In general, rotation in N -dimension is expressed as while N = 2n . We use many rotation operators to
follows : initial ket of quantum memory many times until we
get final ket as superposition of all ket bases that we
1. Space of N -Dimension have N bases and is writ-
want to add to quantum memory. In this paper, we
ten as xi with i = 1, 2, 3, . . . , N .
describe general formulation of Adding-Memory oper-
2. Each rotation operator is written Rij (θ) which ator in matrix representation.
represent rotation to xi − xj plane with angle θ There are two parameter that must be identified
to the xi axis where i < j. Note that Rij (θ) = by Adding-Memory operator which are x, parameter
Rji (−θ), hence the number of rotation operator denotes ket base to be added in quantum memory,
N!
in N -dimension space is C2N = (N −2)!2! . and B, parameter denotes initial condition of quan-
tum memory. For example, initial condition of 3-
In matrix representation, rotation operator is written qubit quantum memory contain a set of ket bases
in the following matrix components: denotes by B = {000, 101} and we want to add a
 data 010 in quantum memory hence we set x pa-

 cos θ ,p = q = i

 rameter to 010. Therefore, Adding-Memory operator

 or p = q = j
will be written down as A(x, B) = A(010, {000, 101})

1 , others p = q
[Rij (θ)]pq = (5) and initial condition of quantum memory written in

 − sin θ , p = i and q = j

 ket |yi = √12 (|0i + |5i) (later on we use decimal

 sin θ , p = j and q = i
 base). After operation of Adding-Memory operator,
0 , others
final condition of quantum memory will be in ket
For example in 2-dimension , matrix rotation is |y 0 i = A(2, {0, 5}) |yi = √13 (|0i + |2i + |5i).
written as R12 (θ) while in 3-dimension, matrix rota- There are some restrictions in order to operate this
tions are expressed as below: Adding-Memory operator, which are:

Rx (θ) = R23 (θ) 1. Adding-Memory operator can only add a data for
Ry (θ) = R31 (θ) (6) each operation it means Adding-Memory opera-
Rz (θ) = R12 (θ) tor works only to classical data.

with x1 = x, x2 = y, and x3 = z. 2. Final condition of quantum memory will have

2.2 Adding-Memory Operator Design on n-
qubit
Manipulations of a ket in quantum computer with uni-
tary operators act as logic gates in classic computer.
equal probability amplitude for each data or ket
bases.
As stated before, Adding-Memory operator is con-
structed from many rotation operators written down
below:

0405-3
4 Adding-Memory Operator on Quantum Computer...

|yi is
 
( ( )) |y 0 i = A(2, {0, 5}) |yi
∏
p=1+b
1 ( )T
A (x, B) =  Rij arcsin √ 
√1 0 √13 0 0 √1 0 0
p = 3 3
jB j6=i p=2
( ()) 1
1 = √ (|0i + |2i + |5i) (13)
× Rix arcsin √ 3
b+1
 
∏
p=1+b ( ( )) T In previous example, we have described how to build
1
× Rij arcsin √  (9) Associative model of 3-qubit quantum memory and
p with same method we can build Associative model of
jB j6=i p=2
n-qubit quantum memory.
with i is smallest data in set B (generally i = 0).
In matrix representation, matrix elements of Adding- 3 IMPLEMENTATION OF ADDING-
Memory operator A(x, B) state as below: MEMORY OPERATOR IN ADDRESS-
ORIENTED MODEL
 √ In this section, we will describe how to build Address-

 b

 (√
b+1 ,i = j = x
) Oriented model of quantum memory using Adding-



 1 b
− Memory operator. As an example, a quantum mem-

 b b+1 + b 1 ,i = j

 ory contains 3-qubit data and 3-qubit address

 and i, j  B



 1 , others i = j |mi = |000i ⊗ |000i (14)
(√ b ) | {z } | {z }
b+1 − 1 , i 6= j
[A(x, B)]ij = 1 (10)

 b 3−bit address 3−bit data



 and i, j  B

 √ 1 with initial state of quantum memory in ground state

 b(b+1) , i = x and j  B

 as above

 √ −1
, j = x and i  B

 In order to operate, we need an operator to work on


b(b+1)
bits address, which has a function to add one value
0 , others i and j
to bits address until we get desire address. This op-
erator is named Inc(Increase) operator and it works
with i, j = 0, . . . , 2n − 1 and b is the total mem-
to a ket as below
ber of set B. So, In the previous problem we obtain
i, j = 0, . . . , 23 − 1 = 0, . . . , 7 and b = 2, then we have
Inc |ni = |(n + 1)mod N i (15)
Adding-Memory operator in matrix elements written
down as: with N is dimension of Hilbert space. In matrix rep-
 √ resentation, this operator can be written in its matrix

 2 elements as follows:

 √
3 ,i = j = 2

 ( ) {

 12 2 1 , i = (j + 1)mod N

 3 + 1 ,i = j [Inc]ij = (16)

 0 , others

 and i, j  {0, 5}



 1 , others i=j For example, Inc operator for 3-qubit address in
(√ 2 )
[A(2, {0, 5})]ij = matrix form is written as:
3 − 1 , i 6= j
1

 2

 and i, j  {0, 5}

  

 √ 1 , i = 2 and j  {0, 5}

 0 0 0 0 0 0 0 1


2(3)
 

 √ −1
, j = 2 and i  {0, 5}  1 0 0 0 0 0 0 0 

  
 2(3)
 0, others i and j  0 1 0 0 0 0 0 0 
 0 0 1 0 0 0 0 0 
 
(11) Inc = 
 0 0 0 1 0 0 0 0 
 (17)
with |yi = √12 (|0i + |5i) which in the form of column  0 0 0 0 1 0 0 0 
 
matrix can be written  0 0 0 0 0 1 0 0 
 
 0 0 0 0 0 0 1 0 
( )T
|yi = √1 0 0 0 0 √1 0 0 (12) 0 0 0 0 0 0 0 1
2 2
The process of adding a data into quantum memory
then final result of Adding-Memory operator to ket in Address-Oriented model describes below:

0405-4
5 Adding-Memory Operator on Quantum Computer...
1. We define a qubit |xi that contains a data that
will be added into quantum memory. For the first
time, we set the qubit address in ground state.
For example, a data that we want to add is 101
hence initial state of ket |xi which is
|xi = |000i ⊗ |101i (18)
2. Next, we do several times Inc operators to 3-
qubit address of ket |xi until we get the desire
address. In this example, we want the data is
place at address 4 or in binary base 100. Then,
we do Inc operator 4 times to state |xi the fol-
lowing:
[Inc ⊗ I]4 |xi = |100i ⊗ |101i (19)
In general, if we want to place in address a then
we do such operation:
[Inc ⊗ I]a |xi (20)
where I is identity matrix for the qubit data.
3. The next step is using Adding-Memory operator
of (3 + 3) = 6-qubit with parameter x as input
ket from the last operation on step 2 which is ket
|xi and output ket |yi = |mi. In this example,
we then write input ket as:
|xi = |100i ⊗ |101i (21)
with x = 37 and B= {0} in decimal, hence we
have:
|xi ⊗ |yi → |xi ⊗ |mi (22)
|mi = A(37, {0}) |yi
1 Second approach is by setting final condition of
= √ (|000i ⊗ |000i)
2
1 tude for each ket bases as shown below
+ √ (|100i ⊗ |101i) (23)
2
4. Until now, the process is finish and if we want
to add another data we can repeat the process
from first step with initial condition of quantum
memory is stated by the result of step 3 which is
ket |mi.
0405-5
4 POSSIBLE DEVELOPMENT ON
ADDRESS-ORIENTED MODEL FOR
QUANTUM DATA
Associative model does not use an extra qubit as
address qubit and affects on how it stores only clas-
sical data with equal probability amplitude [13]. In
special condition, we can push Associative model to
store quantum data but it will have a restrictions that
we can only store one quantum data can in quantum
memory. Normalization of state is another problem
that comes when we want to store quantum data with
difference probability amplitude for each ket bases in
quantum data.
For example, a 3-qubit quantum memory is in ini-
tial state |000i and we want to add a quantum data
|ψi = a |001i+b |100i so that we expect final condition
of quantum memory will contain this quantum data
without loss information about probability amplitude
for each ket bases (a and b). The first approach de-
scribes as below:
1
|000i → √ (|000i + |001i + |00i)
3
1 a
→ √ |000i + √ |001i
3 a 3
b
+ √ |100i (24)
b 3
The final condition of quantum memory will have
equal probability amplitude for each ket bases, but it
causes quantum memory loss information about prob-
ability amplitude of quantum data (a and b). If we
look at one of its ket bases |001i, we know that this
ket base actually came from quantum data with prob-
ability amplitude is a and the value changes into √13
after we add it into quantum memory. In quantum
memory, we have no information on how to return
original value of probability amplitude of ket |001i.
It is possible to define another variabel c and write
down probability amplitude in the form of √13 = c√c 3
with c 6= a, which is means we can have its original
probability amplitude arbitrary.
quantum memory with difference probability ampli-
1
|000i → √ (|000i + a |001i + b |100i) (25)
2
with final condition above, the problem of normal-
ization and loss of probability amplitude informa-
tion can be overcame nicely. However, this approach
has limitation that only one quantum data can be
6 Adding-Memory Operator on Quantum Computer...

added to quantum memory. What if we add another data |ϕi = p |001i + q |010i + r |011i and place it in
quantum data into quantum memory? For exam- address |010i, we will get final condition of quantum
ple, we want to add a quantum data denotes by ket memory as below:
|ϕi = p |001i + q |010i + r |011i, which has same ket
base |001i but with difference probability amplitude
1 ( )
(p). The final condition of quantum memory on ket √ |000i + |011i + . . . + |111i ⊗ |000i
base |001i will have mix probability amplitude from 8
1 ( )
quantum data ket |ψi and ket |ϕi. The problem is + √ |001i ⊗ a |001i + b |100i
how to extract probability amplitude value from this 8
final condition into their original value (a and p) since 1 ( )
+ √ |010i ⊗ p |001i + q |010i + r |011i (29)
there is no information that final condition of quan- 8
tum memory has mix value from difference quantum
data. After adding second quantum data, final condition of
Address-Oriented model has possible development quantum memory is still normalized and there is infor-
to store quantum data and guarantee the normaliza- mation about probability amplitude of second quan-
tion of final condition of the quantum memory. The tum data (p, q, and r).
most important is this model still keeps information We have described above how Address-Oriented
of probability amplitude for each ket base come from model of quantum memory could handle quantum
its quantum data. We use previous problem with 3- data. However, we still look for general operator that
qubit address as an example to describe how Address- can work on this model and research about this oper-
Oriented model can overcome quantum data. As we ator is still in progress now.
know, quantum memory in Address-Oriented model
is separated into two components, which are address 5 CONCLUSION
and data. Different with classical data, in handling
quantum data we set initial condition of qubit address Adding-Memory operator is build from rotation op-
in quantum memory into linear combination of all its erator in Hilbert space and used to develop quantum
ket bases with equal probability amplitude. In this memory model. There are two models of quantum
case, we set initial condition 3-qubit address of quan- memory that is Associative (without qubit address)
tum memory as linear combination from 000 to 111 and Address-Oriented (with qubit address) model.
with equal probability amplitude √18 . Adding-Memory operator can implement two model
of quantum memory to store classical data. This
1
√ (|000i + . . . + |111i) (26) Adding-Memory operator denotes by A(x, B) needs
8 two parameter in the operation which are x as input
Initial condition of qubit data of quantum memory is data and B as set of data in initial condition of quan-
in |000i, so initial condition of quantum memory is tum memory.
In order to store quantum data in quantum mem-
1
√ (|000i + . . . + |111i) ⊗ |000i (27) ory, we propose Address-Oriented model as better so-
8 lution compared to Associative. In Address-oriented
Now, if we want to add quantum data |ψi = a |001i + model, we can keep both normalization of quantum
b |100i and place it in address |001i then final condi- memory and have information about original value of
tion of quantum memory will be as below: probability amplitude of quantum data. While in As-
sociative model, we do not have information about
( 1 ) original value of probability amplitude of quantum
√ (|000i + |010i + . . . + |111i) ⊗ |000i data. Besides that, Associative model can only store
8 one quantum data in quantum memory compare to
1 Address-Oriented model that can store quantum data
+ √ |001i ⊗ (a |001i + b |100i) (28)
8 as much as its address.
and if we count total probability of the quantum mem- JTCS

ory then it will be normalized. There is also informa-

tion about original value of probability amplitude of REFERENCES
quantum data. As we can see that probability am-
plitude of quantum data in quantum memory is √18 [1] A. Steane. arXiv:quant-ph/9708022v2. Univer-
multiply by its original value of probability amplitude sity of Oxford: Department of Atomic and Laser
(a and b). Then, if we want to add another quantum Physics.

0405-6
7 Adding-Memory Operator on Quantum Computer...

[2] M. A. Nielsen, I. L. Chuang. Quantum Compu-

tation and Quantum Information. (2002). Cam-
bridge University Press.
[3] D. Bouwmeester, A. Ekert, A. Zellinger.
The Physics of Quantum Information. (2001).
Springer-Verlag.
[4] J. Preskill. Lectures Notes for Physics 229:
Quantum Information and Computation. (1998).
California Institute of Technology.
[5] P. W. Shor. SIAM J. Computing 26, 1484.
(1997).
[6] L. Grover. Phys. Rev. Lett. 79, 325. (1997).
[7] V. C. Hamacher, Z. G. Vranesic, S. G. Zaky.
Computer Organization. (1996). McGraw-Hill In-
ternational Editions.
[8] M. M. Mano. Computer System Architecture.
(1993). Prentice-Hall International Editions. Cal-
ifornia State University of Los Angeles.
[9] T. Kohonen. Self Organization and Assosiative
Memory. (1984). Springer-Verlag, Berlin.
[10] B. Muller, J. Reinhardt. Neural Networks. (1990).
Springer-Verlag, Berlin.
[11] J. J. Hopfield. Proc. Natl. Acad. Scie. USA 79,
2554. (1982).
[12] B. Kosko. IEEE Trans. on Systems, Man and Cy-
bernetics 18, 49. (1988).
[13] C. A. Trugenberger. arXiv:quant-ph/0012100 v2.
InfoCodex, chemin du Petit-Saconnex 28, CH-
1209 Geneve, Switzerland.
[14] J. J. Sakurai. Modern Quantum Mechanics.
(1994). New York: Addison-Wesley Publishing
Company, Inc.
[15] A. Ekert, P. Hayden, H. Inamori. Basic Concepts
in Quantum Computation. (2000). University of
Oxford: Center for Quantum Computation.

0405-7