{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007284143,0.0002265309,0.0002895389,0.0001565851,0.001001283,0.0001545215,0.001324361,0.00003992785,0.0001105815],"category_scores_gemma":[0.00006715475,0.0002217223,0.0001464647,0.0006223503,0.0001228521,0.0001513179,0.0009879464,0.0005707143,0.00004640377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007042653,"about_ca_system_score_gemma":0.0001611706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001111096,"about_ca_topic_score_gemma":0.00000575329,"domain_scores_codex":[0.9976817,0.000334612,0.0002763208,0.0006334225,0.0005256605,0.0005482583],"domain_scores_gemma":[0.9986022,0.0003394069,0.0001410657,0.0007202502,0.0000489409,0.0001481675],"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.00001386374,0.0003107577,0.000500562,0.00001918542,0.00004624048,0.0002175368,0.001777603,0.01461039,0.001082862,0.9421045,0.006264553,0.033052],"study_design_scores_gemma":[0.0003578095,0.0003188937,0.001189778,0.000007390524,0.000004866159,0.0002793903,0.0001806892,0.9223307,0.000202655,0.04107347,0.03371542,0.0003389398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6220499,0.0002867032,0.3689151,0.004194874,0.002078817,0.0002360243,0.00005369292,0.0008574196,0.001327434],"genre_scores_gemma":[0.9937936,0.000005317943,0.00492068,0.001011007,0.0001174177,0.00003233663,0.0000101321,0.00001854876,0.00009092575],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9077203,"threshold_uncertainty_score":0.9041572,"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."}}