{"id":"W1565448920","doi":"10.26421/qic13.3-4-9","title":"Efficient quantum communication under collective noise","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Innsbruck; Austrian Science Fund; European Commission","keywords":"Decoding methods; Overhead (engineering); Quantum decoherence; Transmission (telecommunications); Topology (electrical circuits); Mathematics; Noise (video); Computer science; Quantum; Encoding (memory); Constant (computer programming); Discrete mathematics; Algorithm; Combinatorics; Quantum mechanics; Telecommunications; 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.0003357354,0.0001920614,0.0001694361,0.0004695974,0.0004817079,0.0008476866,0.0003658117,0.00009310439,0.00004344188],"category_scores_gemma":[0.00003343536,0.0001803114,0.00006621978,0.0008415165,0.00008823944,0.00290883,0.0001462095,0.0001641788,0.0007009528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007978608,"about_ca_system_score_gemma":0.0001040804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008143764,"about_ca_topic_score_gemma":0.000001574735,"domain_scores_codex":[0.9984537,0.0001056743,0.000635064,0.000161575,0.0003911347,0.0002528034],"domain_scores_gemma":[0.9985281,0.000127561,0.0003603263,0.0003434136,0.000494194,0.0001463628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009977737,0.00006291687,0.0001065847,0.00003676493,0.00002144087,1.147243e-7,0.00628958,0.02508119,0.00005095737,0.924969,0.00375423,0.03961731],"study_design_scores_gemma":[0.0006072521,0.00007656994,0.01807483,0.00002023195,0.000004573922,0.00001359865,0.001346041,0.928021,0.000055088,0.05062351,0.0009323578,0.0002249715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1988793,0.00006810962,0.7934439,0.001665808,0.0001885258,0.0005007913,0.000002654155,0.0003225977,0.004928351],"genre_scores_gemma":[0.9903005,0.00003223403,0.007568607,0.001911347,0.00001034468,0.00009113705,0.00006223491,0.000005783226,0.00001784783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9029398,"threshold_uncertainty_score":0.9009563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01178132849948048,"score_gpt":0.2358903108865309,"score_spread":0.2241089823870504,"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."}}