.., .., ..

..,

1

,
.

,
,
.

,
.

[65].
, ,
.
, ,
,
,
- .

.
,
.


.

1 4
1.1
. . . . . . . . . . . . . . 5
1.1.1 . . . . . . . . 12
1.1.2 . . . . . . . 19
1.2 . . . . . . 22
1.2.1
. . . . . . . . . . . . . . . 26
1.3 . . . . . . . . . . . . . . . 29
1.3.1 . . 33

2 38
2.1
. . . . . . . . . . . . . . . . . . 56

59

3
 1

, ,
,
.

, ,
(x),
x,

R
(y)x (y) dy .
,
.

. ,
,


.
,
.

4
1.1

,

,
, :

(t, r1 , r2 , . . . , rn ).

rj j (
,
).

n .
,
t
, j = 1, 2, . . . , n
j rj .

:

. ,
, ,
, ,
.
,
, ,

( ,
,
).

5
, .
,
,
.
,
t + t ,
t
U , (
, ,
).
:

u1,1 u1,2 ... u1,n

! 1 (t)
! 1 (t + t)
!
u2,1 u2,2 ... u2,n 2 (t) 2 (t + t)
... ... ... ... ... = ...
un,1 un,2 ... un,n n (t) n (t + t)
(1.1)
j (t + t)

n
X
j (t + t) = i (t)uj,i . (1.2)
i=1

(1.2) ,


,

. ,
,
,

.
,
.

.

6
 ,

U: t t + 2t.
2
: (t + 2t) =
PU (t). ,
j (t + 2t) = i,k i (t)ui,k uk,j . ,
, ,
, ,

,
.
U,

(
- ). ,
,
-
.
,

.

, ,
,
- .

,
, -
.

. x
:
x : f (x) xf (x), r = (x, y, z) -
r : f (x, y, z) (xf (x, y, z), yf (x, y, z), zf (x, y, z)),
px x -

7
 px = hi x
, p -
p2
p = hi ( x

, y
, z ), - 2m + V (x),
V - .
.
,

2 2 2
|r| : f (x, y, z) (x + y + z 2 )f (x, y, z),
- p2 : f h f 2

(
), r p - ,


- , ..


: Z
ipx
(p) = e h (x)dx, (1.3)

:
Z
1 ipx
(x) = e h (p)dp.
2h
R

ipR
e
R
(p) = h (R)d3 R,
R3
ipR
1
R
(R) = (2h)3
e h (p)d3 p,
R3

3
,

, ,

8
 (x, py , z), (px , y, pz ), .. ,

-
.

, -
, ,
exp(ipR). -
, ,
R+p
,
, . ,
,
, .

,
:
.

, ,

x:

p(x) = |(x)|2 (1.4)

,
p

.
.
,

,
.

9

,
,
.
,
.

.
1

,
.

,
.
,
,
.


,
.
,
-
.

,
,
.
, ,

, .

1
.

10


ih = H (1.5)
t
H (
).
.
( ,
)


. ,
,
,

 
i
(x, t) = exp Ht (x, 0) (1.6)
h

, .

,
.
,
.
(,
),
.


;

.

11
1.1.1

.

.
,
.

,
.
,
,
d > 0, ,

,
,
,
.


(. ),

(
,
). ,
-
.
,
 ,
.
- d =
(dx , dt ) ,
.

12

, ,
.
,

(. 
).
,

R (
, R
). R
D1 , D2 , . . . , Dm
|i,
Dj j C . |ji
Dj .

m
X
|i = j |ji (1.7)
j=1

,
|ji.
f(x)g(x)dx,
R
(g, f ) =
, |ji
. (
, j Dj ),
.
(1.7) |i
, |ji.
(1.7)
,
(x),
x , ,
(x) -

13
 x.
,

, .

, ,
(1.7) .

.
|ai a

.
A
A|ai,
A A .
, ha|
- , |ai
. -
-
, .

. a
b ha|bi. ha|A|bi
: ha|(A|bi), (ha|A )|bi.
A , A = A ,
,
.
.
exp(iH), H - , .
,
U ,
U 1 = U , , , U
.
|i

14
 |1 i, |2 i, . . . , |N i
, |j i
2
|hj |i| .
. ,
,
:
|i |j i,
j = 1, 2, . . . , N
,
.
.
, , , ,
|i
, (
)
,

.

,
- . ,
A,

.

A.
(
, ), ,
(
).

( z ).

,

15
 . ,

. , ,
Dj
,
x

1 0 ... 0
0 2 ... 0
(1.8)
0 0 3 ...
... ... ... ...

h2 12 /2m 0 ... 0
!
0 h2 22 /2m ... 0
DF T 0 0 h2 32 /2m ... DF T 1
... ... ... ...
(1.9)
DF T
(. - QF T ). 1, 2, . . .
.
.
,
,
,

.
,
, .
,
,

. ,
, , x
, , py ,

16
 ,
.

.

.
, , ,
. ,
(

), ,
,

. , ,
, ,
.
, ,

, ,
,
,
, .

|1i, |2i,
(

 
1/2 1/ 2
1/ 2 1/ 2

 1 2, 1/2.  
,
: |0i |1i, ,

, .

17

. ,

,
,
,
. ,
,
2
. , ,
,
.
,
,
,
. ,
,

. ,
, ,
,

. ,

,
. ,
,
.
,

;

2

( , ),
s/t, ..

18
 , ,
.

, ,
.


, ,

.
.
,
, . 2 2.4.2.

, ,
.
,
.
,
,
.

1.1.2

-
.

,
,
:
.

19
.

-
.

,

,
.
. H1 , H2 , . . . , Hn
- 1, 2, . . . , n
.

N N
N
H = H1 H2 . . . Hn , .
j j j
b1 , b2 , . . . , bk
j
Hj , j = 1, 2, . . . , n. H,
,

O O O
b1i1 b2i2 ... bnin ,
.
, ,
-
,
: |0i|0i, |0i|1i, |1i|0i, |1i|1i.
i| |00i
..
(rN
1 , r2 , . .N
. , rn ) N

H = H1 H2 . . . Hn r1
H1 , ..
|j i N
Hj N j = 1,N2, . . . , n,
|1 i |2 i . . . |n i .
,
,
N
,

20
,
, .

.
j
A : Hj Hj ,

N A =
1 2 n
N N
A A ... A .

O O O
H : A(b1i1 b2i2 ... bnin ) =
O O O
= A1 (b1i1 ) A2 (b2i2 ) ... An (bnin ),

H.
H
.
, |00i + |11i
.
, ,
()
.

, ,
. ,
,
, .
, ,
. 6 ,
.
,
.
.

(r1 , . . . , rn ),

21

1 (r1 )2 (r2 ) . . . n (rn ).
, ,
,
,

:
j
b1 , . . . .
1
, , b1
1
1, b2 - 2
.. ,
, .
,
,
, ..

1.2

,
: .
, ,
,

.
.
. ,
|i
H,
t0
t1

Ut0 ,t1 : H H (1.10)

22
 , ,
i
U = exp( H(t1 t0 )),
h
H ,
(
),
,
|(t)i
.
, |i
|1 i H
, |i,

Ut0 ,t1 .
?
:
|i
,
.
,
Ut0 ,t1 |i, ,
.

.

.
, .
,

, .
,
,
,
.

23
{|1 i, . . . , |n i} H,
, .
,
|j i |hj |i|2 .
,

.
,
.
|j i
- ,
.
- ,
, (
), (

).
,
,

.

,
.

.

- ,
, ,
.

.

,

24
,

, ..

( )
,
,
, ,
:
|j1 i |j2 i. -

(
,

),
.
,


.
( )
,
,
|i .
? ,
,
(
).
,
.

. ,
,
,

25

, .

1.2.1

,
, Tqua .
:
. ,

U1 , U2 , . . . 1-2
3 , ,
, ,
. ,
:
.
- ,
.
,
,
|0i. n ,
2n
.
:

N
X 1
|i = j |ji (1.11)
j=0

N = 2n , j ,
|ji.
, ,

26
 , N
, n
. , (1.11) ,

.

.
- ,

.
-
,
.
j |j i

O O O
U V W ... (1.12)

U, V, W . . .

,
, .
,

N
X 1
|(t)i = j (t)|ji
j=0

.
,
.
,
. ,

27
 U : H1 H2 ,
H1 - m k
. :
() m ,
,
(query).
0, .
1,
,
, ,
,
N
I U, U m
, -
. ,

.

f : {0, 1}m {0, 1}k

m k ,
, -
. a b - ,
.
,
:

M
Quf |a, bi |a, b f (a)i (1.13)

L
2.

,

2
. , Quf = I.

28
 ,
.

1.3

,
S1 S2 , ,
N
|S1 i |S2 i.
,


S1 S2 .
. ,
S1 .
H = tr(S1 ln S1 ),
, S2 .

.
,
,
(
)

, ,
. ,

,
,
.

,
H.

29

, .

,
. GHZ W
,

GHZ : 1 |11 . . . 1i + 2 |22 . . . 2i + . . . + k |kk . . . ki,

W : 1 |100 . . . 0i + 2 |010 . . . 0i + . . . + k |00 . . . 1i.
(1.14)
,
n
, n - . ,

,

.
, GHZ W
.
GHZ . n = 2
,

X O
j |j1 i |j2 i (1.15)
j

{|j1 } {|j2 }

. (1.15
N , N
. ,

,
.

30
 GHZ
.
. ,
,
. GHZ k = 2:
|i = |00i + |11i. 0 1
.


. ,

,

, .
,

. ,
: |00i + |11i. ,

. ,
-, .

,
, ,
.
GHZ .
,
.

.
, -
.

( )

31
 :
1)
.
2) ,
.
, 3 ,
|100i + |010i + |001i,
,
W (

,
, .. LOCC- ).
W
. GHZ
LOCC - .
,

. ,


,

.
:

,
.
. , , |100i
1 ( 2 3
), |010i
2 ( 1 3 ), ..
GHZ (1.14)
Pk
j |ji.
j=1

32

. ,
.

1.3.1

. ,
.,
.
,
, , ,
, .. (
) . ,


,
l
, n
2n
.


n . ,


.

, ..
.
,
, ,  .

. ,
,
 ,

33
 .

.
,
, .
,

.
, ,
, ,
, -

-
,
. ,
, ,
.
,
,
(

).
, QFT

.

,
t.

eiHt/h
p2
0 , H = Hp + Hx , Hp = , Hx = V (x), p =
2m
h
V (x) .
i x
t .
Hx .

34
 ( eiHx ) ,

, -
,
.
. , Hp

. ,
:
, ,
- .
t
:

eiH (eiHx t eiHp t )1/t . (1.16)

,
.
 , Hx
. :
R + ipx
QFT : f e f (x) dx
/x ip,

2
eiHp = FT1 eip t/2m FT,
.
2
QFT p /2m
(1.16) .

,
-
.

eiHx ,
.
p,

35
 ,

i
|0i |0i, |1i e |1i,
,
.
, ,
,
. ,

n ,
n
,
(
ihHx
). e
(quantum
gate array) , n.

t O(t2 ).
,
,

1+
. O(t )
 > 0,

(. [65]). ,
-
,
,
3
.
.

,

3 t
0
t <t , ., , [32].

36
,
.
,


,

A. p
p ec A, e , c -
. ,
,
. ,
,
,
, .
,
,
,
.

37
 2

1). ,
( ?)
(
, ).
2).
|i? ,

.
3). A: exp(A)
( ?).
) , exp(A + B) = exp(A)exp(B)
A B (
?) .
). ,
exp(A t) (exp(A t))0 =
A exp(A t).
3). H
(Hf, g) = (f, Hg)
. U
,
. , )

38
 H exp(iH)
, ) U
H, U = exp(iH).
(: 1)
, 2)
).
4). h|H|i
H ?
5).
,

. |i
A, , ,
A
|i ,
A.
:
) ( ?),
) p =
h
i
h 1027 -
,
) x : (x) x(x) ?
) ( )?
) (
)?
6). 5)
: ,
r, .
?
7).
? (:

). 5) 6)
?
8).

39


     
0 1 0 i 1 0
x = , y = , z =
1 0 i 0 0 1

.
? ?
[A, B] = C A, B
- . .
9). H
.
). .
(: 5) 6),
2
E = p /2m+V
p- , V - .
). .
). ,
( ).
). ,
(
).
10).

.

(: H|ij = j |ij .
Ej , |ij
- .
, - ,
.)
11).
) (
).
)
.

40
 )
)*** m
e
( - . :

?
, ).
)**
),
, M 2000m?


).
12).
.
)
(: exp(ipr/h).
5)).
)

? (:
? 11)).
13).
. ,
?
14). ,
.
.
15).
(:
, - ,

3).
?

41
, V ?
,
?***
( - . :
(. [?]).
16). ()
.
n . (:
.
,
.)

?

.
17).
? ?
(:
|i, ,


16)).
(Quantum Fouri-
er Tranform - QFT). ,

.
.
18). C

.
12),

. ?
? ?

42
(:
. 17)).
19). QFT
?
20). ,
. (:
.
: ) 18)
) ,

(. [?]), ,
QFT
).
21). ,
. (:
20).
2 .
0 1. 4
: 00, 01, 10 11.
:

|00i, |01i, |10i, |11i.

,

|i = a|00i + b|01i + c|10i + d|11i.

|a|2 
2 2 2 2
|00i, .. , |a| +|b| +|c| +|d| = 1
.

, |i, :
2 2
1) p0 = |a| +|b|
|0i -

1
p (a|0i + b|1i),
|a| + |b|2
2

43
 2) p1 = |c|2 +|d|2
|1i -

1
p (c|0i + d|1i).
|c|2 + |d|2

O 1
|0 i = |0i p (a|0i + b|1i),
|a|2 + |b|2
-

O 1
|1 i = |1i p (c|0i + d|1i)
|c|2 + |d|2

,

. ,
,
,
.
|i
,
2 = p0 0 + p1 1 |i
|ih|.
.
A, ,
j = 1, 2, . . . , k pj
|ij
{|ij , j = 1, 2, . . . , k}.
,
|ij pj . , A
.
,
- .

44
 , , ,
,
, ,
.
A

X
pj j .
j

.. ( .
). ,

.
22). =
|hi| |i n .
?
23). |(t)i ,
.
,
(t). (: ,


.)
24). , ()
,
?

, ,

. (:
,
- , .)
25). , exp(i)

45
 . ( 24).
26).
?

?
27). N-
. |ji
, j {0, 1, . . . , N 1}
?
hj|? (: , hj|ki
|ji |ki;
- .
1 2).
|i?
28). ,
? ()
?
? ,
.
29). ?
. (:
).
30). trace |ih| = h|i.
31).
H. hHi
H |i? (:
).
32). hHi = trace ( H) =
trace (H ). (: 31).

?
33). ,

? .

46
 ,
? (:

).
A B,
a1 , a2 , . . . , aN
b1 ,N
b2 , . . . , bM .
A B N
ai bj , i = 1, 2, . . . , N, j = 1, 2, . . . , M ,

N
. ,
,
.
N N
a A b B a b A B .
.

N A B
A NB ,
N
N
: A Bai bj = A(ai ) B(bj ).

.

.
34). ?
.
35). |i - 2 .
. ,
1
. , 1
,
|i .
36). ,

. ,
2

47
 ?
36). CNOT (control not) :
L L
|x yi |x x yi, x, y {0, 1},
2. ?
? .

:
L
|x y zi |x y z xyi.
36). |i - ,
,
- .
, (
) ?
,
( ),
?
37). A B .

.
.
38). H : |0i
1 (|0i + |1i), |1i 1 (|0i |1i).
2 2
39)*. W n -
H (
?).
W. (: 37) 38)
wij . i
j

.)
40).
,
,
,

48
, (
) - .
,
.
-
? ,
?
.
41). U ,
N N
|i U |i |0i = |i |i?
( ).
40).

: ,
.

.
, .
,
.
,
.


.

,
.
, ,
, . ,
.
?

( )

49
, .
.
42). |ai
,


|bi, if hb|ai = 0,
Ia : |bi
|ai, if |bi = |ai.

, .
. ?
43). |0i - |00 . . . 0i, |0i =
W |0i. |0i .
I0 I0 W?
44)**.
I0 . (:
, ,
,
,
.

.)
45). f : {0, 1}n {0, 1} - n-
. , ,
:
L Quf : |x, yi
|x, y f (x)i (
. f
.
, Quf , Ixtar .
f ?
?
46). xtar - f (x) =
1, LR
2 - ( ?)
R
|0i |xtar i. , L2
Ixtar I0 .

50
 47).
G = Ixtar I0 ? (: G LR
2
( ?).
48). f (x) = 1 , l
.
R
G L2 ?
t
49). t, G |0i
|xtar i. t
Gt |0i, |xtar i?
l ?
50). -
f (x) = 1 .
,
?
51). 50)
.
52)***. ,
QF T 1 .

51
a0 r r r r i b4

a1 r r r i r b3

a2 r r i r r b2

a3 r i r r r b1

a4 i r r r r b0

1. QFT1 .

,
:

1 0 0 0
0 1 0 0
Uk,j = , k > j. (2.1)
0 0 1 0
i/2kj
0 0 0 e
:
aj 2j b = bk 2k ,
P P
a =
j k
a b (
,
1
, QF T - .

52

17).) ,
.
-
.
( ?) -
,
, .
. j>k
j
k .
aj bk . , , aj
bnj+1
.
, ,
QF T 1 . ([65])
([40]).
53). ,
U . ,
Useq |, ai = (U a |i|ai, a-
( , CNOT). :
,
CNOT
.
54)**. 53) Useq
a- .
?
55). a- n- ,
n
U exp(2iwk ) wk k/2 , k -
. ,

RevU = QF T2 Useq

,
|, 0i

53
 wk . (:
.)
.
, U ,
.
56)***. ,
55)
n
s/2
wk 1 1/s, wk
55) . (:
,
n
s/2 s.
([?]). )
n1
57)***. q - , 2 <
n r
q < 2 , x = 1 (mod(q)) (r -
x q ), Ux n

Ux |yi = |yx mod(q)i y < q
n
Ux |yi = |yi y = q, q + 1, . . . , 2 1. ,
RevUx 55)

r. (: 56).
?
58)***. ,
57) ,
Ux seq ,
2d
x , d = 0, 1, 2, . . ..
56)-58)
.
q.

q;
2 3
O(log q) log (log q)
2
(log q ).

. , ,

54
 .

1/3
O(q ).
59). 52), ,

O(n) n - . (:
|j k|
.)
60). exp(A + B)
1 1 m
(exp( m A)exp( m B)) A B (
?). .
(: ).
61). exp(A + B)
.
62)***. ,
O(n) ,
(t, r)
n
O(t2 ), ,

(
). : 18),
20) 52),

.
18) 20)
.
.
,
. ,


([30])

55
 ,
|

.

2.1

21 .
( 10 ).
,
,
-
.
(, ),
.
.
CNOT
.

, |0i
, |1i - .
.
:

|i = 0 |0i + 1 |1i.

0 , 1 ;

ih = H,
t
56
 H
 
a a
a a
a,

1
|0i = (|0i + |1i)
2

0 (
),
1
|1i = (|0i |1i)
2
- 2a (
).
( )
, .
|i t

0 exp(0t)|0i + 1 exp(2at/h)|1i,

NOT ( |0i > |1i

) t =
h/2a. NOT
,
;
.
CNOT
( ) ,
.
a ()
,
() :
, a , - .

57

NOT ,

CNOT.
;

.

58


[1] G. Adenier, A. Yu. Khrennikov. Is the Fair Sampling As-

sumption supported by EPR Experiments?, J. Phys. B
40 No 1 (2007) 131-141

[2] V.Akulin et al, Description of quantum entanglement

with nilpotent polynimials: extensive characterization of
entanglement and canonical forms, Proceedings of SPIE,
2006, vol. 6264, pp. 02-1 - 02-11.

[3] V.Akulin et al, Quantum computers and computing,

2006, vol. 6 N1, pp. 107-125.

[4] V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design

and Analysis of. Computer Algorithms. Addison-Wesley,
1974.

[5] K.Arakelov, Y.Ozhigov, Association of two-atom

molecules. Simulation via Quantum state selection,
accepted for publication on Vestnik of MGU, Computa-
tional mathematics and cybernetics, issue 2009.

[6] Experimental Realization of Einstein-Podolsky-Rosen-

Bohm Gedankenexperiment: A New Violation of Bell's
Inequalities, A. Aspect, P. Grangier, and G. Roger, Phys-
ical Review Letters, Vol. 49, Iss. 2, pp.91-94 (1982)
doi:10.1103/PhysRevLett.49.91

59
 [7] P.Benio, Quantum mechanical hamiltonian models of
Turing machines, J. Stat. Phys. 29, 1982, 515-546.

[8] C.H. Bennett, E. Bernstein, G. Brassard and U.V. Vazi-

rani, Strengths and weaknesses of quantum computing
SIAM J. on Computing, Vol. 26, No. 5, pp. 15101523,
1997.

[9] G. Birkho, J. von Neumann, The Logic of Quan-

tum Mechanics, Annals of Mathematics, 37 (1936), p.
823843.

[10] C.H.Bennett, G.Brassard, C.Crepeau, U.M.Maurer, Gen-

eralized privacy amplication, IEEE Trans. Inform. Teo-
ry, 41, 1915, 1995.

[11] R.Blatt et al, Ion trap quantum computing with Ca+

ions, Quantum Information Processing, vol.3, 1-5, pp. 61-
73, 2004.

[12] D.V.Blohintsev, Principal topics of quantum theory,

1977, Moscow, Nauka (Phys-math. lit.).

[13] M. Boyer, M., G. Brassard, P. Hyer, and A. Tapp, Tight

bounds on quantum searching, Proc. 4th Workshop on
Physics and Computation, pp. 3643, 1996.

[14] Bravyi S.B., Kitaev A.Yu. Fermionic Quantum Compu-

tation, Ann. Phys. - 2002.- v.298, N.1. - p.210-226

[15] L. E. J. Brouer. Intuitionism and formalism. Amer. Math.

Soc. Bull., 20:8196, 1913.

[16] Durr, C., Hoyer, P., A Quantum Algorithm for nding the
Minimum, Proc.Roy.Soc.Lond. A455 (1999) 2165-2172

[17] R.Feynman, The theory of fundamental processes, Cal-

tex, W.A.Benjamin, Inc., NY, 1961.

60
[18] R.Feynman, Simulating physics with computers, J. The-
oret. hys., 1982, 21, pp. 467-488.

[19] R.Feynman, D.Hibbs, Quantum mechanics and path in-

tegrals, 1984, Moscow, Nauka (Phys-math. lit.).

[20] M.Genovese, Research on hidden variable theories: A

review of recent progress, Physics Reports, 413, 2005,
pp.319-396

[21] L.Grover, A fast quantum mechanical algorithm for

database search, Proceedings, 28th Annual ACM Sym-
posium on the Theory of Computing (STOC), May 1996,
pages 212-219. Proceedings, Melville, NY, 2006, vol. 810,
electronic version: xxx.lanl.gov, quant-ph/0610052.

[22] M.A.Horne, A.Zeilinger, Speakable and Unspeakable in

Quantum Mechanics, Invited book review, Amer.J.Phys.,
42,630 (1989).

[23] A.Khrennikov, Prequantum Classical Statistical Field

Theory: Complex Representation, Hamilton-Schr?dinger
Equation, and Interpretation of Stationary States, Foun-
dations of Physics letters, vol. 19, N4, pp. 299-319

[24] Kleene, S. C. and Vesley, R. E., 1965, The Foundations

of Intuitionistic Mathematics, Especially in Relation to
Recursive Functions, North-Holland, Amsterdam.

[25] D.E.Knuth, The art of computer programming, Addison-

Wesley, 1997

[26] P.Kurakin, G.Malinetskii, H.Bloom, Dialogue model of

quantum dynamics, Proccedings of SPIE, vol. 6264, 2005,
Quantum Informatics - 2005 (ed. Y.Ozhigov)

61
[27] A.A.Markov, About the continuity of constructive func-
tions, Uspehi Mat. Nauk (rus), 1954, 9, N 3 (61), pp.
226-229.

[28] Yu.I.Ozhigov, A.Yu.Ozhigov, Algorithmic container for

physics, AIP Conference Proceedings, vol. 962 (Quantum
Theory, Reconsideration of Foundations) pp. 168-174

[29] Y.Ozhigov, Amplitude quanta in multi particle system

simulation, Russian Microelectronics, 2006, vol. 35, 1, 53-
65.

[30] Y.Ozhigov, Lower bounds of a quantum search for an ex-

treme point, Proc.Roy.Soc.Lond. A455 (1999) 2165-2172

[31] Y.I.Ozhigov.Quantum Computers Speed Up Classical

with Probability Zero, Chaos Solitons Fractals 10 (1999)
1707-1714

[32] Y.Ozhigov, How behavior of systems with sparse spec-

trum can be predicted on a quantum computer, Pis'ma
v JETP, vol. 76, 11, pp. 799-804.

[33] Y.Ozhigov, Dynamical diusion as the approximation

of one quantum particle dynamics, lanl e-print, quant-
ph/0702237

[34] Y.Ozhigov, Quantum recognition of eigenvalues, struc-

ture of devices and thermodynamic properties. ZhETF,
2003, vol. 123, iss. 2, pp. 384-398.

[35] Y.I.Ozhigov, Easy control on fermionic quantum compu-

tations, NATO Science Series, 2005, vol. 189, pp. 27-32.

[36] A.Ozhigov, K.Arakelov, Y.Ozhigov, Principles of the nu-

merical simulation of many body quantum dynamics,
Quantum computers and computing, 2006, vol. 6 N1, pp.
137-148.

62
[37] Y.Ozhigov, L.Fedichkin, Quantum Computer with Fixed
Interaction is Universal, JETP Lett. 77, 328-330 (2003)

[38] R. Penrose, The road to the reality, NY 2006.

[39] J. Sheneld, Mathematical Logic, Nauka, Moscow (1975).

[40] P.Shor, Polynomial-Time Algorithms for Prime Factor-

ization and Discrete Logarithms on a Quantum Com-
puter, SIAM J.Sci.Statist.Comput. 26 (1997) 1484-1512

[41] J.L. Andrade E Silva, J. Loshak, Fields, Particles, Quan-

ta. Moscow, Science, 1972.

[42] G.S.Tseitin, Algorithmic operators in the constructive

metric spaces, Doklady Academii Nauk USSR (rus),
1959, 128, N 1, pp.49-52.

[43] J.A. Wheeler and W.H. Zurek, Quantum Theory and

Measurement, Princeton UP, 1983

[44] Wolfram, S. Twenty Problems in the Theory of Cellular

Automata. Physica Scripta T9, 170-183, 1985.

[45] C. Zalka: Grover's quantum searching algorithm is opti-

mal. Phys. Rev. A 60 (1999) 27462751.

[46] V. Zarnitsyna , J.Huang , F.Zhang , Y.Chien ,

D.Leckband , C.Zhu , Memory in receptor ligand-
mediated cell adhesion, Proc Natl Acad Sci U S A. 2007
Nov 8.

[47] W.Zurek, Probabilities from entanglement, Born's rule

from invariance, Phys. Rev. A 71, 052105 (2005)

[48] ., .,
, .,, 1974.

63
[49] .., :
, . ,.15:..
. 2005, N.2. c .3-16.

[50] ..,
, , 175 1 (2005), . 3-39

[51] .., .. :
, -, , 2000.

[52] . , . , :
, , 1988, 43:6(264), 129166

[53] .. .
.: , 1981.

[54] .,
, ., , 1982.

[55] ..,

[56] .., .

[57] . . .
.  .: , 1973.

[58] .., .., .

, , , 1974.

[59] .., .., , .,

1988.

[60] .., ,
., , 1986.

[61] . .
, 175 413 (2005)

64
[62] ..,
..
, , 2006, . 176, 7, . 777-788

[63] . .
. .: . 1977

[64] ..
:
. , , 1988, 184 .

[65] .., ,
, - , 2003.

[66] ., , .,
, 1970.

[67] .., ,
1986, ., . , 1963, . 151, N3,
. 501-504.

[68] . , -.
, ., 1981.

[69] .., ?
., 1987.

[70] .. ,
, , 1960

[71] .., , .,
, 2008.

65