pith. sign in

arxiv: quant-ph/0306051 · v2 · submitted 2003-06-06 · 🪐 quant-ph

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

classification 🪐 quant-ph
keywords quantumsystemsproofmerlin-arthurarthurmultipleproofsclassical
0
0 comments X
read the original abstract

This paper introduces quantum ``multiple-Merlin''-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical single-proof systems (i.e., usual Merlin-Arthur proof systems), it is unclear whether or not quantum multi-proof systems collapse to quantum single-proof systems (i.e., usual quantum Merlin-Arthur proof systems). This paper presents a necessary and sufficient condition under which the number of quantum proofs is reducible to two. It is also proved that, in the case of perfect soundness, using multiple quantum proofs does not increase the power of quantum Merlin-Arthur proof systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems

    quant-ph 2026-05 unverdicted novelty 8.0

    StoqMa(k) equals StoqMa for any polynomial k via a positive value-based de Finetti theorem that approximates nonnegative product values with symmetric extensions.

  2. Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference

    quant-ph 2026-04 unverdicted novelty 7.0

    StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.