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:2508.14382 · Physical Review Research

Stoquasticity is not enough: Towards a sharper diagnostic for Quantum Monte Carlo simulability

Anonymous

Published Aug 10, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum Monte Carlo (QMC) methods are powerful tools for simulating quantum many-body systems, yet their applicability is limited by the infamous sign problem. We approach this challenge through the lens of Vanishing Geometric Phases (VGP) \cite{Hen_2021}, introducing it as a `geometric' criterion for diagnosing QMC simulability. We characterize the class of VGP Hamiltonians, and analyze the complexity of recognizing this class, identifying both hard and efficiently identifiable cases. We further highlight the practical advantage of the VGP criterion by exhibiting specific Hamiltonians that are readily identified as sign-problem-free through VGP, yet whose stoquasticity is difficult to ascertain. These examples underscore the efficiency and sharpness of VGP as a diagnostic tool compared to stoquasticity-based heuristics. Beyond classification, we propose a family of VGP-inspired diagnostics that serve as quantitative indicators of sign problem severity. While exact evaluation of these quantities is generically intractable, we demonstrate their mathematical power in performing scaling analysis for the average sign under unitary transformations. Our results provide both a conceptual foundation and practical tools for understanding and mitigating the sign problem.

DOI
10.1103/zpjk-p5yj

Related papers

Determining quantum Monte Carlo simulability with geometric phases

Itay Hen

Although stoquastic Hamiltonians are known to be simulable via sign-problem-free quantum Monte Carlo (QMC) techniques, the nonstoquasticity of a Hamiltonian does not necessarily imply the existence of a QMC sign problem.We give a sufficient and necessary condition for the QMC-simulability of Hamiltonians in a given basis: We prove that a QMC simulation will be sign-problem-free if and only if all the overall total phases along the chordless cycles of the weighted graph whose adjacency matrix is the Hamiltonian are zero (modulo 2π ).We use our findings to provide a construction for nonstoquastic, yet sign-problem-free and hence QMC-simulable, quantum many-body models.We also demonstrate why the simulation of truly sign-problematic models using the QMC weights of the stoquasticized Hamiltonian is generally suboptimal.We offer a superior alternative.

arXiv:2012.02022•Physical Review Research•Apr 29, 2021•23 citations

On the computational complexity of curing non-stoquastic Hamiltonians

Milad Marvian, Daniel A. Lidar, Itay Hen

Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with 'curing' non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.

arXiv:1802.03408•Nature Communications•Apr 5, 2019•74 citations

Easing the Monte Carlo sign problem

Dominik Hangleiter, Ingo Roth, Daniel Nagaj +1 more

Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems. However, in many interesting situations, QMC methods are faced with a sign problem, causing the severe limitation of an exponential increase in the runtime of the QMC algorithm. In this work, we develop a systematic, generally applicable, and practically feasible methodology for easing the sign problem by efficiently computable basis changes and use it to rigorously assess the sign problem. Our framework introduces measures of non-stoquasticity that-as we demonstrate analytically and numerically-at the same time provide a practically relevant and efficiently computable figure of merit for the severity of the sign problem. Complementing this pragmatic mindset, we prove that easing the sign problem in terms of those measures is generally an NP-complete task for nearest-neighbor Hamiltonians and simple basis choices by a reduction to the MAXCUT-problem.

arXiv:1906.02309•Science Advances•Aug 14, 2020•110 citations

Complexity of geometrically local stoquastic Hamiltonians

Asad Raza, Jens Eisert, Alex B. Grilo

The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum many-body physics. Since its proposal, substantial effort has been invested in better understanding the problem for physically motivated important families of Hamiltonians. In particular, the QMA-completeness of approximating the ground state energy of local Hamiltonians has been extended to the case where the Hamiltonians are geometrically local in one and two spatial dimensions. Among those physically motivated Hamiltonians, stoquastic Hamiltonians play a particularly crucial role, as they constitute the manifestly sign-free Hamiltonians in Monte Carlo approaches. Interestingly, for such Hamiltonians, the problem at hand becomes more ''classical'', being hard for the class MA (the randomized version of NP) and its complexity has tight connections with derandomization. In this work, we prove that both the two- and one-dimensional geometrically local analogues remain MA-hard with high enough qudit dimension. Moreover, we show that related problems are StoqMA-complete.

arXiv:2407.15499•Quantum•Feb 11, 2026•5 citations

Quantum computing quantum Monte Carlo algorithm

Yukun Zhang, Yifei Huang, Jinzhao Sun +2 more

Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N$_2$ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.

arXiv:2206.10431•Physical Review A•Jul 21, 2025•33 citations

Mitigating the sign problem by quantum computing

Kwai-Kong Ng, Min-Fong Yang

The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian. Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms. Instead, it provides a practical mitigation strategy that suppresses the occurrence of negative weights. Using the antiferromagnetic anisotropic XY chain as a test case, we analyze the dependence of the average sign on system size, temperature, anisotropy, and shift parameters. An operator contraction method is introduced to improve efficiency. Our results demonstrate that moderate shifts optimally balance sign mitigation and statistical accuracy, while large shifts amplify errors, leaving the sign problem unresolved but alleviated.

arXiv:2509.13017•Physical Review A•Feb 25, 2026•0 citations
Quantum Monte Carlo (QMC) methods are powerful tools for simulating quantum many-body systems, yet their applicability is limited by the infamous sign problem. We approach this challenge through the lens of Vanishing Geometric Phases (VGP) \cite{Hen_2021}, introducing it as a `geometric' criterion for diagnosing QMC simulability. We characterize the class of VGP Hamiltonians, and analyze the complexity of recognizing this class, identifying both hard and efficiently identifiable cases. We further highlight the practical advantage of the VGP criterion by exhibiting specific Hamiltonians that are readily identified as sign-problem-free through VGP, yet whose stoquasticity is difficult to ascertain. These examples underscore the efficiency and sharpness of VGP as a diagnostic tool compared to stoquasticity-based heuristics. Beyond classification, we propose a family of VGP-inspired diagnostics that serve as quantitative indicators of sign problem severity. While exact evaluation of these quantities is generically intractable, we demonstrate their mathematical power in performing scaling analysis for the average sign under unitary transformations. Our results provide both a conceptual foundation and practical tools for understanding and mitigating the sign problem.
Although stoquastic Hamiltonians are known to be simulable via sign-problem-free quantum Monte Carlo (QMC) techniques, the nonstoquasticity of a Hamiltonian does not necessarily imply the existence of a QMC sign problem.We give a sufficient and necessary condition for the QMC-simulability of Hamiltonians in a given basis: We prove that a QMC simulation will be sign-problem-free if and only if all the overall total phases along the chordless cycles of the weighted graph whose adjacency matrix is the Hamiltonian are zero (modulo 2π ).We use our findings to provide a construction for nonstoquastic, yet sign-problem-free and hence QMC-simulable, quantum many-body models.We also demonstrate why the simulation of truly sign-problematic models using the QMC weights of the stoquasticized Hamiltonian is generally suboptimal.We offer a superior alternative.
Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with 'curing' non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.
Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems. However, in many interesting situations, QMC methods are faced with a sign problem, causing the severe limitation of an exponential increase in the runtime of the QMC algorithm. In this work, we develop a systematic, generally applicable, and practically feasible methodology for easing the sign problem by efficiently computable basis changes and use it to rigorously assess the sign problem. Our framework introduces measures of non-stoquasticity that-as we demonstrate analytically and numerically-at the same time provide a practically relevant and efficiently computable figure of merit for the severity of the sign problem. Complementing this pragmatic mindset, we prove that easing the sign problem in terms of those measures is generally an NP-complete task for nearest-neighbor Hamiltonians and simple basis choices by a reduction to the MAXCUT-problem.
The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum many-body physics. Since its proposal, substantial effort has been invested in better understanding the problem for physically motivated important families of Hamiltonians. In particular, the QMA-completeness of approximating the ground state energy of local Hamiltonians has been extended to the case where the Hamiltonians are geometrically local in one and two spatial dimensions. Among those physically motivated Hamiltonians, stoquastic Hamiltonians play a particularly crucial role, as they constitute the manifestly sign-free Hamiltonians in Monte Carlo approaches. Interestingly, for such Hamiltonians, the problem at hand becomes more ''classical'', being hard for the class MA (the randomized version of NP) and its complexity has tight connections with derandomization. In this work, we prove that both the two- and one-dimensional geometrically local analogues remain MA-hard with high enough qudit dimension. Moreover, we show that related problems are StoqMA-complete.
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N2_22​ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.
The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian. Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms. Instead, it provides a practical mitigation strategy that suppresses the occurrence of negative weights. Using the antiferromagnetic anisotropic XY chain as a test case, we analyze the dependence of the average sign on system size, temperature, anisotropy, and shift parameters. An operator contraction method is introduced to improve efficiency. Our results demonstrate that moderate shifts optimally balance sign mitigation and statistical accuracy, while large shifts amplify errors, leaving the sign problem unresolved but alleviated.