Quantum Private Information Retrieval with Sublinear Communication Complexity

by François Le Gall

Theory of Computing, Volume 8(16), pp. 369-374, 2012

Bibliography with links to cited articles

[1]   Ethan Bernstein and Umesh Vazirani: Quantum complexity theory. SIAM J. Comput., 26(5):1411–1473, 1997. Preliminary version in STOC’93. [doi:10.1137/S0097539796300921]

[2]   Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan: Private information retrieval. J. ACM, 45(6):965–981, 1998. Preliminary version in FOCS’95. [doi:10.1145/293347.293350]

[3]   Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone: Quantum private queries. Phys. Rev. Lett., 100:230502, Jun 2008. [doi:10.1103/PhysRevLett.100.230502]

[4]   Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen: A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM, 56(6):33, 2009. Preliminary version in FOCS’02. [doi:10.1145/1568318.1568323]

[5]   Iordanis Kerenidis and Ronald de Wolf: Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. System Sci., 69(3):395–420, 2004. Preliminary version in STOC’03. [doi:10.1016/j.jcss.2004.04.007]

[6]   Iordanis Kerenidis and Ronald de Wolf: Quantum symmetrically-private information retrieval. Inform. Process. Lett., 90(3):109–114, 2004. [doi:10.1016/j.ipl.2004.02.003]

[7]   Hartmut Klauck: Quantum and approximate privacy. Theory of Computing Systems, 37(1):221–246, 2004. Preliminary version in STACS’02. [doi:10.1007/s00224-003-1113-7]

[8]   Ashwin Nayak: Optimal lower bounds for quantum automata and random access codes. In Proc. 40th FOCS, pp. 369–377. IEEE Comp. Soc. Press, 1999. [doi:10.1109/SFFCS.1999.814608]

[9]   Michael Nielsen and Isaac Chuang: Quantum Computation and Quantum Information. Cambridge University Press, 2000.