Reproduce “Quantum Private Information Retrieval on Forests” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Mohamed Nomeir, Sennur Ulukus
The authors present quantum private information retrieval for messages stored on graph edges. A shared GHZ state, one qudit per server, tree structure, and randomized queries cancel unwanted contributions while hiding the request. Under stated assumptions, forests achieve rate 3/N; for three disjoint edges, rate 4/6 matches an upper bound, establishing capacity only for that graph.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.