{"id":"W2949971971","doi":"10.48550/arxiv.1312.6064","title":"Extending Construction X for Quantum Error-Correcting Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Hermitian matrix; Quantum; Error detection and correction; Quantum convolutional code; Prime (order theory); Discrete mathematics; Order (exchange); Quantum error correction; Finite field; Mathematics; Computer science; Algorithm; Pure mathematics; Quantum information; Physics; Quantum mechanics; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003260151,0.0003849481,0.0004133436,0.0003140038,0.0004737881,0.0003014088,0.001475115,0.0002856198,0.000008593222],"category_scores_gemma":[0.00008879025,0.0004231352,0.0003050508,0.0004103639,0.0001282482,0.0002879644,0.001478366,0.0006971749,0.00002965857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001628961,"about_ca_system_score_gemma":0.000170712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001787604,"about_ca_topic_score_gemma":0.00002382001,"domain_scores_codex":[0.9977011,0.0001258743,0.0002621626,0.001291845,0.00009344085,0.000525543],"domain_scores_gemma":[0.9979708,0.0003329256,0.0004114144,0.0008830135,0.0002397795,0.0001620357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001434642,0.00004874881,0.0009607385,0.0001870228,0.00009843296,0.00005204134,0.0004045117,0.7666481,0.00007176054,0.1953204,0.0002644755,0.03592943],"study_design_scores_gemma":[0.0002716268,0.00005456983,0.0002104245,0.0001616683,0.00003348762,0.00003767875,0.0001524025,0.8837957,0.0001648207,0.1144054,0.0002676423,0.000444594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4181871,0.00004533978,0.5788549,0.00008663117,0.002056792,0.0002878447,0.000008419625,0.000352411,0.0001205359],"genre_scores_gemma":[0.9571431,0.00002486875,0.04220714,0.00004669782,0.0002947669,0.000003088278,0.00001394189,0.00002689392,0.0002395445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5389559,"threshold_uncertainty_score":0.999822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05685093901783562,"score_gpt":0.2067513980100363,"score_spread":0.1499004589922007,"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."}}