Can I read Merlin-Arthur Games and Stoquastic Complexity: Sergey Bravyi Arvid J. Bessen Barbara M. Terhal November 6, 2018 on EtoBox?

Merlin-Arthur Games and Stoquastic Complexity: Sergey Bravyi Arvid J. Bessen Barbara M. Terhal November 6, 2018 by abgrilo2 is a document available to read on EtoBox.

What is Merlin-Arthur Games and Stoquastic Complexity: Sergey Bravyi Arvid J. Bessen Barbara M. Terhal November 6, 2018 about?

This paper introduces the stoquastic k-SAT problem as a complete problem for the complexity class MA, demonstrating that it is the first non-trivial example of an MA-complete problem. Additionally, the authors define a new complexity class, StoqMA, and prove that stoquastic LH-MIN is StoqMA-complete, while also showing that stoquastic AV-LH-MIN is contained in AM and AM-complete for certain parameters. The results highlight the relationships between various complexity classes, including MA, AM, and StoqMA,

Author

abgrilo2

Language

EN