{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001274259,0.0001694403,0.0001580498,0.00007644616,0.0001837487,0.0001965189,0.0004806859,0.00005302086,0.00001135896],"category_scores_gemma":[0.000003179764,0.0001268651,0.00009625692,0.0003827593,0.00006957883,0.0007337876,0.0001723398,0.0000734626,0.0001811679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004722559,"about_ca_system_score_gemma":0.00003308827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009408476,"about_ca_topic_score_gemma":4.45937e-7,"domain_scores_codex":[0.9988409,0.00001391669,0.0002417672,0.000282773,0.0002694757,0.0003511769],"domain_scores_gemma":[0.9990934,0.0000446672,0.0001394471,0.0005847468,0.00005200037,0.00008573129],"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.0000108414,0.00008935874,0.00007164902,0.00001698952,0.00002608169,0.00000191838,0.001094817,0.0001202615,0.1136912,0.8721581,0.0005572065,0.01216161],"study_design_scores_gemma":[0.002416247,0.000106871,0.0004541971,0.0001746576,0.00003005165,0.00002410256,0.0001547516,0.205632,0.2464943,0.5258207,0.0172711,0.001421112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357657,0.000009260054,0.8567411,0.0001886588,0.0002045416,0.0001002074,0.000002549945,0.0001960197,0.006791896],"genre_scores_gemma":[0.9926192,0.000003031603,0.006160643,0.001022491,0.0001408238,0.00001267999,0.000001969415,0.0000148226,0.0000243164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8568535,"threshold_uncertainty_score":0.517341,"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."}}