Similar Items: Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
- The Complexity of Stoquastic Sparse Hamiltonians
- Hard CNF Instances for Ideal Proof Systems
- Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
- Strongly Refuting Random CSP without Literals
- Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'