{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207828,0.0001049491,0.0002591254,0.0003729119,0.0001922343,0.0001571057,0.001067565,0.0001012492,0.00003132543],"category_scores_gemma":[0.0002895603,0.00008838117,0.0001276299,0.0003935294,0.0002037012,0.002441383,0.0001372573,0.0003358326,0.0001002987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002644271,"about_ca_system_score_gemma":0.00007658218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002437103,"about_ca_topic_score_gemma":0.000001158239,"domain_scores_codex":[0.9983301,0.0002394919,0.0008584569,0.00005813684,0.0003286912,0.0001851956],"domain_scores_gemma":[0.9977546,0.0001534394,0.001039213,0.000451203,0.0004950559,0.0001065272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005568326,0.0000341157,0.000351448,0.00001429545,0.0000195927,6.616517e-7,0.0009018392,0.0001638137,0.00007973513,0.9918464,0.002376972,0.004155398],"study_design_scores_gemma":[0.001990288,0.0007945057,0.01626204,0.00004760546,0.00001898561,0.0004887921,0.0001208533,0.2650635,0.001522122,0.2912005,0.4222117,0.0002790845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180812,0.00004969697,0.8742082,0.005608833,0.0004522875,0.00006020994,7.596749e-7,0.00004636274,0.001492467],"genre_scores_gemma":[0.8900284,0.0000527354,0.108308,0.001541537,0.00005920236,5.865695e-7,0.000005173027,0.000003179513,0.000001277112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7719471,"threshold_uncertainty_score":0.3604079,"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."}}