The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
The paper investigates StoqMA verification, proving that unentanglement does not add computational power when provers are polynomially bounded. This leads to a collapse where StoqMA(k) equals StoqMA for all polynomial $k$. This means destructive interference can be ruled out without losing expressive power, absorbing the product-state constraint into a larger one-witness framework.