{
  "abstract": "We introduce a framework for distributed quantum inference under communication constraints. In our model, $m$ distributed nodes each receive one copy of an unknown $d$-dimensional quantum state $ρ$, before communicating via a constrained one-way communication channel with a central node, which aims to infer some property of $ρ$. This framework generalizes the classical distributed inference framework introduced by Acharya, Canonne, and Tyagi [COLT 2019], by allowing quantum resources such as quantum communication and shared entanglement. Within this setting, we focus on the fundamental problem of quantum state certification: Given a complete description of some state $σ$, decide whether $ρ=σ$ or $\\|ρ-σ\\|_1\\geq ε$. Additionally, we focus on the case of limited communication between distributed nodes and the central node: we assume each communication channel is limited to only $n_c$ bits and $n_q$ qubits with $n_c + n_q \\leq \\log d$. When all nodes can make use of a shared source of randomness, we show that the copy complexity of distributed state certification is $Θ(\\frac{d^2}{2^{n_q} 2^{n_c/2}ε^2})$. We further demonstrate that shared randomness is necessary to achieve the above complexity, by proving an $Ω(\\frac{d^3}{4^{n_q} 2^{n_c} ε^2})$ lower bound in the $\\textit{private-coin}$ setting. Moreover, we develop a private-coin algorithm that matches this bound up to a $\\sqrt{\\log d}$ factor, showing this complexity is near-optimal. Together, our work establishes a general framework for distributed quantum inference with communication constraints and characterizes the complexity of distributed state certification with limited communication.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.08864",
  "author_total": 4,
  "authors": [
    {
      "name": "Kenny Chen"
    },
    {
      "name": "Mina Doosti"
    },
    {
      "name": "Ryan Sweke"
    },
    {
      "name": "Chirag Wadhwa"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/cfh4hww3k9zqp.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.08864",
  "fulltext_url": null,
  "id": "cfh4hww3k9zqp",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.08864",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7212004656",
  "pdf_url": "https://arxiv.org/pdf/2609.08864",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-08",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/cfh4hww3k9zqp.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:19:52Z",
      "native_id": "2609.08864",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.08864"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Distributed Quantum Property Testing with Quantum Carrier Pigeons",
  "title_text": "Distributed Quantum Property Testing with Quantum Carrier Pigeons",
  "type": "preprint",
  "updated_at": "2026-10-30T12:19:52Z",
  "url": "https://research.draconitic.com/paper/cfh4hww3k9zqp",
  "venue": "arXiv",
  "versions": []
}