# Reducing Provers in Distributed Quantum Verification

DevFeed: [Reducing Provers in Distributed Quantum Verification](<https://devfeed.tech/articles/reducing-provers-in-distributed-quantum-verification-126747.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.12600>)

Author: Alex Della Schiava, Atsuya Hasegawa, Fran\\c{c}ois Le Gall, Harumichi Nishimura

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [verification](<https://devfeed.tech/tags/verification.md>)

## AI overview

In the distributed quantum Merlin-Arthur model with proofs unentangled across nodes, the paper defines a version with k provers and gives reductions in prover count. Reducing to two provers doubles local proof size without extra communication. Reducing to one prover takes four additional rounds and uses at most three times the original local proof size plus a logarithmic term in the number of nodes. For perfectly complete protocols, amplification allows a single prover with constant-factor overhead, yielding equality between the one-prover and k-prover classes. These results concern the model and conditions described in the abstract.

## Source excerpt

arXiv:2611.12600v1 Announce Type: cross Abstract: In the distributed quantum Merlin-Arthur ($\mathsf{dQMA}$) model introduced by Fraigniaud, Le Gall, Nishimura, and Paz (ITCS 2021), a network of quantum computers verifies a global property with the aid of a quantum proof supplied by an untrusted prover. While the nodes are computationally unbounded, the challenge is to limit proof size and the communication required for verification. In this paper, we consider the model of Hasegawa, Kundu, and Nishimura (PODC 2024), where the proof must be unentangled across nodes, and define its extension to $k$ unentangled provers, denoted by $\mathsf{dQMAS}(k)$. In this setting, we investigate the proof size per node and the communication costs of reducing the number of provers. Our first result reduces the number of provers from $k$ to two, doubling the proof size without additional communication. Moreover, with four additional rounds, we can reduce the number of provers from $k$ to one, using at most three times the original local proof size plus a logarithmic term in the number of nodes. Finally, we establish amplification for perfectly complete protocols. In this regime, a single prover suffices with a constant-factor overhead in our reductions, yielding $\mathsf{dQMAS} = \mathsf{dQMAS}(k)$.