{"id":"W3172819695","doi":"10.22331/q-2022-05-13-711","title":"Connectivity constrains quantum codes","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"National Science Foundation","keywords":"Low-density parity-check code; Discrete mathematics; Qubit; Computer science; Quantum; Quantum algorithm; Upper and lower bounds; Block code; Quantum computer; Mathematics; Theoretical computer science; Algorithm; Quantum mechanics; Decoding methods; Physics","routes":{"ca_aff":true,"ca_fund":false,"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.000684565,0.0005009732,0.0005703418,0.00102191,0.001482457,0.001834975,0.000964736,0.001692869,0.005963462],"category_scores_gemma":[0.01468336,0.000484032,0.0004367281,0.001016813,0.003065469,0.004462898,0.002370955,0.002565513,0.0005725278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147233,"about_ca_system_score_gemma":0.0007908956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001969633,"about_ca_topic_score_gemma":0.001806476,"domain_scores_codex":[0.9985899,0.0003375342,0.00005810519,0.0002723433,0.0004967852,0.0002452697],"domain_scores_gemma":[0.9827995,0.0128762,0.001008448,0.001894808,0.0008721908,0.0005487823],"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.00006054004,0.00001966983,0.0006917138,0.0001080687,0.000008071658,0.0001120042,0.000230816,0.05346444,0.004511938,0.9313795,0.001730292,0.007682975],"study_design_scores_gemma":[0.00002569002,0.00004512967,0.0006038525,0.00004933591,0.00001125289,0.00028751,0.0001369267,0.1735538,0.004051782,0.815411,0.005791986,0.00003188089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5736299,0.001800916,0.3274357,0.004456519,0.0001921589,0.0001026526,0.0008733002,0.0006229005,0.09088607],"genre_scores_gemma":[0.9776319,0.0008421169,0.01765356,0.0002651628,0.0001074646,0.0001250021,0.0003198669,0.0001472107,0.002907666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005963462,"threshold_uncertainty_score":0.01994979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01428512456716478,"score_gpt":0.2396014767278608,"score_spread":0.225316352160696,"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."}}