Quantum Flow Matching
arXiv:2508. 12413v4 Announce Type: replace-cross Abstract: The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions.
arXiv:2607. 00301v1 Announce Type: new Abstract: The emergence of powerful deep generative models based on diffusion and flow matching has enabled the learning and modeling of complex distributions.
arXiv:2508. 12413v4 Announce Type: replace-cross Abstract: The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions.
arXiv:2508. 19857v3 Announce Type: replace Abstract: Many successful families of generative models leverage a low-dimensional latent distribution that is mapped to a data distribution.
arXiv:2607. 07072v1 Announce Type: new Abstract: Quantum diffusion models provide a physics-consistent route to generative learning by formulating noising and denoising directly on quantum states.
Quantum diffusion models provide a physics-consistent route to generative learning by formulating noising and denoising directly on quantum states. However, applying such models to classical high-dimensional data is constrained by the qubit cost of state encoding and the computational burden of simulating large density operators.
arXiv:2401. 07039v5 Announce Type: replace-cross Abstract: Mixed quantum states are the native description of many physically important quantum systems, making their generation a fundamental task in quantum information processing.
arXiv:2602. 22241v2 Announce Type: replace-cross Abstract: This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing.
arXiv:2606. 08276v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with stochastic environments.
arXiv:2606. 27561v1 Announce Type: new Abstract: Generative models have achieved remarkable success in data synthesis, though recent advances driven by increasing model scale have introduced challenges in computational cost and efficiency.
arXiv:2607. 13722v1 Announce Type: cross Abstract: The potential capabilities of quantum computers motivated the development of cryptographic protocols suitable for securing communication against adversaries with access to large fault-tolerant quantum computers.
arXiv:2608. 11396v1 Announce Type: cross Abstract: Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget.
arXiv:2512. 06695v3 Announce Type: replace Abstract: Quantum generative models exploit quantum superposition and entanglement to enhance learning efficiency for both classical and quantum data.
Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget. For both near-term and early fault-tolerant settings, the measurement protocol must balance statistical efficiency against implementation resources such as circuit depth, connectivity, and entangling-gate count.