Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.15950

Conditional Euclidean-Hamiltonian reductions for sign-problem toy models

Tsogtgerel Gantumur

quant-phcond-mat.str-elhep-latSubmitted Jul 17, 2026• Announced Jul 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Euclidean Monte Carlo methods are effective when the path-integral weight is real and nonnegative, but finite-density fermion systems often produce sign-changing or complex scalar weights after the fermionic sector is traced out. Hamiltonian formulations avoid this complex-weight sampling problem but face rapid Hilbert-space growth. This paper studies a conditional Euclidean-Hamiltonian (CEH) reduction that combines these two descriptions. The calculation is organized around a Monte Carlo-tractable reference problem and a residual active sector. Instead of tracing the active sector into a determinant or scalar weight, CEH keeps it operator-valued and uses the reference calculation to determine projected correlation or transfer matrices. These matrices define a finite effective Hamiltonian, with the remaining finite-density dependence introduced after projection. At finite rank, the result is an effective model whose accuracy must be tested through basis enlargement, metric conditioning, stochastic matrix-element errors, and number-sector diagnostics. The construction is examined in three finite benchmarks. A two-channel oscillator tests conditional basis compression; a positive-measure stochastic calculation tests correlation-matrix harvesting and GEVP extraction, including a comparison with a PDMS-style estimator; and a four-site Hubbard ring combines a finite-budget determinant-sign stress test with finite-density continuation in non-target active spaces. The benchmarks support the proposed trade from scalar sign reweighting to a monitored active-space approximation in structured finite models, but they do not provide an end-to-end stochastic CEH treatment of the Hubbard sign problem or establish favorable scaling. Usefulness requires both low-rank approximability and efficient extraction of the required projected matrix data.

Comments
20 pages, 3 figures, 4 tables

Related papers

Reducing the Sign Problem in Auxiliary Field Monte Carlo Simulations

Gäntgen, Christoph

The numerical sign problem is a hindrance for various areas of research that rely on stochastic sampling methods. It occurs when the sign or phase of the weight function in a path integral is not positive-definite. This leads to cancellations in the Monte Carlo sampling, which can significantly slow down convergence and render the simulation infeasible. Calculations of the Hubbard model are affected by the sign problem when the chemical potential is non-zero or when the spatial lattice is not bipartite. The overall objective of this thesis is the reduction of the sign problem in the Hubbard model with methods that may be applied to other models as well. The approach is to deform the integration contour into complex space and find a transformation that efficiently improves the distribution of the complex phase. The first publication of this cumulative thesis explores the simplest case of such a transformation, which is a constant shift of the real plane in imaginary direction. This transformation showed surprising potential and had the numerical advantage of not requiring the calculation of a Jacobian determinant, as opposed to general transformations. However, it was not obvious which offset would yield the best results. We present an algorithm that numerically approaches the optimal offset iteratively. The drawback of this method is that it relies on Markov Chain Monte Carlo sampling, which comes at significant computational cost and is affected by the sign problem itself, leading to reduced reliability. Therefore, we also present two analytic approximations that can be used directly or as a starting point for the iterative algorithm. To test the method, we calculate single particle correlation functions and the charge expectation value of carbon nanostructures, such as graphene sheets and fullerenes. The second publication introduces a refinement of the iterative optimization algorithm, increasing the stability and convergence speed. This enhancement is achieved by fitting a Gaussian curve to the average phase and its first two derivatives. We again present the physical observables, now including a tetrahedron and a larger honeycomb lattice. Additionally we extract single particle energies from the correlation functions, achieving a good agreement with the exactly solvable tetrahedron. The third publication applies a group equivariant neural network as transformation. The goal was to surpass the limitations of the constant shift while keeping the model as efficient as possible. For this purpose, we encoded the physical symmetries into the model architecture. Results show the potential to reduce the sign problem further than the constant shift. A comparison with dense neural networks shows more efficient use of parameters and training data. Tests with transfer learning lead to mixed results, indicating situational applicability. Overall these developments allow for more efficient calculations of sign problem affected systems.

•Sep 29, 2025•0 citations

Sign-problem-resilient singular-value probe in determinant quantum Monte Carlo

Wen Chen, Rubem Mondaini

The sign problem limits determinant quantum Monte Carlo studies of strongly correlated fermion systems. In the spin-channel Hubbard-Stratonovich decoupling, spin correlations are exactly related to auxiliary-field correlations. This relation implies that an antiferromagnetic transition reorganizes auxiliary-field configurations and thereby changes the statistical structure of the resulting fermion matrices. We use the adjacent gap ratio of low-lying singular values of the space-time fermion matrix to probe interaction-driven transitions in two half-filled honeycomb-lattice Hubbard models. In the sign-free honeycomb Hubbard model, the statistic tracks the established transition from a Dirac semimetal to an antiferromagnetic Mott insulator. In the complex-weight Haldane-Hubbard model, the transition-sensitive feature remains visible in the phase-quenched reference ensemble and occurs near previous estimates of the transition. Moreover, phase reweighting only weakly modifies the gap ratio over the regimes investigated, despite the rapid suppression of the average phase. These results establish singular-value statistics as a sign-problem-resilient probe of interaction-driven transitions in determinant quantum Monte Carlo.

arXiv:2608.19028•Aug 19, 2026•1 citation

Projected density matrix sampling for lattice Hamiltonians

Abhishek Karna, Hansen S. Wu, Shailesh Chandrasekharan A +1 more

Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for computing the low-lying spectrum of generic quantum Hamiltonians within a projection subspace. The method projects the thermal density matrix onto a subspace spanned by a chosen set of linearly independent states. It is free of Trotter discretization errors and systematically converges to the low-energy states which have finite overlap with the projection subspace as the $β$ parameter increases. While most effective for systems without a sign problem, the method also yields information about low-energy spectra when sign problems are present. We illustrate the approach on two problems. For the sign-free case, we compute the first four low-energy levels in the scaling limit of the one-dimensional Ising model with both transverse and longitudinal fields, demonstrating the flow from the conformal limit to the massive $E_8$ quantum field theory. For the sign-problem case, we apply the method to the frustrated Shastry-Sutherland model and benchmark it against exact diagonalization on small lattices. We also present results for larger systems beyond the lattice sizes accessible to exact diagonalization, while limited to small $β$ where sign problems occur. Our method provides a general route toward quantum Monte Carlo spectroscopy for lattice Hamiltonians.

arXiv:2511.19209•Physical review. D/Physical review. D.•Feb 25, 2026•1 citation

Calculating ground-state properties of correlated fermionic systems with BCS trial wave functions in Slater determinant path-integral approaches

Ettore Vitali, Peter Rosenberg, Shiwei Zhang

We introduce an efficient and numerically stable technique to make use of a BCS trial wave function in the computation of correlation functions of strongly correlated quantum fermion systems. The technique is applicable to any projection approach involving paths of independent-fermion propagators, for example, in mean-field or auxiliary-field quantum Monte Carlo (AFQMC) calculations. Within AFQMC, in the absence of the sign problem, the methodology allows the use of a BCS reference state which can greatly reduce the required imaginary time of projection and improves Monte Carlo sampling efficiency and statistical accuracy for systems where pairing correlations are important. When the sign problem is present, the approach provides a powerful generalization of the constrained-path AFQMC technique which usually uses Slater determinant trial wave functions. As a demonstration of the capability of the methodology, we present benchmark results for the attractive Hubbard model, both spin balanced (no sign problem) and with a finite spin polarization (with sign problem).

arXiv:1905.05012•Physical Review A•Aug 23, 2019•16 citations

AUXILIARY FIELDS AND THE SIGN PROBLEM

J. H. Samson

The auxiliary-field quantum Monte Carlo method is reviewed. The Hubbard-Stratonovich transformation converts an interacting Hamiltonian into a non-interacting Hamiltonian in a time-dependent stochastic field, allowing calculation of the resulting functional integral by Monte Carlo methods. The method is presented in a sufficiently general form to be applicable to any Hamiltonian with one- and two-body terms, with special reference to the Heisenberg model and one- and many-band Hubbard models. Many physical correlation functions can be related to correlation functions of the auxiliary field; general results are given here. Issues relating to the choice of auxiliary fields are addressed; operator product identities change the relative dimensionalities of the attractive and repulsive parts of the interaction. Frequently the integrand is not positive-definite, rendering numerical evaluation unstable. If the auxiliary field violates time-reversal invariance, the integrand is complex and this sign problem becomes a phase problem. The origin of this sign or phase is examined from a number of geometrical and other viewpoints and illustrated by simple examples: the phase problem by the spin (1/2) Heisenberg model, and the sign problem by the attractive SU(N) Hubbard model on a triangular molecule with negative hopping integrals. In the latter case, widely studied in the Jahn-Teller literature, the sign is due neither to fermions nor spin, but to frustration. This system is used to illustrate a number of suggested interpretations of the sign problem.

International Journal of Modern Physics C•Jun 1, 1995•4 citations

Neural Autoregressive Control Variates for the Quantum Monte Carlo Sign Problem

Bei Qiao, Lei Wang

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.

arXiv:2605.26814•May 26, 2026•2 citations
Euclidean Monte Carlo methods are effective when the path-integral weight is real and nonnegative, but finite-density fermion systems often produce sign-changing or complex scalar weights after the fermionic sector is traced out. Hamiltonian formulations avoid this complex-weight sampling problem but face rapid Hilbert-space growth. This paper studies a conditional Euclidean-Hamiltonian (CEH) reduction that combines these two descriptions.
The calculation is organized around a Monte Carlo-tractable reference problem and a residual active sector. Instead of tracing the active sector into a determinant or scalar weight, CEH keeps it operator-valued and uses the reference calculation to determine projected correlation or transfer matrices. These matrices define a finite effective Hamiltonian, with the remaining finite-density dependence introduced after projection. At finite rank, the result is an effective model whose accuracy must be tested through basis enlargement, metric conditioning, stochastic matrix-element errors, and number-sector diagnostics.
The construction is examined in three finite benchmarks. A two-channel oscillator tests conditional basis compression; a positive-measure stochastic calculation tests correlation-matrix harvesting and GEVP extraction, including a comparison with a PDMS-style estimator; and a four-site Hubbard ring combines a finite-budget determinant-sign stress test with finite-density continuation in non-target active spaces. The benchmarks support the proposed trade from scalar sign reweighting to a monitored active-space approximation in structured finite models, but they do not provide an end-to-end stochastic CEH treatment of the Hubbard sign problem or establish favorable scaling. Usefulness requires both low-rank approximability and efficient extraction of the required projected matrix data.
The numerical sign problem is a hindrance for various areas of research that rely on stochastic sampling methods. It occurs when the sign or phase of the weight function in a path integral is not positive-definite. This leads to cancellations in the Monte Carlo sampling, which can significantly slow down convergence and render the simulation infeasible. Calculations of the Hubbard model are affected by the sign problem when the chemical potential is non-zero or when the spatial lattice is not bipartite. The overall objective of this thesis is the reduction of the sign problem in the Hubbard model with methods that may be applied to other models as well. The approach is to deform the integration contour into complex space and find a transformation that efficiently improves the distribution of the complex phase. The first publication of this cumulative thesis explores the simplest case of such a transformation, which is a constant shift of the real plane in imaginary direction. This transformation showed surprising potential and had the numerical advantage of not requiring the calculation of a Jacobian determinant, as opposed to general transformations. However, it was not obvious which offset would yield the best results. We present an algorithm that numerically approaches the optimal offset iteratively. The drawback of this method is that it relies on Markov Chain Monte Carlo sampling, which comes at significant computational cost and is affected by the sign problem itself, leading to reduced reliability. Therefore, we also present two analytic approximations that can be used directly or as a starting point for the iterative algorithm. To test the method, we calculate single particle correlation functions and the charge expectation value of carbon nanostructures, such as graphene sheets and fullerenes. The second publication introduces a refinement of the iterative optimization algorithm, increasing the stability and convergence speed. This enhancement is achieved by fitting a Gaussian curve to the average phase and its first two derivatives. We again present the physical observables, now including a tetrahedron and a larger honeycomb lattice. Additionally we extract single particle energies from the correlation functions, achieving a good agreement with the exactly solvable tetrahedron. The third publication applies a group equivariant neural network as transformation. The goal was to surpass the limitations of the constant shift while keeping the model as efficient as possible. For this purpose, we encoded the physical symmetries into the model architecture. Results show the potential to reduce the sign problem further than the constant shift. A comparison with dense neural networks shows more efficient use of parameters and training data. Tests with transfer learning lead to mixed results, indicating situational applicability. Overall these developments allow for more efficient calculations of sign problem affected systems.
The sign problem limits determinant quantum Monte Carlo studies of strongly correlated fermion systems. In the spin-channel Hubbard-Stratonovich decoupling, spin correlations are exactly related to auxiliary-field correlations. This relation implies that an antiferromagnetic transition reorganizes auxiliary-field configurations and thereby changes the statistical structure of the resulting fermion matrices. We use the adjacent gap ratio of low-lying singular values of the space-time fermion matrix to probe interaction-driven transitions in two half-filled honeycomb-lattice Hubbard models. In the sign-free honeycomb Hubbard model, the statistic tracks the established transition from a Dirac semimetal to an antiferromagnetic Mott insulator. In the complex-weight Haldane-Hubbard model, the transition-sensitive feature remains visible in the phase-quenched reference ensemble and occurs near previous estimates of the transition. Moreover, phase reweighting only weakly modifies the gap ratio over the regimes investigated, despite the rapid suppression of the average phase. These results establish singular-value statistics as a sign-problem-resilient probe of interaction-driven transitions in determinant quantum Monte Carlo.
Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for computing the low-lying spectrum of generic quantum Hamiltonians within a projection subspace. The method projects the thermal density matrix onto a subspace spanned by a chosen set of linearly independent states. It is free of Trotter discretization errors and systematically converges to the low-energy states which have finite overlap with the projection subspace as the βββ parameter increases. While most effective for systems without a sign problem, the method also yields information about low-energy spectra when sign problems are present. We illustrate the approach on two problems. For the sign-free case, we compute the first four low-energy levels in the scaling limit of the one-dimensional Ising model with both transverse and longitudinal fields, demonstrating the flow from the conformal limit to the massive E8E_8E8​ quantum field theory. For the sign-problem case, we apply the method to the frustrated Shastry-Sutherland model and benchmark it against exact diagonalization on small lattices. We also present results for larger systems beyond the lattice sizes accessible to exact diagonalization, while limited to small βββ where sign problems occur. Our method provides a general route toward quantum Monte Carlo spectroscopy for lattice Hamiltonians.
We introduce an efficient and numerically stable technique to make use of a BCS trial wave function in the computation of correlation functions of strongly correlated quantum fermion systems. The technique is applicable to any projection approach involving paths of independent-fermion propagators, for example, in mean-field or auxiliary-field quantum Monte Carlo (AFQMC) calculations. Within AFQMC, in the absence of the sign problem, the methodology allows the use of a BCS reference state which can greatly reduce the required imaginary time of projection and improves Monte Carlo sampling efficiency and statistical accuracy for systems where pairing correlations are important. When the sign problem is present, the approach provides a powerful generalization of the constrained-path AFQMC technique which usually uses Slater determinant trial wave functions. As a demonstration of the capability of the methodology, we present benchmark results for the attractive Hubbard model, both spin balanced (no sign problem) and with a finite spin polarization (with sign problem).
The auxiliary-field quantum Monte Carlo method is reviewed. The Hubbard-Stratonovich transformation converts an interacting Hamiltonian into a non-interacting Hamiltonian in a time-dependent stochastic field, allowing calculation of the resulting functional integral by Monte Carlo methods. The method is presented in a sufficiently general form to be applicable to any Hamiltonian with one- and two-body terms, with special reference to the Heisenberg model and one- and many-band Hubbard models. Many physical correlation functions can be related to correlation functions of the auxiliary field; general results are given here. Issues relating to the choice of auxiliary fields are addressed; operator product identities change the relative dimensionalities of the attractive and repulsive parts of the interaction. Frequently the integrand is not positive-definite, rendering numerical evaluation unstable. If the auxiliary field violates time-reversal invariance, the integrand is complex and this sign problem becomes a phase problem. The origin of this sign or phase is examined from a number of geometrical and other viewpoints and illustrated by simple examples: the phase problem by the spin (1/2) Heisenberg model, and the sign problem by the attractive SU(N) Hubbard model on a triangular molecule with negative hopping integrals. In the latter case, widely studied in the Jahn-Teller literature, the sign is due neither to fermions nor spin, but to frustration. This system is used to illustrate a number of suggested interpretations of the sign problem.
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-NNN 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−310^{-3}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.