{"id":"W2973363947","doi":"10.1103/physrevx.11.011023","title":"Fault-Tolerant Gates on Hypergraph Product Codes","year":2021,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Hypergraph; Product (mathematics); Fault tolerance; Quantum; Overhead (engineering); Class (philosophy); Theoretical computer science; Discrete mathematics; Distributed computing; Mathematics; Physics; Quantum mechanics","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.0003759866,0.0003039774,0.0003878274,0.0006644622,0.0004418346,0.000858381,0.0007435909,0.00078726,0.002934857],"category_scores_gemma":[0.002267075,0.0002067238,0.0003270597,0.0008536648,0.00162749,0.001967721,0.0009996669,0.0009326751,0.0005473447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006560101,"about_ca_system_score_gemma":0.0004937758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008447386,"about_ca_topic_score_gemma":0.000629055,"domain_scores_codex":[0.9995853,0.0001076139,0.00001628876,0.00006387042,0.000156756,0.00007004138],"domain_scores_gemma":[0.9989015,0.0005362413,0.0000971775,0.0002261969,0.0001744522,0.00006443833],"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.0001146004,0.00001936648,0.0001560554,0.00008613899,0.00001651397,0.0001163059,0.0001034242,0.02629452,0.0091362,0.9368224,0.002311666,0.02482303],"study_design_scores_gemma":[0.00005191645,0.00008646831,0.0002378458,0.00004786496,0.00001628888,0.0001482468,0.00004478373,0.1536079,0.02129383,0.8126768,0.01175194,0.00003617315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2629424,0.002927055,0.6859202,0.001924914,0.0006161985,0.0001183801,0.0003584679,0.001377126,0.04381538],"genre_scores_gemma":[0.9152103,0.001792261,0.07014845,0.0005038194,0.0001996442,0.0001112562,0.0002198714,0.0001362526,0.01167812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002934857,"threshold_uncertainty_score":0.009818017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01309196206770562,"score_gpt":0.2817337348314733,"score_spread":0.2686417727637677,"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."}}