{"id":"W4394861184","doi":"10.1109/isit57864.2024.10619118","title":"Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted Communication","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Canada First Research Excellence Fund","keywords":"Communication source; Quantum entanglement; Quantum channel; Amplitude damping channel; Classical capacity; Quantum capacity; Channel (broadcasting); Computer science; Quantum information science; Quantum; Coding (social sciences); Channel capacity; Topology (electrical circuits); Superdense coding; Theoretical computer science; Physics; Mathematics; Quantum mechanics; Quantum network; Computer network; Combinatorics","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.001105333,0.0004822538,0.0004503027,0.0005388747,0.0005373122,0.001166807,0.0009654706,0.0009075371,0.003016036],"category_scores_gemma":[0.005096176,0.000272261,0.0004384462,0.0007580341,0.002723971,0.002441723,0.002170741,0.001480309,0.0002371715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147914,"about_ca_system_score_gemma":0.001404214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001657534,"about_ca_topic_score_gemma":0.001573409,"domain_scores_codex":[0.9988155,0.0005121653,0.00003080312,0.0001341031,0.0003367275,0.0001706309],"domain_scores_gemma":[0.9968701,0.001725816,0.000386102,0.000651117,0.0002449849,0.0001218761],"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.0000260593,0.00001585226,0.0001227272,0.00004003053,0.00001046169,0.00004730648,0.00006372044,0.09613851,0.002081916,0.8972922,0.000680821,0.003480392],"study_design_scores_gemma":[0.000008628044,0.00001675074,0.0001099126,0.00001804103,0.000005761725,0.00004464653,0.00002106965,0.6291532,0.0008769105,0.3684543,0.001269593,0.00002127207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1519771,0.000986894,0.8146592,0.001126954,0.0001124915,0.00005806463,0.000315699,0.0002073843,0.03055611],"genre_scores_gemma":[0.970666,0.0004077039,0.02664822,0.0001451408,0.00006132184,0.0000717139,0.00008341083,0.00003927751,0.001877233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003016036,"threshold_uncertainty_score":0.01073194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0334767765922625,"score_gpt":0.2833012854597078,"score_spread":0.2498245088674453,"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."}}