|
Computing methodologies and applications
Matrix-qubit algorithm for semantic analysis of probabilistic data
I. A. Surov ITMO University, Saint-Petersburg, Russia
Abstract:
The paper presents a method for semantic data analysis by means of complex-valued matrix decomposition. The method is based on the quantum model of contextual decision-making, according to which observable probabilities are generated by qubit states, representing subjective meaning of the contexts relative to the basis decision. In the simplest three-context case, one of these qubits is decomposed to superposition of the remaining two, mathematically encoding semantic relations between the three contexts. For use in data analysis this model is translated to the matrix form, in which rows and columns correspond to the contexts and instances of experiment. The observable real-valued data then emerge from a complex-valued amplitude matrix, decomposed to a product of a real basis matrix and complex-valued matrix of superposition coefficients. This decomposition reveals stable process-semantic relations between the considered contexts, not captured by other methods of analysis. As a result, the data are approximated with higher precision and fewer parameters than singular and non-negative matrix decompositions, truncated to the same dimension. The model is experimentally approved in descriptive and prognostic regimes. The result opens prospects for development of nature-like computational architectures on novel logical grounds.
Keywords:
semantic analysis, behavioral modeling, matrix decomposition, context, quantum probability, quantum logic, qubit.
Received: 22.07.2024 Revised: 19.08.2024 Accepted: 28.08.2024
Citation:
I. A. Surov, “Matrix-qubit algorithm for semantic analysis of probabilistic data”, Model. Anal. Inform. Sist., 31:3 (2024), 280–293
Linking options:
https://www.mathnet.ru/eng/mais828 https://www.mathnet.ru/eng/mais/v31/i3/p280
|
|