Intrinsic Flow Matching on Quantum Pure-State Manifolds with Phase-Aligned Transport
- URL: http://arxiv.org/abs/2606.21256v1
- Date: Fri, 19 Jun 2026 09:32:21 GMT
- Title: Intrinsic Flow Matching on Quantum Pure-State Manifolds with Phase-Aligned Transport
- Abstract summary: We introduce Intrinsic Flow Matching (IFM), a deterministic transport framework on $mathbbCPd-1$ that learns tangent velocity fields.<n>IFM replaces local score and reverse-time sampling with manifold probability flow, while horizontal parameterization removes ambient directions.<n> Empirically, IFM often improves over ambient Euclidean flow matching across higher-qubit, multimodal, spin-coherent, physics-inspired, and amplitude-encoded MNIST image-vector benchmarks.
- Score: 31.082191748525137
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum pure-state ensembles live on complex projective space, making flat Euclidean generative modeling geometrically mismatched. We introduce Intrinsic Flow Matching (IFM), a deterministic transport framework on $\mathbb{CP}^{d-1}$ that learns tangent velocity fields using Pancharatnam phase-aligned conditional paths. IFM replaces local score teachers and reverse-time stochastic sampling with manifold probability flow, while horizontal parameterization removes redundant ambient directions. We show that the IFM objective recovers the induced marginal transport field, represents deterministic projective ensemble flows, and yields endpoint and stability guarantees. Empirically, IFM often improves over ambient Euclidean flow matching across higher-qubit, multimodal, spin-coherent, physics-inspired, and amplitude-encoded MNIST image-vector benchmarks, with strongest gains on high-dimensional and coherence-sensitive tasks but not uniformly across every metric.
Related papers
- Topological Flow Matching [56.16372813551555]
Flow matching is a powerful generative modeling framework, valued for its simplicity and strong empirical performance.<n>We introduce topological flow matching, a topology-aware generalization of flow matching.<n>We demonstrate its effectiveness on diverse structured datasets, including brain fMRIs, ocean currents, seismic events, and traffic flows.
arXiv Detail & Related papers (2026-06-14T16:29:33Z) - SpinFlow: A Physics-Informed Spin Field Framework for Traffic Phase Inference and Transition Detection [0.0]
We propose SpinFlow, a physics-informed spin-field framework for macroscopic traffic phase inference.<n>SpinFlow parametrizes spatially varying phase weights via a latent spin vector and a competitive-equilibrium mapping.<n>It achieves $R_q2$ up to 0.940, PED drops of 94.9-100%, and interpretable phase maps that outperform three heterogeneous baselines on forward accuracy, physics consistency, and bottleneck localization.
arXiv Detail & Related papers (2026-05-22T07:25:06Z) - Posterior Augmented Flow Matching [64.1559809786948]
Posterior-Augmented Flow Matching (PAFM) is a generalization of flow matching (FM)<n>We show that PAFM improves over FM by up to 3.4 FID50K across different model scales.
arXiv Detail & Related papers (2026-05-01T17:59:59Z) - Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
arXiv Detail & Related papers (2026-03-11T12:41:46Z) - Entropy-Controlled Flow Matching [0.08460698440162889]
We propose a constrained variational principle over continuity-equation paths enforcing a global entropy-rate budget d/dt H(mu_t) >= -lambda.<n>We obtain certificate-style mode-coverage and density-floor guarantees with Lipschitz, and construct near-optimal counterexamples for unconstrained flow matching.
arXiv Detail & Related papers (2026-02-25T06:07:01Z) - Longitudinal Flow Matching for Trajectory Modeling [7.063657100587108]
We propose Interpolative Multi-Marginal Flow Matching (IMMFM), a framework that learns continuous dynamics jointly consistent with multiple observed time points.<n>IMMFM captures intrinsicity, handles irregular sparse sampling, and yields subject-specific trajectories.<n> Experiments on synthetic benchmarks and real-world longitudinal datasets show that IMMFM outperforms existing methods in both forecasting accuracy and further downstream tasks.
arXiv Detail & Related papers (2025-10-03T23:33:50Z) - Riemannian Variational Flow Matching for Material and Protein Design [37.328940532069424]
In Euclidean space, predicting endpoints (VFM), velocities (FM), or noise (diffusion) are largely equivalent due to affines.<n>On curved manifold, this equivalence breaks down, and we hypothesize that endpoint prediction provides a stronger learning signal.<n>Building on this insight, we derive a variational flow matching objective.<n> Experiments on synthetic spherical and hyperbolic benchmarks, as well as real-world tasks in material and protein generation, demonstrate that RG-VFM more effectively captures manifold structure.
arXiv Detail & Related papers (2025-02-18T16:02:10Z) - Consistency Flow Matching: Defining Straight Flows with Velocity Consistency [97.28511135503176]
We introduce Consistency Flow Matching (Consistency-FM), a novel FM method that explicitly enforces self-consistency in the velocity field.
Preliminary experiments demonstrate that our Consistency-FM significantly improves training efficiency by converging 4.4x faster than consistency models.
arXiv Detail & Related papers (2024-07-02T16:15:37Z) - Interaction-Force Transport Gradient Flows [45.05400562268213]
This paper presents a new gradient flow dissipation geometry over non-negative and probability measures.
Using a precise connection between the Hellinger geometry and the maximum mean discrepancy (MMD), we propose the interaction-force transport (IFT) gradient flows.
arXiv Detail & Related papers (2024-05-27T11:46:14Z) - Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow)
MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints.
We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
arXiv Detail & Related papers (2022-06-29T22:19:03Z) - Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region.
Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
arXiv Detail & Related papers (2022-02-23T06:11:49Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.