Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Quantum Private Information Retrieval with Sublinear Communication Complexity

From MaRDI portal
Publication:2913816
Jump to:navigation, search

DOI10.4086/toc.2012.v008a016zbMath1247.68077arXiv1107.5881OpenAlexW2963456360MaRDI QIDQ2913816

François Le Gall

Publication date: 27 September 2012

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.5881


zbMATH Keywords

private information retrievalquantum communication complexity


Mathematics Subject Classification ID

Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)


Related Items (1)

Quantum private information retrieval has linear communication complexity






This page was built for publication: Quantum Private Information Retrieval with Sublinear Communication Complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2913816&oldid=15884845"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki