Matrix-Qubit Algorithm for Semantic Analysis of Probabilistic Data

This paper presents a method for semantic data analysis by complex-valued matrix decomposition. The method is based on the quantum model of contextual decision-making, according to which observable probabilities are generated by the qubit states, representing the subjective meaning of the contexts relative to the basis decision. In the simplest three-context case, one of these qubits is decomposed into a 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 the rows and columns correspond to the contexts and samples of the 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 nonnegative matrix decompositions, truncated to the same dimension. The model is experimentally tested in the descriptive and prognostic regimes. The result opens prospects for development of nature-like computational architectures on novel logical grounds.

Authors

Institutions

Publication Details

Journal
Automatic Control and Computer Sciences
Published
2025-12-01
DOI
https://doi.org/10.3103/s0146411625700324
Primary Topic
Cognitive Computing and Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Matrix-Qubit Algorithm for Semantic Analysis of Probabilistic Data

I. A. Surov
Automatic Control and Computer Sciences
Cognitive Computing and Networks
article

Matrix-Qubit Algorithm for Semantic Analysis of Probabilistic Data

I. A. Surov
article en

Abstract

This paper presents a method for semantic data analysis by complex-valued matrix decomposition. The method is based on the quantum model of contextual decision-making, according to which observable probabilities are generated by the qubit states, representing the subjective meaning of the contexts relative to the basis decision. In the simplest three-context case, one of these qubits is decomposed into a 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 the rows and columns correspond to the contexts and samples of the 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 nonnegative matrix decompositions, truncated to the same dimension. The model is experimentally tested in the descriptive and prognostic regimes. The result opens prospects for development of nature-like computational architectures on novel logical grounds.

Automatic Control and Computer SciencesVol. 59(7)
ITMO University (RU)
Peace, Justice and strong institutions
Openalex Percentile: Top 14%
Cognitive Computing and Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.