{"id":"W4366598569","doi":"10.22331/q-2023-04-20-985","title":"Finite-rate sparse quantum codes aplenty","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bipartite graph; Computer science; Algorithm; Satisfiability; Code (set theory); Qubit; Constraint satisfaction problem; Quantum; Theoretical computer science; Quantum mechanics; Artificial intelligence; 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":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008897484,0.0003130266,0.000337814,0.0003083566,0.0003947477,0.0003001963,0.001403322,0.0001082994,0.00002803364],"category_scores_gemma":[0.0002057056,0.0002713746,0.000172453,0.001547666,0.00009580751,0.000232283,0.0006268428,0.0003689885,0.001806417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002598883,"about_ca_system_score_gemma":0.0000897683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007953581,"about_ca_topic_score_gemma":0.00000746748,"domain_scores_codex":[0.9973943,0.0002050068,0.0003901866,0.0007496467,0.0004188535,0.0008420225],"domain_scores_gemma":[0.9979402,0.0006318378,0.0001413642,0.0009828837,0.0000832341,0.0002204726],"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.0000328512,0.0002813278,0.0008742131,0.0001472636,0.0001202751,0.0009065825,0.003999845,0.1047815,0.002064053,0.7568892,0.06613301,0.06376982],"study_design_scores_gemma":[0.0002677213,0.0001345741,0.002578228,0.00004785037,0.000005457382,0.00001877659,0.00004853113,0.9126729,0.0003546464,0.04850202,0.03501534,0.0003539914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5411389,0.00027747,0.4424112,0.007333637,0.003788962,0.0003413461,0.00004379196,0.003868867,0.0007958091],"genre_scores_gemma":[0.992471,0.0001004551,0.005146668,0.0009343734,0.0003717991,0.00002246478,0.00004121382,0.00004306215,0.0008689708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8078914,"threshold_uncertainty_score":0.9999738,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02518060385103931,"score_gpt":0.2574515494129512,"score_spread":0.2322709455619119,"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."}}