Searching for degenerate ground spaces in quantum many-body systems is central to understanding spontaneous symmetry breaking and topological order. Although existing numerical methods can approximate individual ground states with high accuracy, recovering the full degenerate space remains a substantial challenge. Here we tackle this problem using a hybrid generative quantum circuit that combines a classical generative model with an expressive parameterized quantum circuit (PQC). The classical model learns a distribution over PQC parameters, enabling the sampling of an ensemble of ground states, while the PQC ensures compatibility with quantum hardware. To promote both low energy and state diversity, we define an energy-diversity objective composed of an energy-minimization term and cosine-similarity penalties derived from local observable correlators. These local descriptors provide a scalable, measurement-efficient means of distinguishing distinct ground states. We benchmark the framework on the Majumdar-Ghosh model, the Affleck-Kennedy-Lieb-Tasaki model, and the spin-1 XXZ chain, which realize distinct mechanisms of degeneracy. In all cases, the method produces a diverse ensemble whose linear span accurately reproduces the target ground space, in some instances, it identifies an approximately orthogonal basis within the learned ensemble. We further show that the framework remains robust under shot-based estimation and can still recover the degenerate ground space with a reduced measurement budget.
Searching for degenerate ground spaces in quantum many-body systems is central to understanding spontaneous symmetry breaking and topological order. Although existing numerical methods can approximate individual ground states with high accuracy, recovering the full degenerate space remains a substantial challenge. Here we tackle this problem using a hybrid generative quantum circuit that combines a classical generative model with an expressive parameterized quantum circuit (PQC). The classical model learns a distribution over PQC parameters, enabling the sampling of an ensemble of ground states, while the PQC ensures compatibility with quantum hardware. To promote both low energy and state diversity, we define an energy-diversity objective composed of an energy-minimization term and cosine-similarity penalties derived from local observable correlators. These local descriptors provide a scalable, measurement-efficient means of distinguishing distinct ground states. We benchmark the framework on the Majumdar-Ghosh model, the Affleck-Kennedy-Lieb-Tasaki model, and the spin-1 XXZ chain, which realize distinct mechanisms of degeneracy. In all cases, the method produces a diverse ensemble whose linear span accurately reproduces the target ground space, in some instances, it identifies an approximately orthogonal basis within the learned ensemble. We further show that the framework remains robust under shot-based estimation and can still recover the degenerate ground space with a reduced measurement budget.
Predicting ground state energies of quantum many-body systems is one of the central computational challenges in quantum chemistry, physics, and materials science. Krylov subspace methods, such as Krylov Quantum Diagonalization and Sample-based Krylov Quantum Diagonalization, are promising approaches for this task on near-term quantum computers. However, both require repeated quantum circuit executions for each Krylov subspace and for every new Hamiltonian, posing a major bottleneck under noisy hardware constraints. We introduce Generative Krylov Subspace Representations (GenKSR), a framework that learns a classical generative representation of the entire Krylov diagonalization process. To enable effective modeling of quantum systems, GenKSR leverages a conditional generative model framework. We investigate two representative backbone architectures, the standard Transformer and the Mamba state-space model. By learning the distribution of measurement outcomes conditioned on Hamiltonian parameters and evolution time, GenKSR generates Krylov subspace samples for unseen Hamiltonians and for larger subspace dimensions than those used in training. This enables full energy reconstruction purely from the classical model, without additional quantum experiments. We validate our approach through simulations of 15-qubit 1D and 16-qubit 2D Heisenberg models, as well as a hardware experiment on a 20-qubit XXZ chain executed on an IBM quantum processor. Our model successfully learns the distribution from experimental data and generates a high-fidelity representation of the quantum process. This representation enables classical reproduction of experimental outcomes, supports reliable energy estimates for unseen Hamiltonians, and significantly reduces the need for further quantum computation.
Many applications in quantum simulation, quantum chemistry, and quantum machine learning require not a single quantum state but an ensemble of states characterizing the heterogeneity of a target system. Preparing such ensembles state-by-state is prohibitive in both variational and fault-tolerant settings, thereby motivating a generative modeling approach. We introduce latent-conditioned parameterized quantum circuits (LPQCs), a hybrid quantum-classical framework in which classical neural networks map a latent variable sampled from a prior distribution to the parameters of a parameterized quantum circuit. We prove that LPQCs are universal approximators for probability measures over density operators in the 1-Wasserstein distance, extending classical universal approximation theorems to the quantum-distribution setting. We additionally introduce a multimodal latent prior and a mixture-of-experts circuit architecture, and show empirically that the latent-conditioned parameterization alleviates the barren plateau problem during optimization, a behavior for which we provide rigorous partial guarantees. Numerical experiments validate the framework on a synthetic multi-cluster ensemble of mixed quantum states and on a QM9-derived ensemble of 3-D molecular structures. In these tasks, LPQC outperforms recent quantum generative baselines and matches the generation quality of a classical neural-network baseline, while requiring an output dimension that grows only linearly with the number of qubits rather than exponentially. By leveraging classical expressivity in the latent space, LPQCs offer a tractable route to quantum generative modeling.
Resolving degenerate quantum eigenspaces - including topologically ordered ground states and frustrated magnets - requires preparing high-fidelity states that span every direction of the target manifold. Existing variational and projective algorithms do not naturally cover a multi-dimensional degenerate subspace without sequential orthogonality constraints. We introduce the quantum randomized subspace iteration (QRSI), a fully parallel construction that conjugates the Hamiltonian by independent random unitaries across as many branches as the degeneracy g, then invokes any chosen eigenstate-preparation primitive on each branch. The target subspace is identified from the resulting ensemble via standard subspace estimation, either classically through the coefficient matrix or on hardware through Gram-matrix measurements. We prove that the construction spans the full eigenspace almost surely and preserves the spectral gap exactly on every branch. For practical use, we show that these guarantees hold whenever the random rotations satisfy an anti-concentration condition over the degenerate manifold, substantially weaker than full Haar randomness. We demonstrate QRSI on the toric code, recovering all four topological ground states, and on random Hamiltonians with planted degeneracies.
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. Many existing strategies focus on two extremes: hardware-friendly product measurements with high sampling cost, and fully commuting measurements with deep circuits. Here we recast resource-constrained measurement design as a generative learning problem. We introduce FlowMeas, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints. At zero entangling depth, FlowMeas learns qubit-wise commuting measurement schedules and already matches or improves leading product-measurement methods on nearly all molecular benchmarks. Allowing one or two entangling gate layers yields further reductions in energy estimation error of up to 27% relative to the strongest state-independent product-measurement baseline. The learned policy can also be reused across related Hamiltonians, substantially accelerating retraining along a molecular potential-energy surface. We further obtain results for molecular Hamiltonians with up to 20 qubits and apply the framework to a compactly encoded 54-qubit interacting fermionic model, extending the demonstrated scale beyond prior molecular benchmarks. These results establish generative learning as a flexible and unified framework for quantum measurement design under practical resource constraints.
Parameterized quantum circuits (PQCs) are crucial for quantum machine learning and circuit synthesis, enabling the practical implementation of complex quantum tasks. However, PQC learning has been largely confined to classical optimization methods, which suffer from issues like gradient vanishing. In this work, we introduce a nested optimization model, a hybrid approach that leverages quantum gradients to improve PQC learning for arbitrary polynomial-type cost functions. The proposed approach decomposes the learning problem into multiple subproblems, each aimed at learning the state identified by the quantum gradient using current circuit synthesis methods. Leveraging quantum gradients, our method detects unfavorable local stationary points via an adaptive indicator and resolves them with a guided state. Meanwhile, its warm-started, layer-wise expansion reduces susceptibility to barren-plateau. Numerically, we demonstrate the feasibility of the approach on two tasks: the Max-Cut problem and polynomial optimization. Furthermore, we benchmark against standard fixed and adaptive baselines under matched settings on unfavorable local stationary points prone instances together with reduced BP sensitivity. From the perspective of quantum algorithms, our model improves quantum optimization for polynomial-type cost functions, addressing the challenge of exponential sample complexity growth.
Reinforcement learning (RL) can automate quantum architecture search, but its scalability is limited when useful circuit trajectories become rare in the rapidly expanding search space. Existing replay mechanisms reuse observed transitions; the proposed learned model produces additional predicted one step transitions from real state-action seeds. Here we introduce GenQAS, a tensor network-guided RL framework that combines a fixed matrix product state warm-start with prioritized generative replay. A learned local transition model generates synthetic circuit transitions on demand and mixes them with real experience during Double Deep Q-Network updates. Under a random exploration analysis, near ground state circuits occupy a rapidly shrinking region of the accessible state space. We investigate whether real data anchored synthetic replay can improve the effective training signal in this regime. Across chemical Hamiltonian benchmarks from 6 to 12 qubits, GenQAS improves fixed-budget success probability and identifies compact circuits at competitive energy error. At 12 qubits, it improves final success probability by up to 7.0× over passive replay. On a 15-qubit transverse field Ising model, GenQAS increases success probability from 12% to 21%. In a noisy 6-qubit BeH2 transfer experiment, generative replay reduces the steps to chemical accuracy by 92.7%. These results show that generative replay can mitigate sample starvation in quantum architecture search and support more resource efficient circuit discovery.