Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Automatic Control and Computer Sciences

Matrix-Qubit Algorithm for Semantic Analysis of Probabilistic Data

I. A. Surov

Published Dec 1, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.3103/s0146411625700324

Related papers

Matrix-qubit algorithm for semantic analysis of probabilistic data

Илья Алексеевич Суров

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.

Modeling and Analysis of Information Systems•Sep 13, 2024•0 citations

Quantum-probabilistic SVD: complex-valued factorization of matrix data

S. Kozhisseri, Илья Алексеевич Суров

The paper reports a method for compressed representation of matrix data on the principles of quantum theory. The method is formalized as complex-valued matrix factorization based on standard singular value decomposition. The developed approach establishes a bridge between standard methods of semantic data analysis and quantum models of cognition and decision. According to the quantum theory, real-valued observable quantities are generated by wavefunctions being complex-valued vectors in multidimensional Hilbert-space. Wavefunctions are defined as superpositions of basis vectors encoding composition of semantic factors. Basis vectors are found by singular value decomposition of the initial data matrix transformed to a real-valued amplitude form. Phase-dependent superposition amplitudes are found to optimize approximation of the source data. The resulting model represents the observed real-valued data as generated from a small number of basis wavefunctions superposed with complex-valued coefficients. The method is tested for random matrices of sizes from 3 × 3 to 12 × 12 and dimensionality of latent Hilbert-space from 2 to 4. The best approximation is achieved by encoding latent factors in normalized complex-valued amplitude vectors interpreted as wavefunctions generating the data. In terms of approximation fitness, the developed method surpasses standard truncated SVD of the same dimensionality. The mean advantage over the considered range of parameters is 22 %. The method permits cognitive interpretation in accord with the existing quantum models of cognition and decision. The method can be integrated in the algorithms of semantic data analysis including natural language processing. In these tasks, the obtained improvement of approximation translates to the increased precision of similarity measures, principal component analysis, advantage in classification, and document ranking methods. Integration with quantum models of cognition and decision is expected to boost methods of artificial intelligence and machine learning improving imitation of natural thinking.

Scientific and technical journal of information technologies mechanics and optics•Jun 1, 2022•3 citations

Квантовое сингулярное разложение

Илья Алексеевич Суров

real-valued calculations in artificial neural networks captures the amplitudes of neural signals but neglects their phases, which are critical parameters controlling the composition of cognitive waves in natural brains. To address this limitation, we present a complex-valued modification of singular matrix decomposition, a conceptual precursor to the tensor algebra underlying modern neural networks. In this approach, we generalize the diagonal matrix of singular values to a self-adjoint complex matrix, analogous to the density matrix in quantum theory. Within low-dimensional “semantic” spaces, the additional non-diagonal elements of the complex matrix account for the non-stationary logic of the cognitive systems that generate the data. As in the standard formulation, the density matrix is sandwiched between two orthogonal real-valued matrices, unfolding semantic regularities into the space of observable events. The squared modulus of the resulting set of complex-valued amplitudes then produces observable real-valued data, following the quantum-mechanical Born rule. By introducing a minor increase in the number of parameters, our method significantly enhances the precision of classical singular value decomposition. This improvement highlights the efficiency of wave-like and quantum-inspired principles in natural cognition, as expressed in the proposed algebra. The method provides new opportunities for semantic data analysis and offers pathways to advance modern neural network architectures.

Успехи кибернетики / Russian Journal of Cybernetics•Mar 31, 2025•0 citations

Probabilistic prediction of “irrational” decisions from semantic composition of contexts

Илья Алексеевич Суров

Difficulties in prognosis of human behavior are due to the complexity of our cognition, routinely breaking the boundaries of classical rationality. The paper solves this problem for the simplest kind of such “irrational” behavior in which a single binary decision is made in three related contexts. Subjective meanings of these contexts relative to the basis decision alternative are represented by three qubit states, borrowed from quantum theory. These states are bound together by linear superpositions, which encode semantic composition of the contexts in the subject’s mind. The resulting theory supplements classical probabilistic model with nonlinear interference factor, accounting for the “irrational”, emotionally-semantic side of intelligence. This model is built for different realizations of two classic experiments used to study behavioral irrationality: the prisoner’s dilemma and the two-stage gambling task. In 24 such realizations, the interference phase is shown to fall in a narrow range of values, encoding regularities of semantic composition of contexts. Extrapolation of this regularity to novel experiments allows using the model in prognostic mode. This possibility is tested on the task of probabilistic prediction of target decision based on the same probability in two other contexts. For the prisoner’s dilemma and the two-stage gambling task the such prognosis has relative errors of 9 and 11% respectively. The proposed approach allows for putting other quantum models of cognition and decision to predictive and interpretable use, whereas its principles also apply to modeling of decisions with larger sets of contexts and behavioral options. By formalizing a novel type of semantic regularities behind “irrational” thinking, models of the present type open prospects for empowering the existing means for socio-economical analytics and prediction.

Journal Of Applied Informatics•Feb 12, 2024•2 citations

Nonlinear Matrix Decomposition of Quantum Entanglement Analysis

Jincheng Zhang

This paper explores the application of Nonlinear Matrix Decomposition (NMD) to quantum entanglement analysis, aiming to enhance the accuracy of characterizing entanglement properties and strength, particularly in the context of high-dimensional quantum states. The core claim is that NMD offers a novel approach to tackle the complexity inherent in entangled states, translating them into more computationally tractable models. We investigate the potential of this method to improve the precision of entanglement measurement and provide a robust framework for analyzing entangled systems. This research focuses on leveraging the mathematical foundations of quantum entanglement to develop a modified NMD algorithm that addresses specific challenges in data analysis. The paper details the design and implementation of the NMD technique, exploring its efficacy through simulations and preliminary experimental results. Finally, the paper presents a comprehensive analysis of the potential benefits and limitations of this approach, highlighting the contributions to the field of quantum entanglement analysis.

•Sep 6, 2026•0 citations

Semantic Analysis of Auto-Generated Sentences Using Quantum Natural Language Processing

J. Kavya, K. Krishnaveni, K. Namratha +2 more

Abstract: Quantum Natural Language Processing (QNLP) represents a pioneering approach to understanding and analyzing natural language by leveraging the principles of quantum computing. This project aims to explore the semantic analysis of autogenerated sentences using QNLP techniques. Traditional Natural Language Processing (NLP) methods have achieved significant milestones in language understanding and generation; however, they often struggle with the intricacies of context, ambiguity, and the vast computational resources required for complex tasks. QNLP offers a novel paradigm by utilizing the superposition and entanglement properties of quantum states, potentially revolutionizing how semantic meaning is extracted and processed. The primary objective of this project is to develop a QNLP framework capable of performing semantic analysis on autogenerated sentences. We will investigate the application of quantum algorithms and quantum machine learning models to decode the semantic structure and context of sentences generated by language models. This involves encoding textual data into quantum states, applying quantum gates and circuits to manipulate these states, and measuring the outcomes to interpret semantic information. By integrating quantum computing with NLP, this project seeks to achieve higher accuracy and efficiency in understanding complex language patterns. The anticipated outcomes include a comprehensive evaluation of QNLP's performance in semantic analysis, a comparison with classical NLP methods, and potential advancements in language processing tasks such as sentiment analysis, language translation, and text summarization. This project will contribute to the growing body of research at the intersection of quantum computing and artificial intelligence, paving the way for innovative solutions in the field of natural language processing.

International Journal for Research in Applied Science and Engineering Technology•Nov 24, 2024•0 citations
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.
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.
The paper reports a method for compressed representation of matrix data on the principles of quantum theory. The method is formalized as complex-valued matrix factorization based on standard singular value decomposition. The developed approach establishes a bridge between standard methods of semantic data analysis and quantum models of cognition and decision. According to the quantum theory, real-valued observable quantities are generated by wavefunctions being complex-valued vectors in multidimensional Hilbert-space. Wavefunctions are defined as superpositions of basis vectors encoding composition of semantic factors. Basis vectors are found by singular value decomposition of the initial data matrix transformed to a real-valued amplitude form. Phase-dependent superposition amplitudes are found to optimize approximation of the source data. The resulting model represents the observed real-valued data as generated from a small number of basis wavefunctions superposed with complex-valued coefficients. The method is tested for random matrices of sizes from 3 × 3 to 12 × 12 and dimensionality of latent Hilbert-space from 2 to 4. The best approximation is achieved by encoding latent factors in normalized complex-valued amplitude vectors interpreted as wavefunctions generating the data. In terms of approximation fitness, the developed method surpasses standard truncated SVD of the same dimensionality. The mean advantage over the considered range of parameters is 22 %. The method permits cognitive interpretation in accord with the existing quantum models of cognition and decision. The method can be integrated in the algorithms of semantic data analysis including natural language processing. In these tasks, the obtained improvement of approximation translates to the increased precision of similarity measures, principal component analysis, advantage in classification, and document ranking methods. Integration with quantum models of cognition and decision is expected to boost methods of artificial intelligence and machine learning improving imitation of natural thinking.
real-valued calculations in artificial neural networks captures the amplitudes of neural signals but neglects their phases, which are critical parameters controlling the composition of cognitive waves in natural brains. To address this limitation, we present a complex-valued modification of singular matrix decomposition, a conceptual precursor to the tensor algebra underlying modern neural networks. In this approach, we generalize the diagonal matrix of singular values to a self-adjoint complex matrix, analogous to the density matrix in quantum theory. Within low-dimensional “semantic” spaces, the additional non-diagonal elements of the complex matrix account for the non-stationary logic of the cognitive systems that generate the data. As in the standard formulation, the density matrix is sandwiched between two orthogonal real-valued matrices, unfolding semantic regularities into the space of observable events. The squared modulus of the resulting set of complex-valued amplitudes then produces observable real-valued data, following the quantum-mechanical Born rule. By introducing a minor increase in the number of parameters, our method significantly enhances the precision of classical singular value decomposition. This improvement highlights the efficiency of wave-like and quantum-inspired principles in natural cognition, as expressed in the proposed algebra. The method provides new opportunities for semantic data analysis and offers pathways to advance modern neural network architectures.
Difficulties in prognosis of human behavior are due to the complexity of our cognition, routinely breaking the boundaries of classical rationality. The paper solves this problem for the simplest kind of such “irrational” behavior in which a single binary decision is made in three related contexts. Subjective meanings of these contexts relative to the basis decision alternative are represented by three qubit states, borrowed from quantum theory. These states are bound together by linear superpositions, which encode semantic composition of the contexts in the subject’s mind. The resulting theory supplements classical probabilistic model with nonlinear interference factor, accounting for the “irrational”, emotionally-semantic side of intelligence. This model is built for different realizations of two classic experiments used to study behavioral irrationality: the prisoner’s dilemma and the two-stage gambling task. In 24 such realizations, the interference phase is shown to fall in a narrow range of values, encoding regularities of semantic composition of contexts. Extrapolation of this regularity to novel experiments allows using the model in prognostic mode. This possibility is tested on the task of probabilistic prediction of target decision based on the same probability in two other contexts. For the prisoner’s dilemma and the two-stage gambling task the such prognosis has relative errors of 9 and 11% respectively. The proposed approach allows for putting other quantum models of cognition and decision to predictive and interpretable use, whereas its principles also apply to modeling of decisions with larger sets of contexts and behavioral options. By formalizing a novel type of semantic regularities behind “irrational” thinking, models of the present type open prospects for empowering the existing means for socio-economical analytics and prediction.
This paper explores the application of Nonlinear Matrix Decomposition (NMD) to quantum entanglement analysis, aiming to enhance the accuracy of characterizing entanglement properties and strength, particularly in the context of high-dimensional quantum states. The core claim is that NMD offers a novel approach to tackle the complexity inherent in entangled states, translating them into more computationally tractable models. We investigate the potential of this method to improve the precision of entanglement measurement and provide a robust framework for analyzing entangled systems. This research focuses on leveraging the mathematical foundations of quantum entanglement to develop a modified NMD algorithm that addresses specific challenges in data analysis. The paper details the design and implementation of the NMD technique, exploring its efficacy through simulations and preliminary experimental results. Finally, the paper presents a comprehensive analysis of the potential benefits and limitations of this approach, highlighting the contributions to the field of quantum entanglement analysis.
Abstract: Quantum Natural Language Processing (QNLP) represents a pioneering approach to understanding and analyzing natural language by leveraging the principles of quantum computing. This project aims to explore the semantic analysis of autogenerated sentences using QNLP techniques. Traditional Natural Language Processing (NLP) methods have achieved significant milestones in language understanding and generation; however, they often struggle with the intricacies of context, ambiguity, and the vast computational resources required for complex tasks. QNLP offers a novel paradigm by utilizing the superposition and entanglement properties of quantum states, potentially revolutionizing how semantic meaning is extracted and processed. The primary objective of this project is to develop a QNLP framework capable of performing semantic analysis on autogenerated sentences. We will investigate the application of quantum algorithms and quantum machine learning models to decode the semantic structure and context of sentences generated by language models. This involves encoding textual data into quantum states, applying quantum gates and circuits to manipulate these states, and measuring the outcomes to interpret semantic information. By integrating quantum computing with NLP, this project seeks to achieve higher accuracy and efficiency in understanding complex language patterns. The anticipated outcomes include a comprehensive evaluation of QNLP's performance in semantic analysis, a comparison with classical NLP methods, and potential advancements in language processing tasks such as sentiment analysis, language translation, and text summarization. This project will contribute to the growing body of research at the intersection of quantum computing and artificial intelligence, paving the way for innovative solutions in the field of natural language processing.