English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study the complexity of QMA proof systems with inverse exponentially smallpromise gap. We show that this class can be exactly characterized by PSPACE,the class of problems solvable with a polynomial amount of memory. Asapplications we show that a "precise" version of the Local Hamiltonian problemis PSPACE-complete, and give a provable setting in which the ability to preparePEPS states is not as powerful as the ability to prepare the ground state ofgeneral Local Hamiltonians.

Quantum Merlin Arthur with Exponentially Small Gap