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

IEEE Access

DEMANDE: Density Matrix Neural Density Estimation

Joseph A. Gallego-Mejia, Fabio Augusto Gonzalez

Published Jan 1, 2023• 3 citations
Publisher

Abstract

Density estimation is a fundamental task in statistics and machine learning that aims to estimate, from a set of samples, the probability density function of the distribution that generated them. There are different methods for addressing this problem but recently deep-neural density estimation methods have emerged as a powerful alternative. This paper presents a novel method for neural density estimation based on density matrices and adaptive Fourier features. Density matrices are commonly used in quantum mechanics to represent the quantum state of a physical system. In this work, they are used to estimate probability densities using an operation called quantum measurement. The proposed method can be trained without optimization using an averaging operation over the samples of the training dataset. It can also be integrated with deep learning architectures and trained using gradient descent. The performance of the proposed method was evaluated on a range of synthetic and real datasets and compared with fast kernel density estimation and state-of-the-art neural density estimation methods. The results demonstrate that the proposed method achieves competitive performance while being faster and more efficient than existing methods.

DOI
10.1109/access.2023.3279123

Related papers

Quantum Adaptive Fourier Features for Neural Density Estimation

Joseph A. Gallego-Mejia, Fabio Augusto Gonzalez

Density estimation is a fundamental task in statistics and machine learning applications. Kernel density estimation is a powerful tool for non-parametric density estimation in low dimensions; however, its performance is poor in higher dimensions. Moreover, its prediction complexity scale linearly with more training data points. This paper presents a method for neural density estimation that can be seen as a type of kernel density estimation, but without the high prediction computational complexity. The method is based on density matrices, a formalism used in quantum mechanics, and adaptive Fourier features. The method can be trained without optimization, but it could be also integrated with deep learning architectures and trained using gradient descent. Thus, it could be seen as a form of neural density estimation method. The method was evaluated in different synthetic and real datasets, and its performance compared against state-of-the-art neural density estimation methods, obtaining competitive results.

arXiv:2208.00564•Aug 1, 2022•10 citations

Learning with density matrices and random features

Fabio Augusto Gonzalez, Joseph A. Gallego-Mejia, Santiago Toledo-Cortés +1 more

Abstract A density matrix describes the statistical state of a quantum system. It is a powerful formalism to represent both the quantum and classical uncertainty of quantum systems and to express different statistical operations such as measurement, system combination and expectations as linear algebra operations. This paper explores how density matrices can be used as a building block for machine learning models exploiting their ability to straightforwardly combine linear algebra and probability. One of the main results of the paper is to show that density matrices coupled with random Fourier features could approximate arbitrary probability distributions over $$\mathbb {R}^{n}$$ R n . Based on this finding the paper builds different models for density estimation, classification and regression. These models are differentiable, so it is possible to integrate them with other differentiable components, such as deep learning architectures and to learn their parameters using gradient-based optimization. In addition, the paper presents optimization-less training strategies based on estimation and model averaging. The models are evaluated in benchmark tasks and the results are reported and discussed.

arXiv:2102.04394•Quantum Machine Intelligence•Aug 25, 2022•35 citations

Quantum density estimation with density matrices: Application to quantum anomaly detection

Diego H. Useche, Oscar A. Bustos-Brinez, Joseph A. Gallego-Mejia +1 more

Density estimation is a central task in statistics and machine learning. This problem aims to determine the underlying probability density function that best aligns with an observed dataset. Some of its applications include statistical inference, unsupervised learning, and anomaly detection. Despite its relevance, few works have explored the application of quantum computing to density estimation. In this article, we present a quantum-classical density-matrix density estimation model, called Q-DEMDE, based on the expected values of density matrices and a quantum embedding called quantum Fourier features. The method uses quantum hardware to build probability distributions of training data via mixed quantum states. As a core subroutine, we propose an algorithm to estimate the expected value of a mixed density matrix from its spectral decomposition on a quantum computer. In addition, we present an application of the method for quantum-classical anomaly detection. We evaluated the density estimation model with quantum random and quantum adaptive Fourier features on different datasets on a quantum simulator and a real quantum computer. An important result of this work is to show that it is possible to perform density estimation and anomaly detection with high performance on present-day quantum computers.

arXiv:2201.10006•Physical Review A•Mar 19, 2024•12 citations

Neural Fourier Surrogates for Data Reuploading Quantum Neural Networks

Oliver Knitter, Jonathan Mei, Sang Hyub Kim +3 more

For quantum machine learning, the exact boundary between classical and quantum advantage is still poorly understood. Direct comparison between quantum neural networks (QNNs) and existing classical models, which encompass fundamentally different function classes, often fails to provide broader insight into the difference between the two. Inspired by the techniques of Neural Quantum States and Random Fourier Features, this work introduces Neural Fourier Surrogates (NFS), a stochastic classical neural network architecture for efficiently learning coefficients over the same finite Fourier series support as quantum neural networks. Testing on a selection of tabular benchmark datasets, we find that NFS is an effective classifier architecture broadly competitive with established classical baselines, including a comparable Random Fourier Features model, and possessing comparable performance to data-reuploading QNNs; combined with additional analysis comparing the learned Fourier spectra of QNNs and NFS on synthetic data, these results establish NFS as a natural classical baseline for evaluating QNN performance.

quant-pharXiv:2610.00841•Oct 2, 2026•1 citation

Quantum state estimation based on deep learning

Haowen 皓文 Xiao 肖, Zhiguang Han

Abstract We used deep learning techniques to construct various models for reconstructing quantum states from a given set of coincidence measurements. Through simulations, we have demonstrated that our approach generates functionally equivalent reconstructed states for a wide range of pure and mixed input states. Compared with traditional methods, our system offers the advantage of faster speed. Additionally, by training our system with measurement results containing simulated noise sources, the system shows a significant improvement in average fidelity compared with typical reconstruction methods. We also found that constraining the variational manifold to physical states, i.e., positive semi-definite density matrices, greatly enhances the quality of the reconstructed states in the presence of experimental imperfections and noise. Finally, we validated the correctness and superiority of our model by using data generated on IBM Quantum Platform, a real quantum computer.

Chinese Physics B•Sep 10, 2024•1 citation

Deep-learning density functionals for gradient descent optimization

Emanuele Costa, Giuseppe Scriva, Rosario Fazio +1 more

Machine-learned regression models represent a promising tool to implement accurate and computationally affordable energy-density functionals to solve quantum many-body problems via density functional theory. However, while they can easily be trained to accurately map ground-state density profiles to the corresponding energies, their functional derivatives often turn out to be too noisy, leading to instabilities in self-consistent iterations and in gradient-based searches of the ground-state density profile. We investigate how these instabilities occur when standard deep neural networks are adopted as regression models, and we show how to avoid them by using an ad hoc convolutional architecture featuring an interchannel averaging layer. The main testbed we consider is a realistic model for noninteracting atoms in optical speckle disorder. With the interchannel average, accurate and systematically improvable ground-state energies and density profiles are obtained via gradient-descent optimization, without instabilities nor violations of the variational principle.

arXiv:2205.08367•Physical review. E•Oct 21, 2022•8 citations
Density estimation is a fundamental task in statistics and machine learning that aims to estimate, from a set of samples, the probability density function of the distribution that generated them. There are different methods for addressing this problem but recently deep-neural density estimation methods have emerged as a powerful alternative. This paper presents a novel method for neural density estimation based on density matrices and adaptive Fourier features. Density matrices are commonly used in quantum mechanics to represent the quantum state of a physical system. In this work, they are used to estimate probability densities using an operation called quantum measurement. The proposed method can be trained without optimization using an averaging operation over the samples of the training dataset. It can also be integrated with deep learning architectures and trained using gradient descent. The performance of the proposed method was evaluated on a range of synthetic and real datasets and compared with fast kernel density estimation and state-of-the-art neural density estimation methods. The results demonstrate that the proposed method achieves competitive performance while being faster and more efficient than existing methods.
Density estimation is a fundamental task in statistics and machine learning applications. Kernel density estimation is a powerful tool for non-parametric density estimation in low dimensions; however, its performance is poor in higher dimensions. Moreover, its prediction complexity scale linearly with more training data points. This paper presents a method for neural density estimation that can be seen as a type of kernel density estimation, but without the high prediction computational complexity. The method is based on density matrices, a formalism used in quantum mechanics, and adaptive Fourier features. The method can be trained without optimization, but it could be also integrated with deep learning architectures and trained using gradient descent. Thus, it could be seen as a form of neural density estimation method. The method was evaluated in different synthetic and real datasets, and its performance compared against state-of-the-art neural density estimation methods, obtaining competitive results.
Abstract A density matrix describes the statistical state of a quantum system. It is a powerful formalism to represent both the quantum and classical uncertainty of quantum systems and to express different statistical operations such as measurement, system combination and expectations as linear algebra operations. This paper explores how density matrices can be used as a building block for machine learning models exploiting their ability to straightforwardly combine linear algebra and probability. One of the main results of the paper is to show that density matrices coupled with random Fourier features could approximate arbitrary probability distributions over Rn\mathbb {R}^{n}Rn R n . Based on this finding the paper builds different models for density estimation, classification and regression. These models are differentiable, so it is possible to integrate them with other differentiable components, such as deep learning architectures and to learn their parameters using gradient-based optimization. In addition, the paper presents optimization-less training strategies based on estimation and model averaging. The models are evaluated in benchmark tasks and the results are reported and discussed.
Density estimation is a central task in statistics and machine learning. This problem aims to determine the underlying probability density function that best aligns with an observed dataset. Some of its applications include statistical inference, unsupervised learning, and anomaly detection. Despite its relevance, few works have explored the application of quantum computing to density estimation. In this article, we present a quantum-classical density-matrix density estimation model, called Q-DEMDE, based on the expected values of density matrices and a quantum embedding called quantum Fourier features. The method uses quantum hardware to build probability distributions of training data via mixed quantum states. As a core subroutine, we propose an algorithm to estimate the expected value of a mixed density matrix from its spectral decomposition on a quantum computer. In addition, we present an application of the method for quantum-classical anomaly detection. We evaluated the density estimation model with quantum random and quantum adaptive Fourier features on different datasets on a quantum simulator and a real quantum computer. An important result of this work is to show that it is possible to perform density estimation and anomaly detection with high performance on present-day quantum computers.
For quantum machine learning, the exact boundary between classical and quantum advantage is still poorly understood. Direct comparison between quantum neural networks (QNNs) and existing classical models, which encompass fundamentally different function classes, often fails to provide broader insight into the difference between the two. Inspired by the techniques of Neural Quantum States and Random Fourier Features, this work introduces Neural Fourier Surrogates (NFS), a stochastic classical neural network architecture for efficiently learning coefficients over the same finite Fourier series support as quantum neural networks. Testing on a selection of tabular benchmark datasets, we find that NFS is an effective classifier architecture broadly competitive with established classical baselines, including a comparable Random Fourier Features model, and possessing comparable performance to data-reuploading QNNs; combined with additional analysis comparing the learned Fourier spectra of QNNs and NFS on synthetic data, these results establish NFS as a natural classical baseline for evaluating QNN performance.
Abstract We used deep learning techniques to construct various models for reconstructing quantum states from a given set of coincidence measurements. Through simulations, we have demonstrated that our approach generates functionally equivalent reconstructed states for a wide range of pure and mixed input states. Compared with traditional methods, our system offers the advantage of faster speed. Additionally, by training our system with measurement results containing simulated noise sources, the system shows a significant improvement in average fidelity compared with typical reconstruction methods. We also found that constraining the variational manifold to physical states, i.e., positive semi-definite density matrices, greatly enhances the quality of the reconstructed states in the presence of experimental imperfections and noise. Finally, we validated the correctness and superiority of our model by using data generated on IBM Quantum Platform, a real quantum computer.
Machine-learned regression models represent a promising tool to implement accurate and computationally affordable energy-density functionals to solve quantum many-body problems via density functional theory. However, while they can easily be trained to accurately map ground-state density profiles to the corresponding energies, their functional derivatives often turn out to be too noisy, leading to instabilities in self-consistent iterations and in gradient-based searches of the ground-state density profile. We investigate how these instabilities occur when standard deep neural networks are adopted as regression models, and we show how to avoid them by using an ad hoc convolutional architecture featuring an interchannel averaging layer. The main testbed we consider is a realistic model for noninteracting atoms in optical speckle disorder. With the interchannel average, accurate and systematically improvable ground-state energies and density profiles are obtained via gradient-descent optimization, without instabilities nor violations of the variational principle.