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

arXiv:2302.12235

Q-Flow: Generative Modeling for Differential Equations of Open Quantum Dynamics with Normalizing Flows

Dugan, Owen, Lu, Peter Y., Rumen Dangovski, Di Luo, Marin Soljacic A

Published Feb 23, 2023• 1 citation
arXivHTMLPDF

Abstract

Studying the dynamics of open quantum systems can enable breakthroughs both in fundamental physics and applications to quantum engineering and quantum computation. Since the density matrix $ρ$, which is the fundamental description for the dynamics of such systems, is high-dimensional, customized deep generative neural networks have been instrumental in modeling $ρ$. However, the complex-valued nature and normalization constraints of $ρ$, as well as its complicated dynamics, prohibit a seamless connection between open quantum systems and the recent advances in deep generative modeling. Here we lift that limitation by utilizing a reformulation of open quantum system dynamics to a partial differential equation (PDE) for a corresponding probability distribution $Q$, the Husimi Q function. Thus, we model the Q function seamlessly with off-the-shelf deep generative models such as normalizing flows. Additionally, we develop novel methods for learning normalizing flow evolution governed by high-dimensional PDEs based on the Euler method and the application of the time-dependent variational principle. We name the resulting approach $Q$-$Flow$ and demonstrate the scalability and efficiency of Q-Flow on open quantum system simulations, including the dissipative harmonic oscillator and the dissipative bosonic model. Q-Flow is superior to conventional PDE solvers and state-of-the-art physics-informed neural network solvers, especially in high-dimensional systems.

DOI
10.48550/arxiv.2302.12235

Related papers

Learning Hard Quantum Distributions with Generative Neural Networks

Ellen Wang

Quantum computing has the potential to revolutionize numerous aspects of science and engineering, and extensive research in the past decades has been undertaken to exhibit quantum advantage over classical computers. Nevertheless, building robust quantum computers involves enormous technological challenges, and therefore many attempts are devoted to closing the gaps by developing classical simulation algorithms for problems in many body physics. Among these, the most notable are machine learning algorithms. This paper contributes to the development of these toolkits by studying the power of deep generative neural networks, including variational autoencoders and normalizing flows, to represent the distributions generated by quantum computing. The results show that these modern generative networks are only capable of partially capturing features of the quantum system including the overall distribution shapes, but missing the granularities such as local spikes and annihilations in the distributions This incomplete information reconstruction might be due to the inherent limitation of the classical algorithms when encountering the complex quantum states with the exponential growing Hilbert space. The results also show that variational autoencoders perform slightly better than normalizing flows for many cases, and the complimentary strength between the expressibility of variational autoencoders and normalizing flows is observed and worth further exploration.

International Conference on Intelligent Computing in Data Sciences (ICDS)•Oct 23, 2024•0 citations

Quantum Algorithms for Computational Fluid Dynamics

Mario Guillaume Cecile, Nis-Luca van Hülst, Tomohiro Hashizume +19 more

We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.

quant-pharXiv:2609.39962•Oct 1, 2026•0 citations

Applications of Generative Models and Tensor Networks for Neural Quantum States and Imitation Learning

Chen, Brian

Recently developed tools such as neural-network based generative models and incremental tensor networks are promising methods for simplifying the learning of functions in high-dimensional space. We consider the application of these tools in two particular areas: modeling quantum states and imitation learning from high-dimensional data. In the first application, we consider the use of generative models such as normalizing flows as neural quantum states. Because quantum states are functions ψ such that |ψ|2 is a probability density, using normalizing flows as neural quantum states is a natural choice. Neural quantum states are commonly used in Variational Monte Carlo (VMC), where the parameters θ of a parameterized quantum state ψθ are varied in order to minimize some objective function. Due to the ability to exactly sample from and estimate probability densities from normalizing flows, the use of normalizing flows as neural quantum states simplifies the calculation of integrals used in Variational Monte Carlo. This is applied in two settings: first we consider using VMC for minimizing the ground state energy of high-dimensional continuous quantum states. Second, we explore using VMC for numerically solving time-dependent partial differential equations. For the second application, we explore using generative models and incremental tensor networks for extracting a low-dimensional latent space for use in downstream tasks like imitation learning. We first explore the use of neural-network architectures like Variational Autoencoders for learning a latent space that can be sampled from. Doing this allows for synthetic states to be generated, as well as predicted actions for those states. However, the use of these neural network-based feature extractors can be expensive, due to hyperparameter tuning and the gradient-based optimization methods used to find a good latent space representation. We explore the use of incremental tensor network approaches, which can extract a latent space in one pass through the training data and requires minimal hyperparameter tuning. We find that these incremental tensor network approaches learn a latent space representation that leads to similar imitation learning accuracy, but provides significant computational speedups over the neural network approaches.

•Jan 1, 2024•0 citations

Quantum Dynamics via Score Matching on Bohmian Trajectories

Lei Wang

We solve the time-dependent Schrödinger equation by learning the score function, the gradient of the log-probability density, on Bohmian trajectories. In Bohm's formulation of quantum mechanics, particles follow deterministic paths under the classical potential supplemented by a quantum potential depending on the score function of the evolving density. These non-crossing Bohmian trajectories form a continuous normalizing flow governed by the score. We parametrize the score with a neural network and minimize a self-consistent Fisher divergence between the network and the score of the resulting density. We prove that the zero-loss minimizer of this self-consistent objective recovers Schrödinger dynamics for nodeless wave functions, a condition naturally met in quantum vibrations of atoms. We demonstrate the approach on wavepacket splitting in a double-well potential and anharmonic vibrations of a Morse chain. By recasting real-time quantum dynamics as a self-consistent score-driven normalizing flow, this framework opens the time-dependent Schrödinger equation to the rapidly advancing toolkit of modern generative modeling.

quant-pharXiv:2604.25137•Apr 29, 2026•0 citations

Learning Quantum Distributions Based on Normalizing Flow

Li Li, Yong Wang, Shuming Cheng +1 more

Learning many-body quantum systems is of fundamental importance in quantum information processing, however, it is a challenging task which typically requires estimating quantum distributions of dimensionality exponentially scaling to the system size. As generative models have shown a great scalability to learn high-dimensional distributions and found wide applications in the domain of image and text, they can be a powerful tool to facilitate us to accomplish the challenging quantum tasks. In this work, we propose using normalizing flow (NF) models with fast sampling to learn discrete quantum distributions for quantum state tomography. Particularly, three NF models, including denoising flow, argmax flow, and tree flow, are first adapted to the task of explicit quantum probability density estimation. We then perform extensive experiments on a large scale of quantum systems, and our numerical results demonstrate that these discrete NFs admit an excellent sampling efficiency in the sense that they are insensitive to the system size to learn the high-dimensional quantum distributions, without compromising the learning performance. Finally, in comparison to the other generative models, such as autoregressive, the NFs avoid the problem of slow sequential sampling.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2023•0 citations

Flow-based Phase-space Tomography of Continuous-variable Quantum States

Owen Dugan, Rumen Dangovski, Peter Y. Lu +1 more

Continuous-variable quantum state tomography is limited by the cost of resolving non-Gaussian structure in high-dimensional phase space. We introduce QST-Flow, a quantum state tomography framework via flow-based generative modeling that represents experimentally accessible phase-space quasiprobability distributions with normalized, samplable neural densities rather than a truncated density matrix. The framework has two variants: QST-QFlow models the positive Husimi-$Q$ function with a single normalizing flow, while QST-WFlow models sign-changing Wigner functions as a trainable difference of two normalized flows. This construction preserves quasiprobability normalization and enables exact density evaluation, direct sampling, and importance-sampled learning from finite phase-space measurements without a fixed grid. Benchmarks on non-Gaussian cat, binomial, Gottesman-Kitaev-Preskill, number, and Fock states show accurate single-mode reconstructions, extension to multimode states, robustness on noisy Wigner data, and improved reconstruction error compared with prior machine-learning tomography methods. QST-Flow opens a promising route toward scalable, measurement-efficient phase-space tomography of nonclassical bosonic systems.

quant-pharXiv:2607.21584•Jul 24, 2026•0 citations
Studying the dynamics of open quantum systems can enable breakthroughs both in fundamental physics and applications to quantum engineering and quantum computation. Since the density matrix ρρρ, which is the fundamental description for the dynamics of such systems, is high-dimensional, customized deep generative neural networks have been instrumental in modeling ρρρ. However, the complex-valued nature and normalization constraints of ρρρ, as well as its complicated dynamics, prohibit a seamless connection between open quantum systems and the recent advances in deep generative modeling. Here we lift that limitation by utilizing a reformulation of open quantum system dynamics to a partial differential equation (PDE) for a corresponding probability distribution QQQ, the Husimi Q function. Thus, we model the Q function seamlessly with off-the-shelf deep generative models such as normalizing flows. Additionally, we develop novel methods for learning normalizing flow evolution governed by high-dimensional PDEs based on the Euler method and the application of the time-dependent variational principle. We name the resulting approach QQQ-FlowFlowFlow and demonstrate the scalability and efficiency of Q-Flow on open quantum system simulations, including the dissipative harmonic oscillator and the dissipative bosonic model. Q-Flow is superior to conventional PDE solvers and state-of-the-art physics-informed neural network solvers, especially in high-dimensional systems.
Quantum computing has the potential to revolutionize numerous aspects of science and engineering, and extensive research in the past decades has been undertaken to exhibit quantum advantage over classical computers. Nevertheless, building robust quantum computers involves enormous technological challenges, and therefore many attempts are devoted to closing the gaps by developing classical simulation algorithms for problems in many body physics. Among these, the most notable are machine learning algorithms. This paper contributes to the development of these toolkits by studying the power of deep generative neural networks, including variational autoencoders and normalizing flows, to represent the distributions generated by quantum computing. The results show that these modern generative networks are only capable of partially capturing features of the quantum system including the overall distribution shapes, but missing the granularities such as local spikes and annihilations in the distributions This incomplete information reconstruction might be due to the inherent limitation of the classical algorithms when encountering the complex quantum states with the exponential growing Hilbert space. The results also show that variational autoencoders perform slightly better than normalizing flows for many cases, and the complimentary strength between the expressibility of variational autoencoders and normalizing flows is observed and worth further exploration.
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.
Recently developed tools such as neural-network based generative models and incremental tensor networks are promising methods for simplifying the learning of functions in high-dimensional space. We consider the application of these tools in two particular areas: modeling quantum states and imitation learning from high-dimensional data. In the first application, we consider the use of generative models such as normalizing flows as neural quantum states. Because quantum states are functions ψ such that |ψ|2 is a probability density, using normalizing flows as neural quantum states is a natural choice. Neural quantum states are commonly used in Variational Monte Carlo (VMC), where the parameters θ of a parameterized quantum state ψθ are varied in order to minimize some objective function. Due to the ability to exactly sample from and estimate probability densities from normalizing flows, the use of normalizing flows as neural quantum states simplifies the calculation of integrals used in Variational Monte Carlo. This is applied in two settings: first we consider using VMC for minimizing the ground state energy of high-dimensional continuous quantum states. Second, we explore using VMC for numerically solving time-dependent partial differential equations. For the second application, we explore using generative models and incremental tensor networks for extracting a low-dimensional latent space for use in downstream tasks like imitation learning. We first explore the use of neural-network architectures like Variational Autoencoders for learning a latent space that can be sampled from. Doing this allows for synthetic states to be generated, as well as predicted actions for those states. However, the use of these neural network-based feature extractors can be expensive, due to hyperparameter tuning and the gradient-based optimization methods used to find a good latent space representation. We explore the use of incremental tensor network approaches, which can extract a latent space in one pass through the training data and requires minimal hyperparameter tuning. We find that these incremental tensor network approaches learn a latent space representation that leads to similar imitation learning accuracy, but provides significant computational speedups over the neural network approaches.
We solve the time-dependent Schrödinger equation by learning the score function, the gradient of the log-probability density, on Bohmian trajectories. In Bohm's formulation of quantum mechanics, particles follow deterministic paths under the classical potential supplemented by a quantum potential depending on the score function of the evolving density. These non-crossing Bohmian trajectories form a continuous normalizing flow governed by the score. We parametrize the score with a neural network and minimize a self-consistent Fisher divergence between the network and the score of the resulting density. We prove that the zero-loss minimizer of this self-consistent objective recovers Schrödinger dynamics for nodeless wave functions, a condition naturally met in quantum vibrations of atoms. We demonstrate the approach on wavepacket splitting in a double-well potential and anharmonic vibrations of a Morse chain. By recasting real-time quantum dynamics as a self-consistent score-driven normalizing flow, this framework opens the time-dependent Schrödinger equation to the rapidly advancing toolkit of modern generative modeling.
Learning many-body quantum systems is of fundamental importance in quantum information processing, however, it is a challenging task which typically requires estimating quantum distributions of dimensionality exponentially scaling to the system size. As generative models have shown a great scalability to learn high-dimensional distributions and found wide applications in the domain of image and text, they can be a powerful tool to facilitate us to accomplish the challenging quantum tasks. In this work, we propose using normalizing flow (NF) models with fast sampling to learn discrete quantum distributions for quantum state tomography. Particularly, three NF models, including denoising flow, argmax flow, and tree flow, are first adapted to the task of explicit quantum probability density estimation. We then perform extensive experiments on a large scale of quantum systems, and our numerical results demonstrate that these discrete NFs admit an excellent sampling efficiency in the sense that they are insensitive to the system size to learn the high-dimensional quantum distributions, without compromising the learning performance. Finally, in comparison to the other generative models, such as autoregressive, the NFs avoid the problem of slow sequential sampling.
Continuous-variable quantum state tomography is limited by the cost of resolving non-Gaussian structure in high-dimensional phase space. We introduce QST-Flow, a quantum state tomography framework via flow-based generative modeling that represents experimentally accessible phase-space quasiprobability distributions with normalized, samplable neural densities rather than a truncated density matrix. The framework has two variants: QST-QFlow models the positive Husimi-QQQ function with a single normalizing flow, while QST-WFlow models sign-changing Wigner functions as a trainable difference of two normalized flows. This construction preserves quasiprobability normalization and enables exact density evaluation, direct sampling, and importance-sampled learning from finite phase-space measurements without a fixed grid. Benchmarks on non-Gaussian cat, binomial, Gottesman-Kitaev-Preskill, number, and Fock states show accurate single-mode reconstructions, extension to multimode states, robustness on noisy Wigner data, and improved reconstruction error compared with prior machine-learning tomography methods. QST-Flow opens a promising route toward scalable, measurement-efficient phase-space tomography of nonclassical bosonic systems.