{"id":"W2341912304","doi":"10.1007/s00340-016-6373-4","title":"Overcoming lossy channel bounds using a single quantum repeater node","year":2016,"lang":"en","type":"article","venue":"Applied Physics B","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Industry Canada","keywords":"Quantum key distribution; Lossy compression; Repeater (horology); Computer science; Quantum channel; Transmission (telecommunications); Photon; Quantum network; Key exchange; Channel (broadcasting); Key (lock); Quantum; Quantum information science; Quantum optics; Topology (electrical circuits); Physics; Computer network; Quantum information; Telecommunications; Optics; Encoding (memory); Quantum mechanics; Electrical engineering; Quantum entanglement; Public-key cryptography; Computer security; Engineering","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.001534362,0.0006162587,0.001210551,0.0005549298,0.001258718,0.001373105,0.002586661,0.002178706,0.006528673],"category_scores_gemma":[0.003531763,0.0005290955,0.0004974467,0.0003993355,0.001754057,0.004264074,0.003581362,0.002020303,0.001515273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007620204,"about_ca_system_score_gemma":0.001104932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004877244,"about_ca_topic_score_gemma":0.0008090243,"domain_scores_codex":[0.9989169,0.000214655,0.00004089998,0.0002505611,0.0003939952,0.0001830828],"domain_scores_gemma":[0.9971275,0.001401561,0.000238586,0.0008757595,0.0002334685,0.0001232373],"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.001278114,0.0003147697,0.0009250414,0.0004515689,0.0001495165,0.0006142689,0.0005261926,0.1432115,0.2889989,0.4984896,0.003152869,0.06188772],"study_design_scores_gemma":[0.0001336663,0.0005943176,0.0002135651,0.00005937545,0.0001081873,0.0004105421,0.0001117059,0.7849215,0.1027201,0.1041609,0.006463952,0.0001021569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2526096,0.0008611066,0.7066713,0.001727418,0.0003313051,0.0001444529,0.0001052771,0.002395381,0.03515412],"genre_scores_gemma":[0.8988851,0.0003087025,0.090565,0.0002287102,0.0001016113,0.00008022895,0.00003753731,0.0001335366,0.009659588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006528673,"threshold_uncertainty_score":0.02184057,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02732092225415877,"score_gpt":0.2320602987493848,"score_spread":0.204739376495226,"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."}}