Physics – Quantum Physics
Scientific paper
2004-03-19
Proc. of 32nd ICALP, 2005, LNCS 3580, pages 1424-1436.
Physics
Quantum Physics
12 pages LaTeX, To appear in ICALP '05
Scientific paper
10.1007/11523468_115
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding n-bit strings over an l-bit alphabet, where the decoder only uses b bits of each queried position of the codeword, needs code length m = exp(Omega(n/(2^b Sum_{i=0}^b {l choose i}))) Similarly, a 2-server PIR scheme with an n-bit database and t-bit queries, where the user only needs b bits from each of the two l-bit answers, unknown to the servers, satisfies t = Omega(n/(2^b Sum_{i=0}^b {l choose i})). This implies that several known PIR schemes are close to optimal. Our results generalize those of Goldreich et al. who proved roughly the same bounds for linear LDCs and PIRs. Like earlier work by Kerenidis and de Wolf, our classical lower bounds are proved using quantum computational techniques. In particular, we give a tight analysis of how well a 2-input function can be computed from a quantum superposition of both inputs.
Wehner Stephanie
Wolf Ronald de
No associations
LandOfFree
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval 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 Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-336627