arXiv:2611.08076v1 Announce Type: new Abstract: Local certification allows network vertices to verify global properties using certificates from an untrusted prover and communication with their neighbors. Its complexity is the maximum certificate size at any vertex. Fraigniaud et al. (ITCS 2021) introduced the distributed quantum Merlin-Arthur (dQMA) model and proved an exponential quantum advantage for distributed equality, measured in input-string length. We resolve a question of Hasegawa, Kundu, and Nishimura (PODC 2024) by establishing unconditional exponential and polynomial quantum advantages for graph properties, which depend only on network topology, with complexity measured in the number $n$ of vertices. For every fixed integer $\mu \ge 1$, we construct a graph property admitting a one-round dQMA protocol with $O(\mu \log n)$-qubit certificates and messages, whereas every $\mu$-round distributed Merlin-Arthur (dMA) protocol requires $\Omega(n/(\mu \log^2 n))$-bit certificates. We also give a one-round dQMA protocol for graph symmetry, the existence of a nontrivial automorphism, with $\widetilde{O}(n^{5/3})$-qubit certificates. This yields a polynomial advantage over one-round dMA protocols, for which an $\Omega(n^2)$-bit certificate lower bound is known.