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

Успехи кибернетики / Russian Journal of Cybernetics

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

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

Published Mar 31, 2025• 0 citations
OpenAlex

Abstract

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.

Related papers

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

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

Matrix-Qubit Algorithm for Semantic Analysis of Probabilistic Data

I. A. Surov

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 Sciences•Dec 1, 2025•0 citations

An Improvement in Quantum Fourier Transform

László Gyöngyösi, Sándor Imre

Singular Value Decomposition (SVD) is one of the most useful techniques for analyzing data in linear algebra. SVD decomposes a rectangular real or complex matrix into two orthogonal matrices and one diagonal matrix. In this work we introduce a new approach to improve the preciseness of the standard Quantum Fourier Transform. The presented Quantum-SVD algorithm is based on the singular value decomposition mechanism. While the complexity of the proposed scheme is the same as the standard Quantum Fourier Transform, the precision of the Quantum-SVD approach is some orders higher. The Quantum-SVD approach also exploits the benefits of quantum searching.

arXiv:1207.4464•Jul 18, 2012•4 citations

Toward quantum-aware machine learning: Improved prediction of quantum dissipative dynamics via complex valued neural networks

Muhammad Atif, Arif Ullah, Ming Yang

Accurately modeling quantum dissipative dynamics remains challenging due to environmental complexity and non-Markovian memory effects. Although machine learning provides a promising alternative to conventional simulation techniques, most existing models employ real-valued neural networks (RVNNs) that inherently mismatch the complex-valued nature of quantum mechanics. By decoupling the real and imaginary parts of the density matrix, RVNNs can obscure essential amplitude-phase correlations, compromising physical consistency. Here, we introduce complex-valued neural networks (CVNNs) as a physics-consistent framework for learning quantum dissipative dynamics. CVNNs operate directly on complex-valued inputs, preserve the algebraic structure of quantum states, and naturally encode quantum coherences. Through numerical benchmarks on the spin-boson model and few variants of the Fenna-Matthews-Olson complex, we demonstrate that CVNNs outperform RVNNs in convergence speed, training stability, and physical fidelity-including significantly improved trace conservation and Hermiticity. These advantages increase with system size and coherence complexity, establishing CVNNs as a robust, scalable, quantum-aware classical approach for simulating open quantum systems in the pre-fault-tolerant quantum era.

arXiv:2601.03964•The Journal of Chemical Physics•Mar 2, 2026•1 citation

An Effective Strategy for Sentiment Analysis Based on Complex-Valued Embedding and Quantum Long Short-Term Memory Neural Network

Zhulu Chu, Xihan Wang, Meilin Jin +3 more

Sentiment analysis aims to study, analyse and identify the sentiment polarity contained in subjective documents. In the realm of natural language processing (NLP), the study of sentiment analysis and its subtask research is a hot topic, which has very important significance. The existing sentiment analysis methods based on sentiment lexicon and machine learning take into account contextual semantic information, but these methods still lack the ability to utilize context information, so they cannot effectively encode context information. Inspired by the concept of density matrix in quantum mechanics, we propose a sentiment analysis method, named Complex-valued Quantum-enhanced Long Short-term Memory Neural Network (CQLSTM). It leverages complex-valued embedding to incorporate more semantic information and utilizes the Complex-valued Quantum-enhanced Long Short-term Memory Neural Network for feature extraction. Specifically, a complex-valued neural network based on density matrix is used to capture interactions between words (i.e., the correlation between words). Additionally, the Complex-valued Quantum-enhanced Long Short-term Memory Neural Network, which is inspired by the quantum measurement theory and quantum long short-term memory neural network, is developed to learn interactions between sentences (i.e., contextual semantic information). This approach effectively encodes semantic dependencies, which reflects the dispersion of words in the embedded space of sentences and comprehensively captures interactive information and long-term dependencies among the emotional features between words. Comparative experiments were performed on four sentiment analysis datasets using five traditional models, showcasing the effectiveness of the CQLSTM model.

Axioms•Mar 21, 2024•21 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.
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.
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.
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.
Singular Value Decomposition (SVD) is one of the most useful techniques for analyzing data in linear algebra. SVD decomposes a rectangular real or complex matrix into two orthogonal matrices and one diagonal matrix. In this work we introduce a new approach to improve the preciseness of the standard Quantum Fourier Transform. The presented Quantum-SVD algorithm is based on the singular value decomposition mechanism. While the complexity of the proposed scheme is the same as the standard Quantum Fourier Transform, the precision of the Quantum-SVD approach is some orders higher. The Quantum-SVD approach also exploits the benefits of quantum searching.
Accurately modeling quantum dissipative dynamics remains challenging due to environmental complexity and non-Markovian memory effects. Although machine learning provides a promising alternative to conventional simulation techniques, most existing models employ real-valued neural networks (RVNNs) that inherently mismatch the complex-valued nature of quantum mechanics. By decoupling the real and imaginary parts of the density matrix, RVNNs can obscure essential amplitude-phase correlations, compromising physical consistency. Here, we introduce complex-valued neural networks (CVNNs) as a physics-consistent framework for learning quantum dissipative dynamics. CVNNs operate directly on complex-valued inputs, preserve the algebraic structure of quantum states, and naturally encode quantum coherences. Through numerical benchmarks on the spin-boson model and few variants of the Fenna-Matthews-Olson complex, we demonstrate that CVNNs outperform RVNNs in convergence speed, training stability, and physical fidelity-including significantly improved trace conservation and Hermiticity. These advantages increase with system size and coherence complexity, establishing CVNNs as a robust, scalable, quantum-aware classical approach for simulating open quantum systems in the pre-fault-tolerant quantum era.
Sentiment analysis aims to study, analyse and identify the sentiment polarity contained in subjective documents. In the realm of natural language processing (NLP), the study of sentiment analysis and its subtask research is a hot topic, which has very important significance. The existing sentiment analysis methods based on sentiment lexicon and machine learning take into account contextual semantic information, but these methods still lack the ability to utilize context information, so they cannot effectively encode context information. Inspired by the concept of density matrix in quantum mechanics, we propose a sentiment analysis method, named Complex-valued Quantum-enhanced Long Short-term Memory Neural Network (CQLSTM). It leverages complex-valued embedding to incorporate more semantic information and utilizes the Complex-valued Quantum-enhanced Long Short-term Memory Neural Network for feature extraction. Specifically, a complex-valued neural network based on density matrix is used to capture interactions between words (i.e., the correlation between words). Additionally, the Complex-valued Quantum-enhanced Long Short-term Memory Neural Network, which is inspired by the quantum measurement theory and quantum long short-term memory neural network, is developed to learn interactions between sentences (i.e., contextual semantic information). This approach effectively encodes semantic dependencies, which reflects the dispersion of words in the embedded space of sentences and comprehensively captures interactive information and long-term dependencies among the emotional features between words. Comparative experiments were performed on four sentiment analysis datasets using five traditional models, showcasing the effectiveness of the CQLSTM model.