{"id":"W2094133109","doi":"10.1007/s00145-014-9180-2","title":"Quantum Private Information Retrieval has Linear Communication Complexity","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"University of Waterloo; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Private information retrieval; Communication complexity; Computer science; Quantum; Protocol (science); Theoretical computer science; Sublinear function; Qubit; Analogy; Upper and lower bounds; Oblivious transfer; Quantum information science; Adversary; Quantum information; Verifiable secret sharing; Cryptography; Mathematics; Computer security; Discrete mathematics; Quantum entanglement; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00449239,0.001342145,0.004306124,0.002135885,0.003611081,0.009847103,0.003644922,0.006010198,0.02623758],"category_scores_gemma":[0.04047849,0.001824603,0.002222191,0.004616975,0.006920155,0.02406677,0.006796559,0.008092777,0.006216159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007261307,"about_ca_system_score_gemma":0.007541329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002426252,"about_ca_topic_score_gemma":0.002592637,"domain_scores_codex":[0.9878141,0.00322138,0.0004816452,0.001701211,0.004896683,0.001885073],"domain_scores_gemma":[0.8918428,0.08501419,0.003088066,0.0147255,0.003998691,0.001330828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009958136,0.0003099565,0.0009398109,0.0004445861,0.000114075,0.0002091695,0.0002904864,0.0312865,0.003279421,0.9044219,0.01613402,0.0415743],"study_design_scores_gemma":[0.0001828165,0.00006454115,0.0003207581,0.00003765858,0.00005070387,0.0001736274,0.00005094463,0.1075634,0.002354339,0.886251,0.002892258,0.00005790343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.186776,0.004875203,0.6244097,0.05094136,0.0009765607,0.0007034382,0.003571189,0.003635677,0.1241109],"genre_scores_gemma":[0.8968939,0.001929856,0.05198803,0.003435603,0.002289742,0.0006918783,0.001414378,0.0006465315,0.04071018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02623758,"threshold_uncertainty_score":0.08777344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03282833233878169,"score_gpt":0.2663926676220972,"score_spread":0.2335643352833155,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}