Quantum PIR scheme for forest graphs achieves rate 3/N
Original title: Quantum Private Information Retrieval on Forests
The scheme uses GHZ state and achieves rate 3/N for forest graphs, more efficient than prior work, with capacity 4/6 for G=3K_2.
We consider graph private information retrieval in quantum setting on forest graphs. Servers share entangled state and send one qudit per round. Proposed scheme achieves rate 3/N using GHZ state. It is more efficient than the only prior work in quantum graph PIR. Quantum capacity for G=3K_2 is 4/6, with matching scheme and bound.
- rate of 3/N for forest graphs
- uses GHZ state as initial entangled state
- more efficient than literature work
- quantum capacity for G=3K_2 is 4/6
From the original article
1 min read at arxiv.orgWe 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.
By Mohamed Nomeir · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.