Quantum private information retrieval has linear communication complexity (Q2018821): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56475320, #quickstatements; #temporary_batch_1711504539957
Created claim: DBLP publication ID (P1635): journals/joc/BaumelerB15, #quickstatements; #temporary_batch_1731547958265
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1304.5490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum private information retrieval has linear communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography: public key distribution and coin tossing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bounds for Quantum Bit Commitment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Private Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of quantum relative entropy with an application to privacy in quantum communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum symmetrically-private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Private Information Retrieval with Sublinear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single quantum cannot be cloned / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/joc/BaumelerB15 / rank
 
Normal rank

Latest revision as of 02:54, 14 November 2024

scientific article
Language Label Description Also known as
English
Quantum private information retrieval has linear communication complexity
scientific article

    Statements

    Quantum private information retrieval has linear communication complexity (English)
    0 references
    0 references
    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

    Identifiers