text:
# Quantum Pattern Recognition

## I Introduction

The power of quantum computation  is mostly associated with the speed-up in computing time it can provide with respect to its classical counterparts, the paramount examples being Shor’s factoring algorithm  and Grover’s search algorithm . There is, however, another aspect of quantum computation which represents a big improvement upon its classical counterpart . This leads to an exponential increase in a particular memory capacity rather than speed. In this paper I will review and expand the main aspects of this new application of quantum information theory. Further aspects of it can be found in .

In traditional computers the storage of information requires setting up a lookup table (RAM). The main disadvantage of this address-oriented memory system lies in its rigidity. Retrieval of information requires a precise knowledge of the memory address and, therefore, incomplete or corrupted inputs are not permitted.

This is definitely not how our own brain works. When trying to recognize a person from a blurred photo it is totally useless to know that it is the 17384th person you met in your life. Rather, the recognition process is based on our strong power of association with stored memories that resemble the given picture. Association is what we use every time we solve a crossword puzzle and is distinctive of the human brain.

Given the superior power of associative pattern recognition for complex tasks, the shortcomings of RAM memories were addressed by introducing models of associative (or content-addressable) memories . Here, recall of information is possible on the basis of partial knowledge of their content, without knowing the storage location. These are examples of collective computation on neural networks , the best known example being the Hopfield model  and its generalization to a bidirectional associative memory .

While these models solve the problem of recalling incomplete or noisy inputs, they suffer from a severe capacity shortage. Due to the phenomenon of crosstalk, which is essentially a manifestation of the spin glass transition  in the corresponding spin systems, the maximum number of binary patterns that can be stored in a Hopfield network of $`n`$ neurons is $`p_{max}0.14n`$  . While various possible improvements can be introduced , the maximum number of patterns remains linear in the number of neurons, $`p_{max}=O(n)`$.

Quantum mechanics offers a way out from the impossibility of reconciling the association power of content-addressable memories with the requirement of large storage capacity. Indeed, quantum mechanical entanglement provides a natural mechanism for both improving dramatically the storage capacity of associative memories and retrieving corrupted or incomplete information.

The basic idea is to store the given $`p`$ binary patterns of $`n`$ bits in a quantum superposition of the corresponding subset of the computational basis of $`n`$ qbits. The number of binary patterns that can be stored in such a quantum associative memory is exponential in the number $`n`$ of qbits, $`p_{max}=2^n`$, i.e. it is optimal in the sense that all binary patterns that can be formed with $`n`$ bits can be stored.

The basic idea of the information retrieval mechanism is very simple. Given an input pattern, the memory quantum state is rotated within the subspace defined by the stored patterns so that the resulting amplitudes are peaked on the stored patterns which are closest in Hamming distance to the input. A measurement of the rotated memory quantum state provides the output pattern.

An efficient way to perform this rotation is to embed the memory quantum state in a larger Hilbert space by adding $`b`$ control qbits. The full state is then rotated in the enlarged Hilbert space. After this rotation one is interested only in the projection of the rotated state onto a specific subspace of the enlarged Hilbert space. This projection can be obtained either by repeated measurement or by rotating the state (approximately) to the desired subspace using the amplitude amplification technique . Either way one has to repeat a certain algorithm a number of times and measure the control register to check if the desired projection has been obtained. The information retrieval mechanism is thus probabilistic, with postselection of the measurement result. This means that one has to repeat an algorithm until a threshold $`T`$ is reached or the measurement of a control register yields a given result. In the former case the input is not recognized. In the latter case, instead, the output is determined itself by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance to the input.

The accuracy of this information retrieval mechanism depends on the distribution of the stored patterns. Recognition efficiency is best when the number of stored patterns is very large while identification efficiency is best for isolated patterns which are very different from all other ones, both very intuitive features. Both efficiencies can be tuned to prescribed accuracy levels. The recognition efficiency can be varied by changing the threshold $`T`$: the higher $`T`$, the larger the number of qbits that can be corrupted without affecting recognition. The identification efficiency, instead, can be tuned by varying the number $`b`$ of control qbits in the memory. As we shall see, $`b=1/t`$ plays the role of an inverse effective temperature $`t`$. The lower $`t`$, the more concentrated is the corresponding effective Boltzmann distribution on the states closest (in Hamming distance) to the input and the better becomes the identification.

By averaging over the distribution of stored patterns one can eliminate the dependence on the stored pattern distribution and derive the effective statistical mechanics of quantum associative memories by introducing the usual thermodynamic potentials. In particular, the free energy $`F(t)`$ describes the average behaviour of the recall mechanism at temperature $`t`$ and provides concrete criteria to tune the accuracy of the associative memory. By increasing $`b`$ (lowering $`t`$), the associative memory undergoes a phase transition from a disordered phase with no correlation between input and output to an ordered phase with minimal Hamming distance bewteen the input and the output. This extends to quantum information theory the relation with Ising spin systems known in error-correcting codes  and in public key cryptography .

## II Storing Information

Let me start by describing the elementary quantum gates  that I will use in the rest of the paper. First of all there are the single-qbit gates represented by the Pauli matrices $`\sigma _i`$, $`i=1\mathrm{}3`$. The first Pauli matrix $`\sigma _1`$, in particular, implements the NOT gate. Another single-qbit gate is the Hadamard gate H, with the matrix representation

$$H=\frac{1}{\sqrt{2}}\left(\begin{array}{cc}1& 1\\ 1& 1\end{array}\right).$$
(1)
Then, I will use extensively the two-qbit XOR (exclusive OR) gate, which performs a NOT on the second qbit if and only if the first one is in state $`|1`$. In matrix notation this gate is represented as $`\mathrm{XOR}=\mathrm{diag}(1,\sigma _1)`$, where $`1`$ denotes a two-dimensional identity matrix and $`\sigma _1`$ acts on the components $`|01`$ and $`|11`$ of the Hilbert space. The 2XOR, or Toffoli gate is the three qbit generalization of the XOR gate: it performs a NOT on the third qbit if and only if the first two are both in state $`|1`$. In matrix notation it is given by $`2\mathrm{X}\mathrm{O}\mathrm{R}=\mathrm{diag}(1,1,\sigma _1)`$. In the storage algorithm I shall make use also of the nXOR generalization of these gates, in which there are n control qbits. This gate is also used in the subroutines implementing the oracles underlying Grover’s algorithm  and can be realized using unitary maps affecting only few qbits at a time , which makes it feasible. All these are standard gates. In addition to them I introduce the two-qbit controlled gates

$`CS^i`$ $`=|00|1+|11|S^i,`$ (2)
$`S^i`$ $`=\left(\begin{array}{cc}\sqrt{\frac{i1}{i}}& {\displaystyle \frac{1}{\sqrt{i}}}\hfill \\ {\displaystyle \frac{1}{\sqrt{i}}}\hfill & \sqrt{\frac{i1}{i}}\end{array}\right),`$ (3)
for $`i=1,\mathrm{},p`$. These have the matrix notation $`CS^i=\mathrm{diag}(1,S^i)`$. For all these gates I shall indicate by subscripts the qbits on which they are applied, the control qbits coming always first.

Given $`p`$ binary patterns $`p^i`$ of length $`n`$, it is not difficult to imagine how a quantum memory can store them. Indeed, such a memory is naturally provided by the following superposition of $`n`$ entangled qbits:

$$|m=\frac{1}{\sqrt{p}}\underset{i=1}{\overset{p}{}}|p^i.$$
(4)
The only real question is how to generate this state unitarily from a simple initial state of $`n`$ qbits. In  I presented an algorithm which achieves this by loading sequentially the classical patterns into an auxiliary quantum register from which they are then copied into the actual memory register. Here I will generalize this algorithm by constructing also the unitary operator which generates the memory state (4) directly from the state $`|0,\mathrm{},0`$.

Let me begin by reviewing the sequential algorithm of ref. . I shall use three registers: a first register $`p`$ of $`n`$ qbits in which I will subsequently feed the patterns $`p^i`$ to be stored, a utility register $`u`$ of two qbits prepared in state $`|01`$, and another register $`m`$ of $`n`$ qbits to hold the memory. This latter will be initially prepared in state $`|0_1,\mathrm{},0_n`$. The full initial quantum state is thus

$$|\psi _0^1=|p_1^1,\mathrm{}p_n^1;01;0_1,\mathrm{},0_n.$$
(5)
The idea of the storage algorithm is to separate this state into two terms, one corresponding to the already stored patterns, and another ready to process a new pattern. These two parts will be distinguished by the state of the second utility qbit $`u_2`$: $`|0`$ for the stored patterns and $`|1`$ for the processing term.

For each pattern $`p^i`$ to be stored one has to perform the operations described below:

$$|\psi _1^i=\underset{j=1}{\overset{n}{}}2XOR_{p_j^iu_2m_j}|\psi _0^i.$$
(6)
This simply copies pattern $`p^i`$ into the memory register of the processing term, identified by $`|u_2=|1`$.

$`|\psi _2^i`$ $`={\displaystyle \underset{j=1}{\overset{n}{}}}NOT_{m_j}XOR_{p_j^im_j}|\psi _1^i,`$ (7)
$`|\psi _3^i`$ $`=nXOR_{m_1\mathrm{}m_nu_1}|\psi _2^i.`$ (8)
The first of these operations makes all qbits of the memory register $`|1`$’s when the contents of the pattern and memory registers are identical, which is exactly the case only for the processing term. Together, these two operations change the first utility qbit $`u_1`$ of the processing term to a $`|1`$, leaving it unchanged for the stored patterns term.

$$|\psi _4^i=CS_{u_1u_2}^{p+1i}|\psi _3^i.$$
(9)
This is the central operation of the storing algorithm. It separates out the new pattern to be stored, already with the correct normalization factor.

$`|\psi _5^i`$ $`=nXOR_{m_1\mathrm{}m_nu_1}|\psi _4^i,`$ (10)
$`|\psi _6^i`$ $`={\displaystyle \underset{j=n}{\overset{1}{}}}XOR_{p_j^im_j}NOT_{m_j}|\psi _5^i.`$ (11)
These two operations are the inverse of eqs.(8) and restore the utility qbit $`u_1`$ and the memory register $`m`$ to their original values. After these operations on has

$$|\psi _6^i=\frac{1}{\sqrt{p}}\underset{k=1}{\overset{i}{}}|p^i;00;p^k+\sqrt{\frac{pi}{p}}|p^i;01;p^i.$$
(12)
With the last operation,

$$|\psi _7^i=\underset{j=n}{\overset{1}{}}2XOR_{p_j^iu_2m_j}|\psi _6^i,$$
(13)
one restores the third register $`m`$ of the processing term, the second term in eq.(12) above, to its initial value $`|0_1,\mathrm{},0_n`$. At this point one can load a new pattern into register $`p`$ and go through the same routine as just described. At the end of the whole process, the $`m`$-register is exactly in state $`|m`$, eq. (4).

Any quantum state can be generically obtained by a unitary transformation of the initial state $`|0,\mathrm{},0`$. This is true also for the memory state $`|m`$. In the following I will explicitly construct the unitary operator $`M`$ which implements the transformation $`|m=M|0,\mathrm{},0`$.

To this end I introduce first the single-qbit unitary gates

$$U_j^i=\mathrm{cos}\left(\frac{\pi }{2}p_j^i\right)1+i\mathrm{sin}\left(\frac{\pi }{2}p_j^i\right)\sigma _2,$$
(14)
where $`\sigma _2`$ is the second Pauli matrix. These operators are such that their product over the $`n`$ qbits generates pattern $`p^i`$ out of $`|0,\mathrm{},0`$:

$`|p^i`$ $`=P^i|0,\mathrm{},0,`$ (15)
$`P^i`$ $`{\displaystyle \underset{j=1}{\overset{n}{}}}U_j^i.`$ (16)
I now introduce, in addition to the memory register proper, the same two utility qbits as before, also initially in the state $`|0`$. The idea is, exactly as in the sequential algorithm, to split the state into two parts, a storage term with $`|u_2=|0`$ and a processing term with $`|u_2=|1`$. Therefore I generalize the operators $`P^i`$ defined above to

$$CP_{u_2}^i\underset{j=1}{\overset{n}{}}CU_{u_2j}^i,$$
(17)
which loads pattern $`p^i`$ into the memory register only for the processing term. It is then easy to check that

$`|m;00=M|0,\mathrm{},0;00,`$ (18)
$`M={\displaystyle \underset{i=1}{\overset{p}{}}}\left[\left(CP_{u_2}^i\right)^1NOT_{u_1}CS_{u_1u_2}^{p+1i}XOR_{u_2u_1}CP_{u_2}^i\right]\times `$ (19)
$`\times NOT_{u_2}.`$ (20)
The storage algorithm is thus efficient in the sense that the number $`p(2n+3)+1`$ of elementary one- and two-qbit gates needed to implement it, is linear in $`n`$ for fixed $`p`$. Note that, by construction, there are no restrictions on the loading factor $`p/n`$. However, the storage algorithm is efficient in an absolute sense only for $`p`$ polynomial in $`n`$.

## III Remembering

A memory is of real value only if it can be used repeatedly. This poses a problem since, as we shall see in the next section, an output of the memory is obtained by measuring the memory register and the rules of quantum mechanics imply that, when the memory register is measured, all the information about the entangled superposition of stored patterns is lost. If one does not want to forget everything after the first information retrieval one must therefore find a way to store the information for repeated use.

In quantum mechanics there are many choices to do this, since information can be stored, with various degrees of compression, both in quantum states and in unitary operators. The most compressed storage would be a quantum state: in this case up to $`2^n`$ patterns can be stored using only $`n`$ (quantum) degrees of freedom. To this end, however, one would have to keep a master copy of the memory and produce copies out of it when needed. Unfortunately, this is impossible since the linearity of quantum mechanics forbids exact universal cloning of quantum states . Universal cloning  has two disadvantages: first of all the copies to be used for information retrieval are imperfect, though optimal ; secondly, the quality of the master copy decreases with each recall, i.e. the memory is quickly washed out.

This leaves state-dependent cloning as the only viable option if one wants to store at least part of the information in a quantum state. State-dependent cloners are designed to reproduce only a finite number of states and this is definitely enough for our purposes. The simplest option in this setting is to use a probabilistic cloning machine . To this end it is sufficient to consider any dummy state $`|d`$ different from $`|m`$ (for more than two states the condition would be linear independence) and to construct a probabilistic cloning machine for these two states. This machine reproduces $`|m`$ with probability $`p_m`$ and $`|d`$ with probability $`p_d`$; a flag tells us exactly when the desired state $`|m`$ has been obtained. In order to obtain an exact copy of $`|m`$ one needs then $`1/p_m`$ trials on average. The master copy is exactly preserved.

The cloning efficiencies of the probabilistic cloner of two states are bounded as follows :

$$p_m+p_d\frac{2}{1+d|m}.$$
(21)
This bound can be made large by choosing $`|d`$ as nearly orthogonal to $`|m`$ as possible. A simple way to achieve this for a large number of patterns is to encode also the state

$$|d=\frac{1}{\sqrt{p}}\underset{i=1}{\overset{p}{}}(1)^{i+1}|p^i$$
(22)
together with $`|m`$ when storing information. This can be done simply by using alternately the operators $`S^i`$ and $`\left(S^i\right)^1`$ in the storing algorithm of section 2. For binary patterns which are all different from one another one has then

$`d|m`$ $`=0,p\mathrm{even},`$ (23)
$`d|m`$ $`={\displaystyle \frac{1}{p}},p\mathrm{odd},`$ (24)
and the bound for the cloning efficiencies is very close to its maximal value 2 in both cases.

The quantum network for the probabilistic cloner of two states has been developed in . It can be constructed exclusively out of the two simple distinguishability tranfer (D) and state separation (S) gates. Note that these gates embody information about the two states to be cloned. Part of the memory, therefore, actually resides in the cloning network, which is unavoidable if one wants to use a quantum memory repeatedly. This is then a mixed solution in which part of the information resides in a quantum state and another part in a unitary operator implemented as a probabilistic cloning network.

At the other end of the spectrum one can store the information about the $`p`$ patterns entirely in the unitary operator $`M`$ in eq.(20). Each time one needs to retrieve information one prepares then an initial quantum state $`|0,\mathrm{},0`$ and one transforms it into $`|m`$ by applying $`M`$ to it. In this case one needs $`pn`$ bits of information to store the $`p`$ patterns, exactly as in the classical Hopfield model. Indeed, this way of storing the patterns is very close in spirit to the Hopfield model since a unitary operator can always be represented as the exponential of a Hamiltonian operator, which is the quantum generalization of an energy functional. As I now show, however, in the quantum case there are no restrictions on the number of patterns that can be stored and retrieved.

## IV Retrieving Information

Assume now one is given a binary input $`i`$, which might be, e.g. a corrupted version of one of the patterns stored in the memory. The retrieval algorithm requires also three registers. The first register $`i`$ of n qbits contains the input pattern; the second register $`m`$, also of n qbits, contains the memory $`|m`$; finally there is a control register $`c`$ with $`b`$ qbits all initialized in the state $`|0`$.

The full initial quantum state is thus:

$$|\psi _0=\frac{1}{\sqrt{p}}\underset{k=1}{\overset{p}{}}|i;p^k;0_1,\mathrm{},0_b$$
(25)
where $`|i=|i_1,\mathrm{},i_n`$ denotes the input qbits, the second register, $`m`$, contains the memory (4) and all $`b`$ control qbits are in state $`|0`$. Applying the Hadamard gate to the first control qbit one obtains

$`|\psi _1`$ $`={\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}|i;p^k;0_1,\mathrm{},0_b`$ (27)
$`+{\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}|i;p^k;1_1,\mathrm{},0_b.`$
I now apply to this state the following combination of quantum gates:

$$|\psi _2=\underset{j=1}{\overset{n}{}}NOT_{m_j}XOR_{i_jm_j}|\psi _1,$$
(28)
As a result of the above operation the memory register qbits are in state $`|1`$ if $`i_j`$ and $`p_j^k`$ are identical and $`|0`$ otherwise:

$`|\psi _2`$ $`={\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}|i;d^k;0_1,\mathrm{},0_b`$ (30)
$`+{\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}|i;d^k;1_1,\mathrm{},0_b,`$
where $`d_j^k=1`$ if and only if $`i_j=p_j^k`$ and $`d_j^k=0`$ otherwise.

Consider now the following Hamiltonian:

$``$ $`=\left(d_H\right)_m\left(\sigma _3\right)_{c_1},`$ (31)
$`\left(d_H\right)_m`$ $`={\displaystyle \underset{j=1}{\overset{n}{}}}\left({\displaystyle \frac{\sigma _3+1}{2}}\right)_{m_j},`$ (32)
where $`\sigma _3`$ is the third Pauli matrix. $``$ measures the number of 0’s in register $`m`$, with a plus sign if $`c_1`$ is in state $`|0`$ and a minus sign if $`c_1`$ is in state $`|1`$. Given how I have prepared the state $`|\psi _2`$, this is nothing else than the number of qbits which are different in the input and memory registers $`i`$ and $`m`$. This quantity is called the Hamming distance and represents the (squared) Euclidean distance between two binary patterns.

Every term in the superposition (30) is an eigenstate of $``$ with a different eigenvalue. Applying thus the unitary operator $`\mathrm{exp}(i\pi /2n)`$ to $`|\psi _2`$ one obtains

$`|\psi _3`$ $`=\mathrm{e}^{i\frac{\pi }{2n}}|\psi _2,`$ (33)
$`|\psi _3`$ $`={\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}\mathrm{e}^{i\frac{\pi }{2n}d_H(i,p^k)}|i;d^k;0_1,\mathrm{},0_b`$ (35)
$`+{\displaystyle \frac{1}{\sqrt{2p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}\mathrm{e}^{i\frac{\pi }{2n}d_H(i,p^k)}|i;d^k;1_1,\mathrm{},0_b,`$
where $`d_H(i,p^k)`$ denotes the Hamming distance bewteen the input $`i`$ and the stored pattern $`p^k`$.

In the final step I restore the memory gate to the state $`|m`$ by applying the inverse transformation to eq. (28) and I apply the Hadamard gate to the control qbit $`c_1`$, thereby obtaining

$`|\psi _4`$ $`=H_{c_1}{\displaystyle \underset{j=n}{\overset{1}{}}}XOR_{i_jm_j}NOT_{m_j}|\psi _3,`$ (36)
$`|\psi _4`$ $`={\displaystyle \frac{1}{\sqrt{p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}\mathrm{cos}{\displaystyle \frac{\pi }{2n}}d_H(i,p^k)|i;p^k;0_1,\mathrm{},0_b`$ (38)
$`+{\displaystyle \frac{1}{\sqrt{p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}\mathrm{sin}{\displaystyle \frac{\pi }{2n}}d_H(i,p^k)|i;p^k;1_1,\mathrm{},0_b.`$
The idea is now to repeat the above operations sequentially for all $`b`$ control qbits $`c_1`$ to $`c_b`$. This gives

$`|\psi _{\mathrm{fin}}`$ $`={\displaystyle \frac{1}{\sqrt{p}}}{\displaystyle \underset{k=1}{\overset{p}{}}}{\displaystyle \underset{l=0}{\overset{b}{}}}\mathrm{cos}^{bl}\left({\displaystyle \frac{\pi }{2n}}d_H(i,p^k)\right)\times `$ (40)
$`\mathrm{sin}^l\left({\displaystyle \frac{\pi }{2n}}d_H(i,p^k)\right){\displaystyle \underset{\left\{J^l\right\}}{}}|i;p^k;J^l,`$
where $`\left\{J^l\right\}`$ denotes the set of all binary numbers of $`b`$ bits with exactly $`l`$ bits 1 and $`(bl)`$ bits 0.

As in the case of the storing algorithm, there is a version of the information retrieval algorithm in which the input is not loaded into an auxiliary quantum register but rather into a unitary operator. Indeed, the auxiliary quantum register is needed only by the operator (28) leading from (27) to (30). The same result (apart from an irrelevant overall sign) can be obtained by applying

$`I`$ $`={\displaystyle \underset{j=1}{\overset{n}{}}}U_j,`$ (41)
$`U_j`$ $`=\mathrm{sin}\left({\displaystyle \frac{\pi }{2}}i_j\right)1+i\mathrm{cos}\left({\displaystyle \frac{\pi }{2}}i_j\right)\sigma _2,`$ (42)
directly on the memory state $`|m`$. The rest of the algorithm is the same, apart the reversing of the operator (28) which needs now the operator $`I^1`$.

The end effect of the information retrieval algorithm represents a rotation of the memory quantum state in the enlarged Hilbert space obtained by adding $`b`$ control qbits. Note that the overall effect of this rotation is an overall amplitude concentration on memory states similar to the input if there is a large number of $`|0`$ control qbits and an amplitude concentration on states different to the input if there is a large number of $`|1`$ control qbits. As a consequence, the most interesting state for information retrieval purposes is the projection of $`|\psi _{\mathrm{fin}}`$ onto the subspace with all control qbits in state $`|0`$.

There are two ways of obtaining this projection. The first is to repeat the above algorithm and measure the control register several times, until exactly the desired state for the control register is obtained. If the number of such repetitions exceeds a preset threshold $`T`$ the input is classified as ”non-recognized” and the algorithm is stopped. Otherwise, once $`|c_1,\mathrm{},c_b=|0_1,\mathrm{},0_b`$ is obtained, one proceeds to a measurement of the memory register $`m`$, which yields the output pattern of the memory.

The second method is to apply $`T`$ steps of the amplitude amplification algorithm  rotating $`|\psi _{\mathrm{fin}}`$ towards its projection onto the ”good” subspace formed by the states with all control qbits in state $`|0`$. To this end it is best to use the versions of the storing and retrieving algorithms which do not need any auxiliary quantum register for inputs. Let me define as $`R(i)`$ the input-dependent operator which rotates the memory state in the Hilbert space enlarged by the $`b`$ control qbits towards the final state $`|\psi _{\mathrm{fin}}`$ in eq. (40) (where I now omit the auxiliary register for the input):

$$|\psi _{\mathrm{fin}}=R(i)|m;0_1,\mathrm{},0_b.$$
(43)
By adding also the two utility qbits needed for the storing algorithm one can then obtain $`|\psi _{\mathrm{fin}}`$ as a unitary transformation of the initial state with all qbits in state $`|0`$:

$$|\psi _{\mathrm{fin}};00=R(i)M|0,\mathrm{},0;0_1,\mathrm{},0_b;00.$$
(44)
The amplitude amplification rotation of $`|\psi _{\mathrm{fin}};00`$ towards its ”good” subspace in which all $`b`$ control qbits are in state $`|0`$ is then obtained  by repeated application of the operator

$$Q=R(i)MS_0M^1R^1(i)S$$
(45)
on the state $`|\psi _{\mathrm{fin}};00`$. Here $`S`$ conditionally changes the sign of the amplitude of the ”good” states with the $`b`$ control qbits in state $`|0`$, while $`S_0`$ changes the sign of the amplitude if and only if the state is the zero state $`|0,\mathrm{},0;0_1,\mathrm{},0_b;00`$. As before, if a measurement of the control register after the $`T`$ iterations of the amplitude amplification rotation yields $`|0_1,\mathrm{},0_b`$ one proceeds to a measurement of the memory register; otherwise the input is classified as ”non-recognized”.

Since the expected number of repetitions needed to measure the desired control register state is $`1/P_b^{\mathrm{rec}}`$, with

$$P_b^{\mathrm{rec}}=\frac{1}{p}\underset{k=1}{\overset{p}{}}\mathrm{cos}^{2b}\left(\frac{\pi }{2n}d_H(i;p^k)\right)$$
(46)
the probability of measuring $`|c_1,\mathrm{},c_n=|0_1,\mathrm{},0_n`$, the threshold $`T`$ governs the recognition efficiency of the input patterns. Note, however, that amplitude amplification provides a quadratic boost  to the recognition efficiency since only $`1/\sqrt{P_b^{\mathrm{rec}}}`$ steps are required to rotate $`|\psi _{\mathrm{fin}}`$ onto the desired subspace. Accordingly, the threshold $`T`$ can be lowered to $`\sqrt{T}`$ with respect to the method of projection by measurement.

Once the input pattern $`i`$ is recognized, the measurement of the memory register yields the stored pattern $`p^k`$ with probability

$`P_b\left(p^k\right)`$ $`={\displaystyle \frac{1}{Z}}\mathrm{cos}^{2b}\left({\displaystyle \frac{\pi }{2n}}d_H(i,p^k)\right),`$ (47)
$`Z`$ $`=pP_b^{\mathrm{rec}}={\displaystyle \underset{k=1}{\overset{p}{}}}\mathrm{cos}^{2b}\left({\displaystyle \frac{\pi }{2n}}d_H(i,p^k)\right).`$ (48)
Clearly, this probability is peaked around those patterns which have the smallest Hamming distance to the input. The highest probability of retrieval is thus realized for that pattern which is most similar to the input. This is always true, independently of the number of stored patterns. In particular there are never spurious memories: the probability of obtaining as output a non-stored pattern is always zero. As a consequence there are no restrictions on the loading factor $`p/n`$ coming from the information retrieval algorithm.

In addition to the threshold $`T`$, there is a second tunable parameter, namely the number $`b`$ of control qbits. This new parameter $`b`$ controls the identification efficiency of the quantum memory since, increasing $`b`$, the probability distribution $`P_b\left(p^k\right)`$ becomes more and more peaked on the low $`d_H(i,p^k)`$ states, until

$$\underset{b\mathrm{}}{lim}P_b\left(p^k\right)=\delta _{kk_{\mathrm{min}}},$$
(49)
where $`k_{\mathrm{min}}`$ is the index of the pattern (assumed unique for convenience) with the smallest Hamming distance to the input.

The probability of recognition is determined by comparing (even) powers of cosines and sines of the distances to the stored patterns. It is thus clear that the worst case for recognition is the situation in which there is an isolated pattern, with the remaining patterns forming a tight cluster spanning all the largest distances to the first one. As a consequence, the threshold needed to recognize all patterns diminishes when the number of stored patterns becomes very large, since, in this case, the distribution of patterns becomes necessarily more homogeneous. Indeed, for the maximal number of stored patterns $`p=2^n`$ one has $`P_b^{\mathrm{rec}}=1/2^b`$ and the recognition efficiency becomes also maximal, as it should be.

While the recognition efficiency depends on comparing powers of cosines and sines of the same distances in the distribution, the identification efficiency depends on comparing the (even) powers of cosines of the different distances in the distribution. Specifically, it is best when one of the distances is zero, while all others are as large as possible, such that the probability of retrieval is completely peaked on one pattern. As a consequence, the identification efficiency is best when the recognition efficiency is worst and viceversa.

The role of the parameter $`b`$ becomes familiar upon a closer examination of eq.( 47). Indeed, the quantum distribution described by this equation is equivalent to a canonical Boltzmann distribution with (dimensionless) temperature $`t=1/b`$ and (dimensionless) energy levels

$$E^k=2\mathrm{log}\mathrm{cos}\left(\frac{\pi }{2n}d_H(i,p^k)\right),$$
(50)
with $`Z`$ playing the role of the partition function.

The appearance of an effective thermal distribution suggests studying the average behaviour of quantum associative memories via the corresponding thermodynamic potentials. Before this can be done, however, one must deal with the different distributions of stored patterns characterizing each individual memory. To this end I propose to average also over this distribution, by keeping as a tunable parameter only the minimal Hamming distance $`d`$ between the input and the stored patterns. In doing so, one obtains an average description of the average memory. This is essentially the replica trick used to derive the behaviour of spin glasses  and classical Hopfield models .

As a first step it is useful to normalize the pattern representation by adding (modulo 2) to all patterns, input included, the input pattern $`i`$. This clearly preserves all Hamming distances and has the effect of normalizing the input to be the state with all qbits in state $`|0`$. The Hamming distance $`d_H(i,p^k)`$ becomes thus simply the number of qbits in pattern $`p^k`$ with value $`|1`$. For loading factors $`p/n0`$ in the limit $`n\mathrm{}`$ the partition function for the average memory takes then a particularly simple form:

$$Z_{\mathrm{av}}=\frac{p}{N_\lambda }\underset{\{\lambda \}}{}\underset{j=d}{\overset{n}{}}\lambda _j\mathrm{cos}^{2b}\left(\frac{\pi }{2}\frac{j}{n}\right),$$
(51)
where $`\lambda _j`$ describes an unconstrained probability distribution such that $`_{j=d}^n\lambda _j=1`$, $`\{\lambda \}`$ is the set of such distributions and $`N_\lambda `$ the corresponding normalization factor. For finite loading factors, instead, the probabilities $`\lambda _j`$ become subject to constraints which make things more complicated.

I now introduce the free energy $`F(b,d)`$ by the usual definition

$$Z_{\mathrm{av}}=p\mathrm{e}^{bF(b,d)}=Z_{\mathrm{av}}(b=0)\mathrm{e}^{bF(b,d)},$$
(52)
where I have chosen a normalization such that $`\mathrm{exp}(bF)`$ describes the deviation of the partition function from its value for $`b=0`$ (high effective temperature). Since $`Z/p`$, and consequently also $`Z_{\mathrm{av}}/p`$ posses a finite, non-vanishing large-$`n`$ limit, this normalization ensures that $`F(b,d)`$ is intensive, exactly like the energy levels (50), and scales as a constant for large $`n`$. This is the only difference with respect to the familiar situation in statistical mechanics.

The free energy describes the equilibrium of the system at effective temperature $`t=1/b`$ and has the usual expression in terms of the internal energy $`U`$ and the entropy $`S`$:

$`F(t,d)`$ $`=U(t,d)tS(t,d),`$ (53)
$`U(t,d)`$ $`=E_t,S(t,d)={\displaystyle \frac{F(t,d)}{t}}.`$ (54)
Note that, with the normalization I have chosen in (52), the entropy $`S`$ is always a negative quantity describing the deviation from its maximal value $`S_{\mathrm{max}}=0`$ at $`t=\mathrm{}`$.

By inverting eq.(50) with $`F`$ substituting $`E`$ one can also define an effective (relative) input/output Hamming distance $`𝒟`$ at temperature $`t`$:

$$𝒟(t,d)=\frac{2}{\pi }\mathrm{arccos}\mathrm{e}^{\frac{F(t,d)}{2}}.$$
(55)
This corresponds exactly to representing the recognition probability of the average memory as

$$\left(P_b^{\mathrm{rec}}\right)_{\mathrm{av}}=\mathrm{cos}^{2b}\left(\frac{\pi }{2}𝒟(b,d)\right),$$
(56)
which can also be taken as the primary definition of the effective Hamming distance.

The function $`𝒟(b,d)`$ provides a complete description of the behaviour of quantum associative memories in the limit $`p/n1`$. This can be used to tune their performance. Indeed, suppose that one wants the memory to recognize and identify inputs with up to $`ϵn`$ corrupted inputs with an efficiency of $`\nu `$ $`(0\nu 1)`$. Then one must choose a number $`b`$ of control qbits sufficiently large that $`\left(𝒟(b,ϵn)ϵ\right)\left(1\nu \right)`$ and a threshold $`T`$ of repetitions satisfying $`T1/\mathrm{cos}^{2b}\left(\frac{\pi }{2}𝒟(b,ϵn)\right)`$, as illustrated in Fig. 1 below.

A first hint about the general behaviour of the effective distance function $`𝒟(b,d)`$ can be obtained by examining closer the energy eigenvalues (50). For small Hamming distance to the input these reduce to

$$E^k\frac{\pi ^2}{4}\left(\frac{d_H(i,p^k)}{n}\right)^2,\frac{d_H(i,p^k)}{n}1.$$
(57)
Choosing again the normalization in which $`|i=|0\mathrm{}0`$ and introducing a “spin” $`s_i^k`$ with value $`s_i^k=1/2`$ if qbit $`i`$ in pattern $`p^k`$ has value $`|0`$ and $`s_i^k=+1/2`$ if qbit $`i`$ in pattern $`p^k`$ has value $`|1`$, one can express the energy levels for $`d_H/n1`$ as

$$E^k=\frac{\pi ^2}{16}+\frac{\pi ^2}{4n^2}\underset{i,j}{}s_i^ks_j^k+\frac{\pi ^2}{4n}\underset{i}{}s_i^k.$$
(58)
Apart from a constant, this is the Hamiltonian of an infinite-range antiferromagnetic Ising model in presence of a magnetic field. The antiferromagnetic term favours configurations $`k`$ with half the spins up and half down, so that $`s_{\mathrm{tot}}^k=_is_i^k=0`$, giving $`E^k=\pi ^2/16`$.The magnetic field, however, tends to align the spins so that $`s_{\mathrm{tot}}^k=n/2`$, giving $`E^k=0`$. Since this is lower than $`\pi ^2/16`$, the ground state configuration is ferromagnetic, with all qbits having value $`|0`$. At very low temperature (high $`b`$), where the energy term dominates the free energy, one expects thus an ordered phase of the quantum associative memory with $`𝒟(t,d)=d/n`$. This corresponds to a perfect identification of the presented input. As the temperature is raised ($`b`$ decreased) however, the thermal energy embodied by the entropy term in the free energy begins to counteract the magnetic field. At very high temperatures (low $`b`$) the entropy approaches its maximal value $`S(t=\mathrm{})=0`$ (with the normalization chosen here). If this value is approached faster than $`1/t`$, the free energy will again be dominated by the internal energy . In this case, however, this is not any more determined by the ground state but rather equally distributed on all possible states, giving

$`F(t=\mathrm{})`$ $`=U(t=\mathrm{})={\displaystyle \frac{1}{1\frac{d}{n}}}{\displaystyle _{\frac{d}{n}}^1}𝑑x2\mathrm{log}\mathrm{cos}\left({\displaystyle \frac{\pi }{2}}x\right)`$ (60)
$`=\left(1+{\displaystyle \frac{d}{n}}\right)2\mathrm{log2}+O\left(\left({\displaystyle \frac{d}{n}}\right)^2\right),`$
and leading to an effective distance

$$𝒟(t=\mathrm{},d)=\frac{2}{3}\frac{2\mathrm{log2}}{\pi \sqrt{3}}\frac{d}{n}+O\left(\left(\frac{d}{n}\right)^2\right).$$
(61)
This value corresponds to a disordered phase with no correlation between input and output of the memory.

A numerical study of the thermodynamic potentials in (54) and (55) indeed confirms a phase transition from the ordered to the disordered phase as the effective temperature is raised. In Fig. 1 I show the effective distance $`𝒟`$ and the entropy $`S`$ for 1 Mb ($`n=8\times 10^6`$) patterns and $`d/n=1\%`$ as a function of the inverse temperature $`b`$ (the entropy is rescaled to the interval  for ease of presentation). At high temperature there is indeed a disordered phase with $`S=S_{\mathrm{max}}=0`$ and $`𝒟=2/3`$. At low temperatures, instead, one is in the ordered phase with $`S=S_{\mathrm{min}}`$ and $`𝒟=d/n=0.01`$. The effective Hamming distance plays thus the role of the order parameter for the phase transition.

The phase transition occurs at $`b_{\mathrm{cr}}10^1`$. The physical regime of the quantum associative memory ($`b`$ = positive integer) begins thus just above this transition. For a good accuracy of pattern recognition one should choose a temperature low enough to be well into the ordered phase.

Having described at length the information retrieval mechanism for complete, but possibly corrupted patterns, it is easy to incorporate also incomplete ones. To this end assume that only $`q<n`$ qbits of the input are known and let me denote these by the indices $`\{k1,\mathrm{},kq\}`$. After assigning the remaining qbits randomly, there are two possibilities. One can just treat the resulting complete input as a noisy one and proceed as above or, better, one can limit the operator $`\left(d_H\right)_m`$ in the Hamiltonian (32) to

$$\left(d_H\right)_m=\underset{i=1}{\overset{q}{}}\left(\frac{\sigma _3+1}{2}\right)_{m_{ki}},$$
(62)
so that the Hamming distances to the stored patterns are computed on the basis of the known qbits only. After this the pattern recall process continues exactly as described above. This second possibility has the advantage that it does not introduce random noise in the similarity measure but it has the disadvantage that the operations of the memory have to be adjusted to the inputs.

## V Efficiency, complexity and memory tuning

As anticipated in section 4, the effective i/o Hamming distance can be used to tune the quantum associative memory to prescribed accuracy levels. Typically, it is to be expected that increasing this accuracy will lead to an enhanced complexity level. Before I even begin addressing this issue, however, I will show that the information retrieval algorithm is efficient.

First of all I would like to point out that, in addition to the standard NOT, H (Hadamard), XOR, 2XOR (Toffoli) and nXOR gates  I have introduced only the two-qbit gates $`CS^i`$ in eq. (3) and the unitary operator $`\mathrm{exp}\left(i\pi /2n\right)`$. This latter can, however also be realized by simple gates involving only one or two qbits. To this end I introduce the single-qbit gate

$$U=\left(\begin{array}{cc}\mathrm{e}^{i\frac{\pi }{2n}}& 0\\ 0& 1\end{array}\right),$$
(63)
and the two-qbit controlled gate

$$CU^2=|00|1+|11|U^2.$$
(64)
It is then easy to check that $`\mathrm{exp}\left(i\pi /2n\right)`$ in eq. (30) can be realized as follows:

$$\mathrm{e}^{i\frac{\pi }{2n}}|\psi _2=\underset{i=1}{\overset{n}{}}\left(CU^2\right)_{cm_i}\underset{j=1}{\overset{n}{}}U_{m_j}|\psi _2,$$
(65)
where $`c`$ is the control qbit for which one is currently repeating the algorithm. Essentially, this means that one implements first $`\mathrm{exp}\left(i\pi d_H/2n\right)`$ and then one corrects by implementing $`\mathrm{exp}\left(i\pi d_H/n\right)`$ on that part of the quantum state for which the control qbit $`|c`$ is in state $`|1`$.

Using this representation for the Hamming distance operator one can count the total number of simple gates that one must apply in order to implement one step of the information retrieval algorithm. This is given by $`(6n+2)`$ using the auxiliary register for the input and by $`(4n+2)`$ otherwise. This retrieval step has then to be repeated for each of the $`b`$ control qbits. Therefore, implementing the projection by repeated measurements, the overall complexity $`C`$ of information retrieval is bounded by

$$CTb(6n+2)C_{\mathrm{clon}},$$
(66)
where $`C_{\mathrm{clon}}`$ is the complexity of the (probabilistic) cloning machine that prepares a copy of the memory state.

The computation of the complexity is easier for the information retrieval algorithm which uses the amplitude amplification technique. In this case the initial memory is prepared only once by a product of the operators $`M`$, with complexity $`p(2n+3)+1`$ and $`R(i)`$, with complexity $`b(4n+2)`$. Then one applies $`T`$ times the operator $`Q`$, with complexity $`p(4n+6)+b(8n+4)+2+C_S+C_{S_0}`$, where $`C_S`$ and $`C_{S_0}`$ are the polynomial complexities of the oracles implementing $`S`$ and $`S_0`$. This gives

$`C`$ $`=T\left[p(4n+6)+b(8n+4)+2+C_S+C_{S_0}\right]+`$ (68)
$`+p(2n+3)+b(4n+2)+1.`$
As expected, this result depends on both $`T`$ and $`b`$, the parameters governing the recognition and identification efficiencies. This represents exactly the unavoidable tradeoff between accuracy and complexity.

Suppose now one would like to recognize on average inputs with up to 1% of corrupted or missing bits and identify them with high accuracy. The effective i/o Hamming distance $`𝒟`$ shown in Fig. 1 can then be used to determine the values of the required parameters $`T`$ and $`b`$ needed to reach this accuracy for the average memory with $`p/n1`$. For $`b=10^4`$ e.g., one has $`𝒟=0.018`$, which gives the average i/o distance (in percent of total qbits) if the minimum possible i/o distance is 0.01. For this value of $`b`$ the recognition probability is $`\mathrm{1.5\; 10}^4`$. With the measurement repetition technique one should thus set the threshold $`T=\mathrm{0.6\; 10}^4`$. Using amplitude amplification, however, one needs only around $`T=80`$ repetitions.

I would like to conclude by stressing that the values of $`b`$ and $`T`$ obtained by tuning the memory with the effective i/o Hamming distance become $`n`$-independent for large values of $`n`$. This is because they are intensive variables unaffected by this ”thermodynamic limit”. For any $`p`$ polynomial in $`n`$ the information retrieval can then be implemented efficiently and the overall complexity is determined by the accuracy requirements via the n-independent parameters $`T`$ and $`b`$.

## VI Conclusion

I would like to conclude this review by stressing the reason why a quantum associative memory works better than its classical counterpart.

In classical associative memories, the information about the patterns to recall is typically stored in an energy functional. When retrieving information, the input configuration evolves to the corresponding output, driven by the memory functional. The capacity shortage is due to a phase transition in the statistical ensemble governed by the memory energy functional. Spurious memories, i.e. spurious metastable minima not associated with any of the original patterns become important for loading factors $`p/n>0.14`$ and wash out completely the memory. So, in the low $`p/n`$ phase the memory works perfectly in the sense that it outputs always the stored pattern which is most similar to the input. For $`p/n>0.14`$, instead, there is an abrupt transition to total amnesia caused by spurious memories.

Quantum associative memories work better than classical ones since they are free from spurious memories. The easiest way to see this is in the formulation

$$|m=M|0.$$
(69)
All the information about the stored patterns is encoded in the unitary operator $`M`$. This is such that all quantum states that do not correspond to stored patterns have exactly vanishing amplitudes.

An analogy with the classical Hopfield model  can be established as follows. Instead of generating the memory state from the initial zero state one can start from a uniform superposition of the computational basis. This is achieved by the operator $`MW`$ defined by

$`|m`$ $`=MW{\displaystyle \frac{1}{\sqrt{2^n}}}{\displaystyle \underset{j=0}{\overset{2^n1}{}}}|j,`$ (70)
$`W`$ $`{\displaystyle \underset{j=1}{\overset{n}{}}}H_j.`$ (71)
Now, the same result can also be obtained by Grover’s algorithm, or better by its generalization with zero failure rate . Here the state $`|m`$ is obtained by applying to the uniform superposition of the computational basis q times the search operator $`X`$ defined by

$`|m`$ $`=X^q{\displaystyle \frac{1}{\sqrt{2^n}}}{\displaystyle \underset{j=0}{\overset{2^n1}{}}}|j,`$ (72)
$`X`$ $`WJ_0WJ,`$ (73)
where $`J`$ rotates the amplitudes of the states corresponding to the patterns to be stored by a phase $`\varphi `$ which is very close to $`\pi `$ (the original Grover value) for large $`n`$ and $`J_0`$ does the same on the zero state. Via the two equations (71) and (73), the memory operator $`M`$ provides an implicit realization of the phase shift operator $`J`$. Being a unitary operator, this can always be written as an exponential of an hermitian Hamiltonian $``$, which is the quantum generalization of a classical energy functional. By defining $`J\mathrm{exp}(i)`$ one obtains an energy operator which is diagonal in the computational basis. The energy eigenvalues of this operator are such that the patterns to be stored have energy $`E=\varphi \pi `$ while all others have energy $`E=0`$. This formulation is the exact quantum generalization of the Hopfield model; the important point is that the operator $`M`$ realizes efficiently a dynamics in which the patterns to be stored are always, for all numbers $`p`$ of patterns, the exact global minima of a quantum energy landscape, without the appearance of any spurious memories. The price to pay is the probabilistic nature of the information retrieval mechanism. As always in quantum mechanics, the dynamics determines only the evolution of probability distributions and the probabilistic aspect is brought in by the collapse of this probability distributions upon measurement. Therefore, contrary to the classical Hopfield model in the low $`p/n`$ phase, one does not always have the absolute guarantee that an input is recognized, and identified correctly as the stored pattern most similar to the input, even if this state has the highest probability of being measured. But, after all, the same happens also to the human brain.


format: text

text:
# PHYSICAL INTERPRETATION OF THE MATHEMATICAL CONSEQUENCE OF LORENTZ’ TRANSFORMATIONS

## Abstract

A physical interpretation of the mathematical consequence of Lorentz transformation within spatial relativity theory is presented as a result of my new physical model of existent fluctuating vacuum (FlcVcm). It is assumed that the FlcVcm is considered as molecular dielectric, which consists from neutral dynamides, streamlined in a close-packed crystalline lattice. Every dynamide is a neutral pair, consistent by two massless opposite point-like elementary electric charges (ElmElcChrgs): electrino (-) and positrino (+). In a frozen equilibrium position two contrary pont-like ElmElcChrgs within every one dynamide are very closely installed one to another and therefore the aggregate polarization of every dynamide and its electric field also have zero values. The aggregate electric field of every dynamide polarizes nearest neighbors dynamides in an account of which nearest dynamides interact between them-self, because of which their elementary excitations, phonons and photons, have a wave character and behaviors. We suppose that the photon is an polarization result of the phonon within the fluctuating vacuum considered as an ideal dielectric and therefore the photon could be considered as an elementary collective excitation of the FlcVcm in the form of a solitary needle cylindrical harmonic oscillation. Hence the light, which is a packet of the photons, must move within FlcVcm with constant velocity and Dopler effect must be observed in both cases, for the light and sound. Then all mathematical results of Lorentz transformation could be considered as results of a demand of an independence of the observation results from the reactive velocity of the observation frame.

A physical model (PhsMdl) of the existent fluctuating vacuum (FlcVcm) and its elementary excitations phonon and photon as a solitary needle cylindrical harmonic oscillation of its polarized molecular crystal lattice is offered. It is common known that the physical model (PhsMdl) presents at us as an actual ingredient of every good physical theory (PhsThr). It would be used as for an obvious visual teaching the unknown occurred physical processes within the investigated phenomena. We assume that the FlcVcm could be considered as a molecular crystal, which is consistent by neutral dynamides, streamlined in some close-packed crystalline lattice. Every dynamide is a massless neutral pair, consistent by two massless opposite point-like (PntLk) elementary electric charges (ElmElcChrgs): electrino (-) and positrino (+). In a frozen equilibrium position both opposite PntLk ElmElcChrgs within every dynamide are very closely installed one to another and therefore the aggregate polarization of every one dynamide has zero value and its electric field (ElcFld) also has zero electric intensity (ElcInt). However the absence of a mass in a rest of the electrino and positrino makes them possible to have a big mobility and infinitesimal dynamical inertness of its own QntElcMgnFld, what permits them to be found a bigger time in an unequillibrium distorted position. The aggregate ElcFld of the dynamide reminds us that it could be considered as the QntElcFld of an electric quasi-dipole moment (ElcQusDplMmn) because both opportunity massless electrino and positrino have the same inertness. For a certain that is why the FlcVcm dos not radiate real photon (RlPhtn) by itself, as a dynamide electric dipole moment (ElcDplMmn) has a zero value. The aggregate ElcFld of every dynamide polarizes nearest neighbors dynamides in an account of which nearest dynamides interact between itself, and in a result of which its elementary collective excitations have a wave character and behavior. It is richly clear that the motions in the opposite direction of both opposite PntLk ElmElcChrgs of an every dynamide creates an aggregate magnetic field (MgnFld) of every one and the sum of which makes a magnetic part of the free QntElcMgnFld.

Although up to the present nobody of scientists distinctly knows are there some elementary micro particles (ElmMicrPrts) as a fundamental building stone of the micro world and what the elementary micro particle (ElmMicrPrt) means, there exists an essential possibility for physical clear and scientific obvious consideration of the uncommon quantum behavior and unusual dynamical relativistic parameters of all relativistic quantized MicrPrts (QntMicrPrts) by means of our convincing and transparent surveyed PhsMdl. We suppose that the photon is some elementary excitation of the FlcVcm in the form of a solitary needle cylindrical harmonic oscillation. The deviations of both PntLk massless opportunity ElmElcChrgs of an every dynamide from their equilibrium position in the vacuum close-packed crystalline lattice creates its own polarization, the sum of which creates total polarization of the FlcVcm as a ideal dielectric, which causes the existence of a total resultant QntElcFld. Consequently the total polarization of all dynamides creates own resultant QntElcFld, which is an electric part of the free QntElcMgnFld. Really, if the deviation of an every PntLk ElmElcChrg within every one dynamide from its own equilibrium position is described by dint of formula of collective oscillations (RlPhtns) of connected oscillators in a representation of second quantization:

$$u_j(r)=\frac{1}{\sqrt{N}}\underset{q}{}\sqrt{\frac{\mathrm{}}{2\mathrm{\Theta }\omega }}I_{jq}\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(1)
where $`\mathrm{\Theta }`$ is an inertial mass of the electrino and positrino and $`I_{jq}`$ are vector components of the deviation (polarization). If we multiply the deviation u of every PntLk ElmElcChrg in every dynamide by the twofold ElmElcChrg value e and dynamide density $`W=\frac{1}{\mathrm{\Omega }_o}`$, then we could obtain in a result the total polarization value of the FlcVcm within a representation of the second quantization :

$$P_j(r)=\frac{2e}{\mathrm{\Omega }_o\sqrt{N}}\underset{q}{}\sqrt{\frac{\mathrm{}}{2\mathrm{\Theta }\omega }}I_{jq}\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(2)
Further we must note that the change of the spring with an elasticity $`\chi `$ between the MicrPrt and its equilibrium position, oscillating with a circular frequency $`\omega `$ by two springs with an elasticity $`\stackrel{~}{\chi }`$ between two MicrPrts, having opportunity ElmElcChrgs and oscillating with a circular frequency $`\stackrel{~}{\omega }`$ within one dynamide, is accompanied by a relation $`\mathrm{\hspace{0.17em}2}\stackrel{~}{\chi }\chi `$. Indeed, if the ,,masses” of the oscillating as unharmed dynamide is twice the ,,mass” of the electrino or positrino, but the elasticity of the spring between every two neighbor dynamides in crystalline lattice is fourfold more the elasticity of the spring between two the MicrPrts, having opportunity ElmElcChrgs and oscillating one relatively other within one dynamide, while the common ,,mass” of two the MicrPrts, having opportunity ElmElcChrgs and oscillating one relatively other within one dynamide is half of the ,,mass” of the electrino or positrino. Therefore the circular frequency $`\omega `$ of the collective oscillations have well known relation with the Qoulomb potential of the electric interaction (ElcInt) between two opportunity massless PntLk ElmElcChrgs electrino and positrino and their dynamical inertial ,,masses” which can be described by dint of the equations :

$$\stackrel{~}{\omega }^2=2\frac{\stackrel{~}{\chi }}{\mathrm{\Theta }}\mathrm{a}nd\omega ^2=\frac{4\chi }{2\mathrm{\Theta }}\mathrm{c}onsequently\omega ^2=\mathrm{\hspace{0.17em}2}\stackrel{~}{\omega }^2$$
(3)
$$\mathrm{a}nd\mathrm{t}herefore\mathrm{\Theta }\omega ^2=\frac{4e^2}{4\pi \mathrm{\Omega }_o\epsilon _o}\mathrm{o}r\mathrm{\Theta }C^2=\frac{e^2}{4\pi \mathrm{\Omega }_oq^2\epsilon _o}$$
(4)
where

$$N\mathrm{\Omega }_o=\mathrm{\Omega }\mathrm{a}ndd=WeE\mathrm{o}rE=\frac{d}{\mathrm{\Omega }_o\epsilon _o}=\frac{P}{\epsilon _o}$$
(5)
we could obtain an expression for the ElcInt of the QntElcMgnFld, well known from classical electrodynamics (ClsElcDnm) in a representation of the second quantization:

$$E_j(r)=\underset{q}{}\sqrt{\frac{2\pi \mathrm{}\omega }{\mathrm{\Omega }\epsilon _o}}I_{jq}\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(6)
By dint of a common known defining equality :

$$E_j=\frac{A_j}{t}$$
(7)
From (7) we could obtain the expression for the vector-potential A of the QntElcMgnFld in the vacuum in a representation of the second quantization :

$$A_j(r)=i\underset{q}{}\sqrt{\frac{2\pi \mathrm{}}{\mathrm{\Omega }\omega \epsilon _o}}I_{jq}\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(8)
or

$$A_j(r)=i\underset{q}{}\sqrt{\frac{2\pi \mathrm{}\omega \mu _o}{\mathrm{\Omega }q^2}}I_{jq}\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(9)
Further by dint of the defining equality $`\mu _oH=rotA`$ from (8) and (9) we could obtain an expression for the MgnInt of QntElcMgnFld, well known from ClsElcDnm in a representation of the second quantization:

$$H_j(r)=\underset{q}{}\sqrt{\frac{2\pi \mathrm{}\omega }{\mathrm{\Omega }\mu _o}}\left[\stackrel{}{n}_q\times I_{lq}\right]_j\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\right\}$$
(10)
where $`\stackrel{}{n}_k`$ is unit vector, determining the motion direction of the free QntElcMgnFld. The reception of known expressions for the ElcInt and MgnInt values of the QntElcMgnFld by dint of a simple transformation of an expression, describing deviation of two PntLk ElmElcChrgs of distorted dynamides into the ideal dielectric of the FlcVcm proves obviously and scientifically the true of our assumption about the dipole structure of the vacuum and about the creation way of its collective oscillation - RlPhtn. The existence of a possibility for a creation of virtual photons (VrtPhtns) as an polarized excitation within the fluctuating vacuum (FlcVcm) renders an essential influence over the motion of a electric charged or magnetized micro particles (MicrPrts) by means of its EntElcMgnFld. The existence of a free energy in the form of micro particles (MicrPrts) can break of the connection between pair contrary PntLk ElmElcChrgs of one dynamide and to excite pair of two opposite charged MicrPrts at once.

By means of presentation (10) of MgnInt $`H_j(r)`$ and taking into consideration that $`\stackrel{}{n}_q`$ is always perpendicular to the vector of the polarization $`I_{jq}`$ we obtain that :

$$\left[\stackrel{}{v}\times \left[\stackrel{}{n}_q\times I_{jq}\right]\right]=\stackrel{}{n}_q(\stackrel{}{v}I_{jq})I_{jq}(\stackrel{}{v}\stackrel{}{n}_q)$$
(11)
From this equation (11) we could understand that if the velocity $`v`$ of the interacting ElcChrg is parallel of the direction $`\stackrel{}{n}_q`$ of the motion of the free QntElcMgnFld, then the first term in the equation (11) will been nullified and the second term in the equation (11) will determine the force, which will act upon this interacting ElcChrg. But when the velocity $`\stackrel{}{v}`$ of the interacting ElcChrg is parallel of the direction $`I_{jq}`$ of the motion in the opposite directions of two PntLk ElmElcChrg of the electrino and positrino and one is a perpendicular to the direction $`\stackrel{}{n_q}`$ of the motion of a free QntElcMgnFld, then the second term in the equation (11) will be nullified and the first term in the equation (11) will describe the force, which acts upon this interacting PntLk ElmElcChrg. It turns out that the interaction between currents of the electrino and positrino, which is parallel to the vector of a polarization $`I_{jq}`$ as $`(\stackrel{}{v}_j=\frac{\omega }{\pi }\stackrel{}{I}_{jq})`$, with the QntMgnFld of the free QntElcMgnFld determines the motion and its velocity of same this free QntElcMgnFld. Indeed, it is well known that the change of a magnetic flow $`\mathrm{\Phi }`$ creates a ElcFld. Therefore by dint of a relation (11) we can obtain the following relation :

$`F_j={\displaystyle \frac{e}{C}}\left[\stackrel{}{v}\times \stackrel{}{H}\right]={\displaystyle \frac{e}{mC\omega }}\left[\stackrel{}{E}\times \stackrel{}{H}\right]={\displaystyle \underset{q}{}}{\displaystyle \frac{e^2}{mC}}\sqrt{{\displaystyle \frac{2\pi \mathrm{}}{\mathrm{\Omega }\epsilon _o}}}\sqrt{{\displaystyle \frac{2\pi \mathrm{}}{\mathrm{\Omega }\mu _o}}}ϵ_{jkl}\stackrel{}{n}_j(\stackrel{}{I}_{kq}\stackrel{}{I}_{lq})`$
$`\left\{a_{kq}^+\mathrm{exp}i(\omega tqr)+a_{kq}\mathrm{exp}i(\omega tqr)\right\}\left\{a_{kq}^+\mathrm{exp}i(\omega tqr)a_{kq}\mathrm{exp}i(\omega tqr)\right\}`$ (12)
Therefore by dint of (PHYSICAL INTERPRETATION OF THE MATHEMATICAL  CONSEQUENCE OF LORENTZ’ TRANSFORMATIONS) and defining equations (6) and (9) we can obtain:

$$\frac{1}{\sqrt{\epsilon \epsilon _o}}=v\sqrt{\mu \mu _o}\mathrm{o}r\mathrm{a}t\frac{1}{\sqrt{\epsilon _o}}=C\sqrt{\mu _o}\mathrm{w}ehaveC=v.\sqrt{\epsilon \mu }.$$
(13)
It is naturally that when some RlPhtn is moving within the space of some substance, then supplementary polarization of atoms and molecules appears , which delay its moving and slow down its velocity. Indeed in this case the dielectric constant $`\epsilon `$ has a following form:

$$\epsilon =1+\underset{q}{}\frac{4\pi n(q)[\omega (q)\omega _c]}{\left[m\{4(\omega (q)\omega _c)^2+\tau ^2\omega (q)^4\}\right]}$$
(14)
By means of the upper scientific investigation we understand that the creation of the QntMgnFld by moving oposete PntLk ElmElcChrgs of electrinos and positrinos within all dynamides together with their aggregate QntElcFld as two components of one free QntElcMgnFld one secures their motion. Therefore we should write the momentum of the free QntElcMgnFld by means of the equation of Pointing/Umov, using the definition equations (6) and (10) :

$`P={\displaystyle \frac{\left[E\times H\right]}{4\pi C^2}}={\displaystyle \underset{q}{}}\stackrel{}{n}_q{\displaystyle \frac{\mathrm{}\omega }{2\mathrm{\Omega }\sqrt{\epsilon _o\mu _o}}}(I_{jq}I_{jq})`$
$`\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\}\times `$
$`\left\{a_{jq}^+\mathrm{exp}i(\omega tqr)+a_{jq}\mathrm{exp}i(\omega tqr)\right\}`$ (15)
or

$$P=\underset{q}{}\stackrel{}{n}_q\frac{\mathrm{}\omega }{2\mathrm{\Omega }C}\left\{a_{jq}^+a_{jq}+a_{jq}a_{jq}^++a_{jq}^+a_{jq}^+\mathrm{exp}2i(\omega tqr)+a_{jq}a_{jq}\mathrm{exp}2i(\omega tqr)\right\}$$
(16)
or

$$\overline{P}=\underset{q}{}\stackrel{}{n}_q\frac{\mathrm{}\omega }{\mathrm{\Omega }C}(n_q+1/2)$$
(17)
It is well known that the ElmMicrPrts behavior would be studied by means of an investigation of their behaviors after their interaction by already well known ElmMicrPrts. Therefore we shall describe the properties and behavior of the real photon (RlPhtn) by means of a new physical interpretation of results of its emission and absorption from atoms at their excitatived Schrodinger electrons (SchEls) from higher energetic state into lower energetic state or vice versa transition. In such a way we could understand the origin of some their name by dint of the physical understanding these determining processes.

In a first we begin by supposing that the RlPhtn has a form of a solitary needle cylindrical harmonic soliton with a cross section $`\sigma _1`$, determined by the following equation :

$$\sigma _1=\pi \{(\delta x)^2+(\delta y)^2\}=\pi \left[\frac{C}{\omega }\right]^2=\frac{2}{\pi }\left(\frac{\lambda }{2}\right)^2,$$
(18)
which is determined by Heisenberg uncertainty relations:

$$(\delta p_x)^2(\delta x)^2\frac{\mathrm{}^2}{4};\mathrm{a}nd(\delta p_y)^2(\delta y)^2\frac{\mathrm{}^2}{4};$$
(19)
where the dispersions are:

$$(\delta x)^2(1/2)\{\frac{C}{\omega }\}^2=\{\frac{\lambda }{2\pi }\}^2;(\delta y)^2(1/2)\{\frac{C}{\omega }\}^2=\{\frac{\lambda }{2\pi }\}^2;$$
(20)
It is well known that the probability $`P_{12}`$ for a transition par second of some SchEl under ElcIntAct of extern ElcMgnFld from an eigenstate 1 into an eigenstate 2 is determined by the following formula:

$$P_{12}=\frac{4}{3}\frac{e^2}{\mathrm{}C^3}(\omega _{12})^3|\mathrm{\hspace{0.33em}1}|r|\mathrm{\hspace{0.33em}2}|^2$$
(21)
As the intensity of the ElcMgn emission I, emitted par second is equal of the product of the probability $`P_{12}`$ for a transition par second by the energy $`\mathrm{}\omega _{12}`$ of the emitted RlPhtn, then for certain

$$I=P_{12}\mathrm{}\omega _{12}=\frac{4}{3}\frac{e^2}{C^3}\omega _{12}^{}{}_{}{}^{4}|\mathrm{\hspace{0.33em}1}|r|\mathrm{\hspace{0.33em}2}|^2$$
(22)
Really the matrix element $`1|r|2`$ of the SchEl position is determined by the product of the probability for the spontaneous transition of a SchEl from an higher energetic level into a lower energetic level and the number $`(n+1)`$ for the emission or the number $`n`$ for the absorption of a RlPhtn, where n is the number of the RlPhtns within the external QntElcMgnFld, which polarizes atom. In our view here we need to note obvious supposition that the spreading quantum trajectory of the SchEl is a result of the participating of its well spread (WllSpr) ElmElcChrg in isotropic three dimensional (IstThrDmn) nonrelativistic quantized (NrlQnt) Furthian stochastic (FrthStch) circular harmonic oscillations motion (CrcHrmOscsMtn), which is a forced result of the electric interaction (ElcIntAct) of the SchEl’s WllSpr ElmElcChrg by the electric intensity (ElcInt) of the resultant resonance QntElcMgnFld of all stochastic virtual photons (StchVrtPhtns), existing in this moment of time within the area, where it is moving. In order to understand this uncommon stochastic motion we must remember the IstThrDmn nonrelativistic classical (NrlCls) Brownian stochastic (BrnStch) trembling harmonic oscillation motion (TrmHrmOscMtn) ( ), (), (), (), (), ( ).

It is well known that hundred and fifteen years ago (in 1883) Waldemar Foght have pointed,that the transition from one space-time variables to new space-time ones my means of relations :

$$x=xv\times ty=yz=zt=t\frac{v.x}{C.C}$$
(23)
preserves the form of the wave equation :

$$\frac{^2\phi }{(x)^2}+\frac{^2\phi }{(y)^2}+\frac{^2\phi }{(z)^2}\frac{1}{C^2}\frac{^2\phi }{(t)^2}=0$$
(24)
by means of which the electromagnetic wave of the light is described. But if J.Fidjerald, J.Larmor and A.Lorentz have considerate these transitions as a result of some physical cause and mathematical consequence, then A.Poancare and A.Einstein have voice a supposition for a covariancy of the differential equation (24) in a relation to transition from one coordinate frame K to an other coordinate one $`K^{}`$, which is moving in relation to first by velocity v. It turns out that we are able to give some physical explanation of uncommon mathematical results of the transition (24) within the spatial relative theory by some obvious physical interpretation of negative experimental results of Mikelson (1881) and Mikelson and Morly (1887) experiments. We need to point that the presence of the light velocity C in equation (24) is a result of description of the electromagnetic field despreading in the space by time. The applicability of Lorentz’ transformation for a determination of the energy-impulse values within different coordinate frames proves the electromagnetic self-interaction cause of the micro particles self-energy. In this light we understand why light velocity presents in the wave equation (24) . We will to explain a physical sense of the covariance of the wave equation (24) in a relation ot the Lorentz’ transformation (23). This covariance displays wave processes are covariant to Lorentz’ transformation. Consequently, both observers of same wave processes, presenting in different coordinate frames, must seen and describe one and same wave processes. It is turned that for this aim we need to suppose some obvious results. In first we need to suppose that the times have one and same value in different space points but within unmoving coordinate frame. Then it is turn that the times need to have different values in different space points within moving coordinate frame. Indeed, if we observe some harmonic oscillator, then we will see it as a participating in some wave motion within a moving coordinate frame. Then in order to describe this wave motion as same harmonic oscillation motion we need to introduce time, moving by a fase velocity in a relation to the moving coordinate frame. In other words the demand of the unity of an observation pictures of wave motions from both observers, presenting in different coordinate frames, moving by a constant velocity one to other, demands to losing the unitary of time velocity in different space points within the moving coordinate frame. It is time to begin by clarification of the physical sense of the Lorentz’ transformation (23).It is well known from mechanics that the transition from one coordinate frane to unmoving another one take place by turning one flatness of a real angle $`\phi `$ up to total coincidence of both axis. But from Lorentz’ transformation we seen that in this case we need to turn one flatness of an imagine angle $`\phi =i\alpha `$ up to total coincidence of both axis (ox - a direction of mutualy moving, ot - a direction of a time), having value, determinate by following equality : $`\mathrm{tan}(\phi )`$ = $`i\mathrm{tanh}(\alpha )`$ = $`i\gamma \frac{v}{C}`$. From this discussion we understand that if the angle $`\phi `$ can have values in area $`(0,\frac{\pi }{2})`$, then the angle $`\alpha `$ can have values in area $`(0,\mathrm{})`$. This means that the behaviors of the same wave motion in both coordinate frame must be described in different space points $`(randr`$ and times values $`(tandt)`$ as in different coordinate frames the same event of wave motion have different coordinates $`(x,t)`$ and $`(x,t)`$ within the space-time, which are connected by Lorentz’ transformation (23).

In what followed we will see one very unexpected consequence from Lorentz’ transformation. Indeed,by means of the transformation (23)we could obtain :

$$dx=\gamma (dxv.dt)dt=\gamma (dt\frac{v.dx}{C.C})$$
(25)
If we derive the first equation within (25) by second one then we can obtain a following equation:

$$u=\frac{(uv)}{1\frac{u.v}{C.C}}$$
(26)
if we use $`u=\frac{dx}{dt}`$ and $`u=\frac{dx}{dt}`$. When within three dimension space the relative velocity v of the moving inertial coordinate frame has only one component $`v(v_x,0,0)`$ then we obtain :

$$u_x=\frac{(u_xv_x)}{1\frac{u_xv_x}{C.C}}u_y=\frac{u_y}{1\frac{u_xv_x}{C.C}}u_z=\frac{u_z}{1\frac{u_xv_x}{C.C}}.$$
(27)
It is very easy to seen from equation (27) that when the velocity v of the relatively motion reach its maximal values C, then the velocity $`u^()`$ is equal of the light velocity C. This means that the maximal value of the velocity u within every coordinate frame could be equal of the light velocity C. This common relation is a nature result of the light spreading invariancy within vacuum in a relation of observer in different inertial coordinate frame, which is described by Lorentz’ transformation.

However it is no sole uncommon consequence of Lorentz’ transformation. Let we suppose that the values of both times are equal to zero when both zentrums $`0`$ and $`0`$ of both inertial coordinate frames coincident. We need to point that we may make the equal time values by synchronization of clocks in all points of the space within unmoving coordinate system. The concept of time simultaneous within unmoving coordinate system means that the time values in all points of its space are equal. However their corresponding time values within the different space points within moving coordinate system will be different. This means that the time in moving coordinate systems moving by a phase velocity $`v_f=\frac{C^2}{v}`$. We see that the time in unmoving coordinate frame is moving by infinitely big velocity, which give us possibility to think that the time is equal in all point of the space within this coordinate system.

It is very easy to verify that the time interval, measured by two clocks, being unmoving in moving and unmoving coordinate frames will be difference. Let the unmoving clock in unmoving coordinate frame takes pase $`x=x_1`$, and the unmoving clock in moving coordinate frame takes other place $`x^()=(x^())_1`$. Then we obtain following relation by means of Lorentz’ transformation

$$\mathrm{\Delta }\stackrel{~}{t}=\gamma .\mathrm{\Delta }t$$
(28)
But mean-while the clock within unmoving coordinate frame is measured the time interval $`\mathrm{\Delta }t=t_2t_1`$, the time beginning will pass a distance $`\mathrm{\Delta }x=v.\mathrm{\Delta }t`$ in moving coordinate frame, measured in unmoving coordinate frame. Consequently the clock in moving coordinate frame, which is unmoving in this coordinate frame, will pass from the point $`x_1`$ to the point $`x_2`$, where $`x_2=x_1(1\frac{v.v}{C.C})`$. In this way after substitution we could obtain :

$$\mathrm{\Delta }\overline{t}=\gamma (1\frac{v.v}{C.C})\mathrm{\Delta }t=\frac{\mathrm{\Delta }t}{\gamma }$$
(29)
Consequently, if we take into consideration the motion of the clock, being unmoving in the beginning of the moving coordinate frame in a relation to unmoving coordinate frame and the motion of the time by the phase velocity $`u_f`$ in the moving coordinate frame, then we could obtain :

$$\mathrm{\Delta }t=\gamma .\mathrm{\Delta }t$$
(30)
Consequently, the difference in display of both clocks a result of both motions : of the clock motion by velocity v together with the moving coordinate frame and the time motion by phase velocity $`v_f`$ in same one. Indeed, the first time interval is less $`\gamma `$ times and the second time interval is more $`\frac{1}{\gamma }`$ times. Therefore their product is equal of quadrate of own true time: $`(\mathrm{\Delta }t)^2=(\mathrm{\Delta }\stackrel{~}{t}).(\mathrm{\Delta }(\overline{t})`$

In some way we could explain if we want to understand why both length $`\mathrm{\Delta }l`$ and $`\mathrm{\Delta }(\stackrel{~}{l})`$ in moving and unmoving coordinate frames. It is very clear that for a measure the moving train by velocity v we need to know where are its ends in equal time values, i.s. at $`(\mathrm{\Delta }t)`$ . Indeed, we need to take into consideration the time value $`\mathrm{\Delta }t=\frac{v.l}{C.C}`$ of spread in the time within moving coordinate frame between both train ends.Therefore after substitution we can obtain:

$$\stackrel{~}{l}=\gamma (1\frac{v.v}{C.C})l=\frac{l}{\gamma }$$
(31)
If we take into consideration the motion of the beginning of the moving coordinate frame toghether by one its end then we could obtain a relation:

$$(\overline{l})=\gamma (1\frac{v.v}{C.C})l=\frac{l}{\gamma }$$
(32)
and

$$l=\gamma (\overline{l})$$
(33)
Therefore the following relation is appeared:

$$(l)^2=(\stackrel{~}{l})(\overline{l})$$
(34)
The spreading of the proper time within moving coordinate frame finds the experimental confirmation by the measure of the $`\mu `$-meson number, overcoming from the cosmos through the atmosphere to earth surface. Really, if we take into consideration the live time interval of $`\mu `$-mesons, within the unmoving relatively it coordinate system $`(\tau =2,2.10^(6)`$ sec, then although their velocity is smaller then light velocity C, then their length of half-disintegration will be $`l=\tau C=6,610^4sm=660m`$.

Although it is well known that the atmosphere thickness around the earth is more bigger, a great number of $`\mu `$-mesons reach it. For a true physical explanation of this experimental results we need to take into consideration the time spreading through the space of the moving coordinate frame, which is unmoving relatively the earth. In such way if we take into consideration that $`\gamma =100`$, then we obtain the value for the time of a $`\mu `$-meson half-disintegration $`(\tau )^()=\gamma \tau =1002,210^(4)=2,210^(2)`$. Therefore for the length of the $`\mu `$-meson half-desintegration we could obtain $`l=66,000m=66km`$. This example display us that for understanding the experimental fact in one case we need to increase the train length and in other cas to increase the half-disintegration time. In such a physically clear and mathematically correct way we made on progress in understanding this experimental result.

It is a time to explain Mikelson-Morly negativ experimental dates.We suggest that in first an experimental installation is built in an unmoving inertial coordinate frame.Moreover the semitransparent mirror (SmMr) is located in the beginning same inertial coordinate frame and axis ox is directed in parallel of the velocity v of the moving inertial coordinate frame relatively unmoving one. Moreover one flat mirror (FlMr1) is installed along axis ox of a distance l from the beginning of the unmoving inertial coordinate frame and an other flat mirror (FlMr2) is installed along axis oy, which is a perpendicular of the axis ox, of a same distance l. The wave front of the light semi-wave, which is passed through the SmMr at a time moment $`t_o=0`$, located in the beginning of the unmoving coordinate frame, arrives in the FlMr1 and reflects from it at a time moment $`t_(1a)=\frac{l}{c}`$ and arrives in the SmMr and reflects from it in direction of axis -oy at a time moment $`t_(2a)=\frac{2l}{C}`$. The other wave front of the other light semi-wave, which reflects from the SmMr in a direction of axis oy and at same time moment $`t_o=0`$, arrives in the FlMr2 and reflects from it at a time moment $`t_(1b)=\frac{l}{C}`$ and arrives and passes throgh it at a time moment $`t_(2b)=\frac{2l}{C}`$. After all that both light semi-waves move parallel and arrive to a common screen. It is a classical description. In more correct quantum description the light wave i a sum of many real photons, which can pass through or reflect from semi-mirrors, and the interference of the both light semi-wave is a result of the interaction of all real photons, which build both semi-waves, with the standing waves of the electromagnetic fields, created by stochastic exited virtual photons within the closed contour between SmMr, FlMr1 and FlMr2. As this closed contour and standing waves don’t change at turning of the hole installation, than the interference picture will not change because the interaction between standing waves and real photons of both light semi-wave. In this physically clear quantum explanation we understand that there is no need to use the classical explanation and different mathematical transformatins because there is a physically well-founded cause for an unchanged interference picture at a turning of the hole installation of an angle $`=90^o`$.

The existence of the vacuum as some easy polarized ideal dielectric medium is performance by the experimental observation of the Dopler’s effect for light as for sound and the limitation of the light velocity at its spreading through the vacuum. When the closed contour is filled by some material medium, having determined dielectric constant $`ϵ`$, different from 1, then the velocity u of the light within the medium, where $`u=\frac{C}{n}`$, if $`n=\sqrt{\mu .ϵ}`$ , where a $`\mu `$ is a magnetic permeability and a $`ϵ`$ is a electric permeability. Then by means of a relation (26) we could obtain :

$$u=\frac{(\frac{C}{n}+v)}{1+\frac{\frac{C}{n}.v}{C.C}}=(\frac{C}{n}+v).(1\frac{1}{n}.\frac{v}{C})\frac{C}{n}+w,$$
(35)
where w is a velocity of a carried light $`(w=v.(1\frac{1}{n^2}=v.(1\frac{1}{\epsilon .\mu })`$ When $`\mu 1`$ then $`n^2\epsilon `$ and therefore $`wv.(1\frac{1}{\epsilon })`$

If we see relation (14), then we understand that it is naturally that the supplementary polarization of atoms and molecules within dielectric medium delay the photon moving depending from velocity of moved medium. From obtained above result about the light caring from a dielectric medium we could understand that when there is some dielectric wave fluid thin a closed contour, then its turning in the space will change the interference picture of the interferometer.

As all MicrPrts are excitements of the vacuum then every one of them would can move freely through its ideal dielectric without any friction or damping, that is to say without one to feel the existence of the vacuum. Moreover, the existence of some MicrPrt in the vacuum distorts its ideal crystalline lattice by its high density QntElcMgnFld, created by own FnSpr ElmElcChrg. This natural distortion of the neutral FlcVcm molecular close-packed lattice excites and ensures the gravitation field of the ElmMicrPrt’s mass, which by using same force show attention upon mass of another ElmMicrPrt and upon its behavior. In such a naturally obvious and physically clear way we understand why the force of the gravitation interaction is determined by the self energy at a rest and mass.