Metraipolis › archive › dc_bf4bf4e3359f

Quantum Private Information Retrieval on Forests — arXiv:2611.03558

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.03558
License (as archived): CC0-1.0
Archived: 2026-11-03T18:33:19.773Z
SHA-256 of the archived text: 91e6c9b97f9d8fe1e1fa33d55d60ab6c6fcd295ddfbef8673f7f6884723d454f
Stable URL of this page: https://metraipolis.com/documento/dc_bf4bf4e3359f

How to cite

Quantum Private Information Retrieval on Forests — arXiv:2611.03558 — arXiv (en), https://arxiv.org/abs/2611.03558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf4bf4e3359f (Metraipolis archive dc_bf4bf4e3359f, sha256 91e6c9b97f9d8fe1e1fa33d55d60ab6c6fcd295ddfbef8673f7f6884723d454f)

BibTeX

@misc{dcbf4bf4e3359f,
  title = {Quantum Private Information Retrieval on Forests — arXiv:2611.03558},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03558},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf4bf4e3359f; sha256 91e6c9b97f9d8fe1e1fa33d55d60ab6c6fcd295ddfbef8673f7f6884723d454f},
  year = {2026}
}

Archived text

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

We consider the problem of graph private information retrieval (PIR) in the quantum setting. We focus on a specific type of graphs, namely the forest graphs. A forest graph is a union of disjoint trees. We consider the quantum setting where all the servers share an entangled state. Each server is allowed to send only one qudit per retrieval round. We design a scheme for the forest graphs that achieves the rate of $\frac{3}{N}$. The scheme uses a GHZ state as the initial entangled state between the servers prior to the scheme initiation. We compare our scheme with the only work done in the literature that considered the quantum setting of graph PIR. We show that our scheme is more efficient in this setting. We derive the quantum capacity for the case of $G=3K_2$, which is equal to $4/6$. $G=3K_2$ is a special case of the forest graph. We design a scheme that is specialized for this graph, achieving a rate equal to $4/6$ and provide the corresponding matching upper bound, establishing it as the capacity.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Cryptography and Security (cs.CR); Networking and Internet Architecture (cs.NI); Signal Processing (eess.SP); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.03558 — 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-11-03T18:12:23.828Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).