Quantum

Dismantling the Stoquastic Dichotomy

Armen Karakashian, Itay Hen

Featured July 23, 2026

This analysis was generated by SciGrove. Upload your own PDFs or enter a DOI — and get the same AI breakdown on any paper.

Get started

AI-generated analysis — This is SciGrove's AI interpretation of the paper, not peer-reviewed content. Always refer to the original paper.

Simply

Quantum systems with vanishing geometric phase (VGP) are shown to be just as "easy" to analyze for ground-state energy as simpler "stoquastic" systems, even if they look more complex.

In depth

The paper redefines the computational boundaries in quantum computing by introducing vanishing geometric phase (VGP) as a more fundamental property than stoquasticity. It demonstrates that VGP Hamiltonians, even those hard to stoquastize, belong to the same complexity class (StoqMA) for ground-state energy problems as stoquastic ones, challenging traditional assumptions about quantum simulation hardness.

Key Takeaways

1
Vanishing geometric phase (VGP) is identified as the true, basis-invariant boundary for sign-problem-freeness in PMR-QMC, superseding stoquasticity.
2
The computational complexity class StoqMA is shown to be equivalent to VGPMA, implying VGP Hamiltonians are no harder for ground-state energy estimation than stoquastic ones.
3
The study constructs VGP Hamiltonians that are provably hard to stoquastize via efficiently realizable unitaries, yet their VGP property can be efficiently recognized in specific cases.

Conceptual Flow

HIGH LEVEL

Methodology: How VGP Replaces Stoquasticity

The paper shows that a deeper property called "vanishing geometric phase" (VGP) is a better way to tell if a quantum system is easy to simulate than just checking if it's "stoquastic."

Old Rule: Stoquastic?

Is it enough?

New Rule: VGP?

Results: VGP Systems are Not Harder

They found that even complex VGP systems are no harder to solve for their lowest energy state than the simpler stoquastic ones, collapsing a complexity boundary.

Stoquastic Systems

VGP Systems

Same Difficulty for Lowest Energy

Equivalent Computational Power