Quantum private information retrieval has linear communication complexity (Q2018821)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6419546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum private information retrieval has linear communication complexity |
scientific article; zbMATH DE number 6419546 |
Statements
Quantum private information retrieval has linear communication complexity (English)
0 references
25 March 2015
0 references
private information retrieval
0 references
quantum cryptography
0 references
specious adversaries
0 references
quantum semi-honest
0 references
0 references
0 references
0.8993669748306274
0 references
0.893010675907135
0 references
0.8523907661437988
0 references
0.8190969228744507
0 references
0.8154506683349609
0 references
