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

Quantum Merlin-Arthur proof systems are a weak form of quantum interactive proof systems, where mighty Merlin as a prover presents a proof in a pure quantum state and Arthur as a ver- ifier performs polynomial-time quantum computation to verify its correctness with high success probability. For a more general treatment, this paper considers quantum "multiple-Merlin"-Arthur proof systems in which Arthur uses multiple quantum proofs unentangled each other for his ver- ification. Although classical multi-proof systems are easily shown to be essentially equivalent to classical single-proof systems, it is unclear whether quantum multi-proof systems collapse to quan- tum single-proof systems. This paper investigates the possibility that quantum multi-proof systems collapse to quantum single-proof systems, and shows that (i) a necessary and sufficient condition under which the number of quantum proofs is reducible to two and (ii) using multiple quantum proofs does not increase the power of quantum Merlin-Arthur proof systems in the case of perfect soundness. Our proof for the latter result also gives a new characterization of the class NQP, which bridges two existing concepts of "quantum nondeterminism". It is also shown that (iii) there is a relativized world in which co-NP (actually co-UP) does not have quantum Merlin-Arthur proof systems even with multiple quantum proofs.

Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?