Neural Autoregressive Control Variates for the Quantum Monte Carlo Sign Problem

• URL: http://arxiv.org/abs/2605.26814v1
• Date: Tue, 26 May 2026 10:30:44 GMT
• Title: Neural Autoregressive Control Variates for the Quantum Monte Carlo Sign Problem
• Abstract summary: We train a pair of autoregressive models to mitigate the sign problem in quantum Monte Carlo simulations.<n>The two autoregressive networks are confined to the positive- and negative-sign sectors with strictly disjoint support.<n>Their difference is structurally zero-mean, providing an auxiliary observable whose correlation with the sign estimator controls the variance reduction.
• Score: 2.3717692810269586
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We train a pair of autoregressive models to construct zero-mean control variates to mitigate the sign problem in quantum Monte Carlo simulations. The two autoregressive networks are confined to the positive- and negative-sign sectors with strictly disjoint support, and each is exactly normalized over its sector. Their difference is therefore structurally zero-mean, providing an unbiased auxiliary observable whose correlation with the sign estimator controls the variance reduction. We implement the method within the stochastic series expansion framework, which we extend to frustrated lattices by developing an incremental loop-topology update. Sign-ergodic sampling is achieved through a twist channel, which is the unique sign-changing mechanism on non-bipartite lattices. We implement the control variates as autoregressive transformers with an end-of-sequence parity mask that enforces exact sign-sector resolution, while the incremental loop-count change and cumulative frustration parity are incorporated as topological features. On the triangular-lattice Heisenberg antiferromagnet, we benchmark the method in the small-$N$ limit. The control variate reduces the standard error of the average sign by up to an order of magnitude and that of the energy estimator by a factor of three to five, remaining effective even when the average sign drops below $10^{-3}$. This work lays out the framework and provides a proof-of-principle demonstration that autoregressive control variates can effectively mitigate the sign problem. Scaling to larger systems with physics-informed architectures is the subject of future work.

Related papers

• Closing the Loop: PID Feedback Control for Interpretable Activation Steering in Symbolic Music Generation [6.897804369133787]
  This paper investigates the mechanistic interpretability of the Multitrack Music Transformer (MMT)<n>We propose a framework for deterministic attribute modulation without retraining to bridge this gap via inference-time activation steering.
  arXiv  Detail & Related papers  (2026-06-17T08:04:13Z)
• Latent Space Disentanglement via Activation Steering for Interpretable Attribute Control in Symbolic Music Generation [6.897804369133787]
  This paper investigates the mechanistic interpretability of the Multitrack Music Transformer (MMT)<n>We propose a framework for deterministic attribute modulation without retraining to bridge this gap via inference-time activation steering.
  arXiv  Detail & Related papers  (2026-05-29T13:31:56Z)
• Engineering Verifiable Modularity in Transformers via Per-Layer Supervision [0.0]
  Ablating an attention head identified as critical for capitalization produces minimal behavioral change because distributed redundancy compensates for damage.<n>We demonstrate that architectural interventions can expose hidden modularity.<n>This es tablishes a methodology for transforming interpretability from passive observation to active control.
  arXiv  Detail & Related papers  (2026-03-08T05:18:14Z)
• On the Mechanism and Dynamics of Modular Addition: Fourier Features, Lottery Ticket, and Grokking [49.1352577985191]
  We present a comprehensive analysis of how two-layer neural networks learn features to solve the modular addition task.<n>Our work provides a full mechanistic interpretation of the learned model and a theoretical explanation of its training dynamics.
  arXiv  Detail & Related papers  (2026-02-18T20:25:13Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Analysis of Hessian Scaling for Local and Global Costs in Variational Quantum Algorithm [0.42970700836450487]
  We quantify the entrywise resolvability of the Hessian for Variational Quantum Algorithms.<n>We show two distinct scaling regimes that govern the sample complexity required to resolve Hessian entries against shot noise.
  arXiv  Detail & Related papers  (2026-01-31T15:49:23Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Closed-Loop Transformers: Autoregressive Modeling as Iterative Latent Equilibrium [0.6820746164515952]
  We introduce the closed-loop prediction principle, which requires that models iteratively refine latent representations until reaching a self-consistent equilibrium.<n>We instantiate this principle as Equilibrium Transformers, which augment standard transformer layers with an Equilibrium Refinement Module.<n>Preliminary experiments on the binary parity task demonstrate +3.28% average improvement on challenging sequences, with gains reaching +8.07% where standard transformers approach random performance.
  arXiv  Detail & Related papers  (2025-11-26T20:02:59Z)
• Mitigating the sign problem by quantum computing [0.0]
  The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations.<n>A recent proposal of a quantum-computing series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian.<n>Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms.
  arXiv  Detail & Related papers  (2025-09-16T12:44:55Z)
• A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs [54.62268052283014]
  We present a unified theoretical perspective based on the framework of signed graphs.<n>We show that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing.<n>We propose Structural Balanced Propagation (SBP), a plug-and-play method that assigns signed edges based on either labels or feature similarity.
  arXiv  Detail & Related papers  (2025-02-17T03:25:36Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)

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.