Skip to main content
Search

# Neural Quantum States

3 related articles

Subscribe to updates
  1. arXiv

    Foundation tensor networks generate ground states straight from the Hamiltonian, pinning glass-transition parameters across 500,000 disorder realizations

    In disordered quantum systems, every disorder realization demands a fresh ground-state solve, so critical-phenomenon studies carry two layers of averaging. Foundation tensor networks (FTNs) use a transformer to generate the projected entangled pair state of the ground state directly from a graph embedding of the Hamiltonian, amortizing optimization over the whole Hamiltonian distribution. With GridBP and replica moment-generating functions, generating, fine-tuning and measuring the overlap parameter for one sample takes under three seconds, and finite-size scaling over 500,000 disorder realizations yields the critical parameters of the quantum Edwards-Anderson model.

  2. arXiv

    Quantum measurement data compressed into a machine-learning model: quantum-classical Monte Carlo reaches chemical accuracy on 40 qubits of Willow

    Hybrid quantum-classical Monte Carlo had been limited by the large classical cost of repeatedly processing quantum measurement data, with hardware demonstrations reaching only 16 qubits. Compressing those measurements into a differentiable machine-learning surrogate that supplies the wavefunction overlaps and derivatives Monte Carlo needs accelerates the end-to-end calculation by orders of magnitude on Google's Willow processor, bringing hydrogen chains and iron-sulfur clusters to chemical accuracy on up to 40 qubits, more than doubling the scale of earlier hardware demonstrations.

  3. arXiv

    Generalization error of Transformer neural quantum states is proven to decay inversely with in-context examples and depth, with required depth scaling only linearly in system size

    This work develops a theoretical framework for the generalization behavior of Transformer-based neural quantum states under in-context learning (ICL): it proves that there exists a Transformer architecture whose pointwise prediction error (MSE) decreases inversely with both the number of in-context examples and the Transformer depth, and that the depth required to achieve this guarantee scales only linearly with system size (the number of particles in continuous systems or qudits in discrete systems); the authors further extend the analysis to full quantum states formulated as rank-one density operators, deriving MSE-based generalization bounds under physical constraints over both continuous and discrete domains, and corroborate the predicted scaling with numerical simulations.

You’re all caught up