{"id":"W4417513673","doi":"10.1063/5.0280149","title":"Structure theorem for quantum replacer codes","year":2025,"lang":"en","type":"preprint","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Qubit; Quantum convolutional code; Quantum; Quantum error correction; Class (philosophy); Set (abstract data type); Variety (cybernetics); Quantum information","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.0006872667,0.0003329506,0.0008658454,0.0001001566,0.0001067608,0.000269457,0.001790642,0.0002252322,0.000006491271],"category_scores_gemma":[0.0003346001,0.0002308423,0.0005936089,0.0001647329,0.00007603311,0.0001046732,0.0009457346,0.001158971,0.000001935739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005287559,"about_ca_system_score_gemma":0.0003656434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.651747e-7,"about_ca_topic_score_gemma":9.793459e-8,"domain_scores_codex":[0.9979369,0.0001063808,0.000805343,0.0003404967,0.0005149777,0.0002959042],"domain_scores_gemma":[0.9966491,0.001057655,0.0009444961,0.0007717496,0.0004575645,0.0001193941],"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.00003206243,0.0002084104,0.0000028354,0.001363511,0.0002697895,0.00001552901,0.001232115,0.03048532,0.0001347436,0.9330935,0.004552294,0.02860982],"study_design_scores_gemma":[0.0001787441,0.00007411393,0.000004420202,0.0006048626,0.00004647349,0.00003357569,0.000008492299,0.4175791,0.0006777829,0.5803738,0.0002797883,0.0001389079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01088774,0.0001904808,0.9856626,0.00134896,0.001214756,0.00026699,0.00005721349,0.00005390711,0.000317299],"genre_scores_gemma":[0.1679952,0.00001928372,0.8295016,0.0003306539,0.001895908,0.000006776859,0.000005288672,0.00003238392,0.0002129421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3870938,"threshold_uncertainty_score":0.9413474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01766479639960532,"score_gpt":0.2852921827463787,"score_spread":0.2676273863467734,"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."}}