{"id":"W4380905717","doi":"10.1109/tit.2023.3286870","title":"On the Hardness of the Minimum Distance Problem of Quantum Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Notation; Mathematics; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum; Quantum computer; Graph; Code (set theory); Computer science; Arithmetic; Quantum mechanics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187295,0.0009810835,0.001762913,0.001462634,0.002106274,0.003412521,0.002926088,0.003231296,0.007775995],"category_scores_gemma":[0.02253688,0.0008004367,0.001506906,0.001805133,0.004249043,0.009425968,0.004781161,0.005973069,0.0009810892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002742253,"about_ca_system_score_gemma":0.00165872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002365827,"about_ca_topic_score_gemma":0.001216637,"domain_scores_codex":[0.996222,0.001212135,0.0001597866,0.0007728561,0.001050458,0.0005828207],"domain_scores_gemma":[0.9711331,0.02457273,0.001147121,0.00145057,0.0008748352,0.0008215652],"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.0006728817,0.0002970358,0.002341843,0.0007238358,0.0001201136,0.0003313223,0.001133157,0.1832342,0.005743714,0.7589908,0.01128549,0.0351257],"study_design_scores_gemma":[0.00007920771,0.00005896926,0.0004828229,0.00004349688,0.00001983869,0.0001223433,0.0001555842,0.1642442,0.001670032,0.8306568,0.002430077,0.00003649095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.586964,0.0026976,0.3349322,0.01273947,0.0002871635,0.0001876819,0.001556826,0.0007888134,0.0598463],"genre_scores_gemma":[0.9467074,0.001569645,0.03986526,0.0009413868,0.0004632425,0.0002501891,0.001339135,0.000338909,0.008524734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007775995,"threshold_uncertainty_score":0.02601331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00872148690654637,"score_gpt":0.2146107954615508,"score_spread":0.2058893085550044,"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."}}