Quantum Private Information Retrieval has Linear Communication Complexity
- 17 April 2014
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 28 (1) , 161-175
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Practical private database queries based on a quantum-key-distribution protocolPhysical Review A, 2011
- A property of quantum relative entropy with an application to privacy in quantum communicationJournal of the ACM, 2009
- Quantum Private QueriesPhysical Review Letters, 2008
- Exponential lower bound for 2-query locally decodable codes via a quantum argumentJournal of Computer and System Sciences, 2004
- Quantum symmetrically-private information retrievalInformation Processing Letters, 2004
- Private information retrievalJournal of the ACM, 1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- A single quantum cannot be clonedNature, 1982