Metraipolis › archive › dc_df7013ed645c

Distributed Quantum Property Testing with Quantum Carrier Pigeons — arXiv:2609.08864

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08864
License (as archived)
CC0-1.0
Archived
2026-10-16T15:31:56.536Z
SHA-256 of the archived text
9fed54287709ad91a7950c3971c97e238142ed863661c70af277754b4cce1d72
Stable URL of this page
https://metraipolis.com/documento/dc_df7013ed645c

How to cite

Distributed Quantum Property Testing with Quantum Carrier Pigeons — arXiv:2609.08864 — arXiv (en), https://arxiv.org/abs/2609.08864 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df7013ed645c (Metraipolis archive dc_df7013ed645c, sha256 9fed54287709ad91a7950c3971c97e238142ed863661c70af277754b4cce1d72)
BibTeX
@misc{dcdf7013ed645c,
  title = {Distributed Quantum Property Testing with Quantum Carrier Pigeons — arXiv:2609.08864},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08864},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df7013ed645c; sha256 9fed54287709ad91a7950c3971c97e238142ed863661c70af277754b4cce1d72},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08864. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\rho$, before communicating via a constrained one-way communication channel with a central node, which aims to infer some property of $\rho$. 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 $\sigma$, decide whether $\rho=\sigma$ or $\|\rho-\sigma\|_1\geq \epsilon$. 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 $\Theta(\frac{d^2}{2^{n_q} 2^{n_c/2}\epsilon^2})$. We further demonstrate that shared randomness is necessary to achieve the above complexity, by proving an $\Omega(\frac{d^3}{4^{n_q} 2^{n_c} \epsilon^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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.08864 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T15:15:08.367Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).