Von Neumann quantum logic vs. classical von Neumann architecture?
A. Yu. Vlasov
Federal Radiological Center, IRH
Mira Street 8, St.-Petersburg, Russia
Аннотация – Имя Джона фон Неймана стало нарицательным как в квантовой механике, так и в вычислительной технике. Действительно ли это две совершенно несвязные сферы деятельности, как кажется на первый взгляд? Множество работ посвящённых квантовым компьютерам и коммуникациям дают серьёзные основания предположить существование подобной связи, но в коротком обзоре невозможно затронуть всю эту новую и бурно развивающуюся в последние годы тематику. В данной работе описываются структуры и модели линейной алгебры, общность которых и делает их универсальными в таких разных предметных областях, как квантовая механика итеория байесова распознавания образов, ассоциативная память, нейронные сети, нечёткая логика.
J.?von?Neumann is considered as one of “fathers” of modern computers due to his theoretical works and elaboration of computer EDVAC at 1945–50, but already 20 year before it, at 1926–31 he participated in drawing yet another kind of logic — logic of quantum mechanics and only now the different areas of research of one scientist seem going to meet and born new family of ultrascale cybernetic devices — quantum computers.
Currently the quantum information science exists mainly as theoretical area of research and size of quantum registers does not exceed of 3-5 quantum bits (qubits), but in the paper is considered question: does the quantum logic has some useful application as an abstract mathematical model in computer science? Such applications of physical models nowadays are not unusual, for example Boltzmann machines and other methods came to area of artificial neural networks from statistical physics [1, 2].
It is also useful to draw some analogy with fuzzy sets and logic . Here is used discrete representation of 2D sets on some lattice due to understanding analogy with bit-map pictures.
Let us introduce few data types in some “Pascal-like” notation to come from fuzzy sets to quantum registers. Here n and N = 2n are integer numbers.
1) x : dot = [1 .. N,1 .. N];
Here x is represented as point on 2D space for simplicity, because of digitization we can consider space of any dimension as interval of natural numbers x : 1 .. N 2. In this example x is visual model for n + n = 2n-bits register.
2) I : set_2D = set of dot;
I : set_2D = array [dot] of Boolean;
The set, “image” can be considered as black and white picture - black set on white sheet. It is necessary 2N·N i.e. 2 (2 (2n)) bits for the set.
3) F : fuzzy_set = array [dot] of real;
The real is interval [0.0 .. 1.0] of real numbers represented with some finite precision d. It can be considered as an analogue of gray-scaled picture. The fuzzy set also can be standardized by condition a xF[x] = 1 where a x in example under consideration is double sum:
(in continuous case an integration used instead of the summation and distributions F(x) are used instead of arrays).
The condition (1) is used in statistical interpretation of fuzzy set, when it is suggested to choose some point of set with probability proportional of adequacy function F[x], and sum of all the probabilities is unit. Let us use notation p[x] for the probabilities.
Now let us introduce notion of quantum set (it is not standard term, mathematical object discussed further corresponds to 2n-qubit register in quantum information science  or quantum mechanical system with N2 states ):
4) Q : qu_set = array [dot] of complex;
Where complex is q = u + iw, |q|? 1. Instead of standardization condition here is used normalization : a x|Q[x]|2 = 1 i.e. :
for example under consideration.
In quantum mechanics the complex numbers q[x] are called amplitudes, related with classical probabilities as p = |q|2 = u2 + w2, i.e. there is standardized fuzzy set related with given normalized quantum set via formula: p[x] = |q[x]|2.
It is possible for simplification to consider case with real amplitudes (w = 0), and let us explain why an “auxiliary” fuzzy set with has some independent useful application.
Let us consider two sets p1[x], p2[x] and look for some likelihood function H(p1,p2) with properties: H(p1, p2) < 1 for p1? p2, H(p,p) = 1 [1, 3]. For standardized sets such function can be chosen as H(p1,p2) = a x(p1[x] p2[x])1/2. If we use quantum sets q1, q2 (p1=q12, p2=q22), the formula is H(q1, q2) = a xq1[x] q2[x].
In our example x was chosen as multi-index of 2D array mostly for simple visualization and any array can be described as one-dimensional. Here x = (i, j) can be substituted by index of the 1D array like K = (i -1) N + j, K I [1 .. N2], then formula can be written as:
and it shows, that H(q,q? ) is simply scalar product of two vectors with N2 elements and unit lengths (due to normalization condition) and so the function really can be unit only for equivalent vectors.
It should be mentioned also, that the formula (3) is given for real qK for simplicity and in complex case it contains terms with complex conjugation: . It is Hermitian norm . Such case also has applications, for example then we work with complex Fourier transform of some image.
The discussed property of quantum set as “square root of fuzzy set” makes clear, why it can be useful in such abstract area, as image recognition [4, 5], quite far from initial appearance in quantum mechanics.
Let us discuss now some question related with “hardware”. We had
few data structures:
1) x : dot, 2) I[x] : set_2D, 3) p[x] : fuzzy_set
It is sequence with more and more complicated structure with occupation of more and more computer memory. But let us suggest, that register x is permanently changing its value by such a law, that after enough period of time T it can be found, the x had value v during time t[v] and .
The algorithm can be implemented by software, but it also can be considered as some hardware register (like implementation of random number generator in some computers with main difference, that p[v] depends on v ; or input port of some analog-to-digital converter is scanning some “physical model” of fuzzy set p).
Then each access to the register produces some value of x with probability p[x], so one 2n-bits stochastic register is enough to implement statistical model of standardized fuzzy set discussed earlier.
Now let us come to qu_set data type. Why it can be modeled by one quantum register? The example with stochastic register as model of fuzzy set is some analogy (see also ). But procedure of access to such register due to laws of quantum mechanics has some differences with classical statistical register discussed below.
Let us consider some value q I qu_set of the register, it is array of numbers q[x], we may not read all the numbers, but if we access to the register, we read number x with probability p[x] = |q[x]|2 and it coincides with functionality of stochastic register described above.
It should be mentioned only, that any access to q destroys the quantum register by substitution instead of q new array with 1 in element with index x and with all other is 0, and so the register should be reset (preparation in terminology of quantum mechanics) in q after each access (quantum measurement).
But the quantum register has other useful property, it is possible instead of simple access described above to perform another operation, we prepare some given q? I qu_set and read the register q with using q? as some “quantum bit-mask”, then with probability |H(q,q? )|2 (see Eq. 3) operation is successful and so by repeating it more times we may found |H| with more precision.
Because the |H| has useful application as likelihood function, the quantum register can be used as some hardware accelerator for image analysis. Currently such hardware is not accessible and so it was interesting to research advantages and disadvantages of the particular function |H| in usual software applications.
It is promising not only because such kind of software would suffer giant speed-up after creation specific quantum hardware, but also because the used mathematical constructions and methods of linear algebra are quite convenient and powerful.
It should be mentioned, that similar mathematical methods already was used in models of associative memory  and formal neural network  without any relation with quantum mechanical models. Only noticeable difference was using real linear spaces instead of complex and Euclidean norm (Eq. 3) instead of Hermitian (with complex conjugation).
Let us now consider some operations with fuzzy and quantum sets, discuss fuzzy and quantum logic.
For usual sets we have basic operations for A, B : set_2D, - intersection:, union: , complementation: Ac. With using presentation of set as Boolean array the operations in components can be written: (ac)[x] = not a[x], [x] = a[x]U b[x], [x] = a[x]U b[x].
Similarly it is possible to define operations with fuzzy sets by definition of real analogs of Boolean operations not (¬), and (U ), or (U ).
For example ¬a ® 1-a, aU b ® min(a,b), aU b ® max(a,b) is a good choice, but here is used a second one, more algebraic aU b ® a? b, aU b ® a+b-ab.
But qu_set introduced above is not directly used in quantum logic — the linear operators are used here instead of vectors:
L: qu_map = array [dot,dot] of complex;
It is matrix for linear map: qu_set ® qu_set:
where indexes I, K are used instead of multi-indexes [i,j] and [k,l] (let us for simplicity use further the indexes like I, K : [1 .. M], M=N2).
The operators A, B,... I qu_map form an algebra with usual matrix multiplication C=AB:
A special kind of operators, projectors, make possible comparison of the algebra with logic, i.e. Boolean algebra. The projector is operator with property P2 = P. Let us consider set of orthogonal projectors, i.e. PiPj = 0, i? j, then the operators produce Boolean algebra in respect of operations:
¬P ? 1-P, P/\R ? PR, P\/R ? P+R-PR (6)
Elements of the algebra have form P(S) there S : set of 1 .. M:
There is relation between qI qu_set and some projector PqI qu_map : Pq[I,J]=q[I]q[J]. To describe properties of the projector it is convenient together with q considered as row with M elements to consider transposed column q+ (conjugated for complex case).
Then Pq= q+q and q·q+ = H(q,q) = 1 (the row q can be considered as 1? M matrix, column q+ as M? 1 matrix and due to law of multiplication the q·q+ is 1? 1 matrix i.e. number and q+q is M? M matrix) and PqPq= q+q q+q = q+1q = q+q = Pq.
If we consider family of nonintersected sets q1, q2,..., qk then Pi = qi+qi are orthogonal projectors and so quantum sets in such representations have rather relations with usual logic than with fuzzy one.
For more clear explanation of properties of Pi it is possible to use existence of some orthogonal (unitary for complex case) matrix U same for all Pi such, that all P? i = UPiU -1 are diagonal and have very simple form: P? 1 = diag(1,0,...,0), P? 2 = diag(0,1,...,0), etc. .
The classical Boolean structure of the operators Pi and their sums P(S) (see Eq. 7) is because of all the operators commute . If to choose projectors P, R: PR? RP the Eq. 6 do not produce Boolean algebra, but it is other kind of non-Boolean logic, than fuzzy one.
It should be mentioned, that more direct relation with fuzzy set have so-called mixed quantum states R = a iwiPi, a iwi = 1 where wi have statistical nature and so here is written analog of standardized fuzzy set.
A representation of some kind of fuzzy operations is example with family of commuting operators , but not projectors. They are described by diagonal matrices: Dq[I,I] = q[I], Dq[I,J] = 0, I? J and already shown Eq. 6.
Bibliographical notes: In addition to references [7, 11] some general handbook on quantum mechanics like  is appropriate for most text of the paper. New area of quantum computation is presented in [6, 14–17]. The ‘quant-ph’ and ‘math’ after ‘Report No.’ are quantum physics and mathematics electronic archives of Los Alamos National Laboratory respectively. Two works of J. von Neumann devoted to quantum logic  and electronic computers  are included for completeness.