Quantum Private Information Retrieval with Sublinear Communication Complexity

Details Quantum Private Information Retrieval with Sublinear Communication Complexity Quantum Private Information Retrieval with Sublinear Communication Complexity

2011-07-29

arxiv.org/abs/1107.5881v1

Physics

Quantum Physics

4 pages

Scientific paper

This note presents a quantum protocol for private information retrieval, in
the single-server case and with information-theoretical privacy, that has
O(\sqrt{n})-qubit communication complexity, where n denotes the size of the
database. In comparison, it is known that any classical protocol must use
\Omega(n) bits of communication in this setting.

Affiliated with

Also associated with

No associations

Rating

Quantum Private Information Retrieval with Sublinear Communication Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Private Information Retrieval with Sublinear Communication Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Private Information Retrieval with Sublinear Communication Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318401