{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672544,0.0001019381,0.0001149007,0.0001252287,0.0002696531,0.00004083331,0.0007256478,0.00003819129,0.000010228],"category_scores_gemma":[0.00001567756,0.00005594454,0.0001171007,0.0007716957,0.0001374313,0.0002495272,0.0000069601,0.0001969061,0.00003581479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001378896,"about_ca_system_score_gemma":0.00004773937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005495271,"about_ca_topic_score_gemma":0.000001177278,"domain_scores_codex":[0.9989662,0.0001469658,0.0003304665,0.0000903569,0.0003252162,0.0001408566],"domain_scores_gemma":[0.998609,0.000574515,0.0002111391,0.0004979994,0.00008501172,0.00002235468],"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.00004630781,0.00005832347,0.000001529554,0.00007862646,0.00003144247,1.790709e-7,0.007725946,0.353538,0.0001302985,0.5872092,0.0006688784,0.05051129],"study_design_scores_gemma":[0.0002577995,0.0001186958,0.000226879,0.0001890644,0.000008532863,0.000003613865,0.000478599,0.8878214,0.02229226,0.08744828,0.001033158,0.0001216887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0425782,0.000003682314,0.9547142,0.00117083,0.0005982108,0.0002179947,0.00004192227,0.0001018387,0.0005731526],"genre_scores_gemma":[0.9990004,0.000006512024,0.0005482477,0.0002775809,0.000007769161,0.00002212094,0.000001160752,0.00000435931,0.0001318597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9564222,"threshold_uncertainty_score":0.2281352,"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."}}