{"id":"W2998793783","doi":"10.1038/s41534-021-00424-z","title":"Optimal two-qubit circuits for universal fault-tolerant quantum computation","year":2021,"lang":"en","type":"preprint","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Materials Research Science and Engineering Center, Harvard University; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Princeton Center for Complex Materials; National Science Foundation","keywords":"Quantum computer; Qubit; Universal set; Toffoli gate; Electronic circuit; Computation; Computer science; Quantum circuit; Quantum gate; Operator (biology); Controlled NOT gate; Gate count; Algorithm; Mathematics; Set (abstract data type); Topology (electrical circuits); Quantum; Quantum error correction; Quantum mechanics; Combinatorics; Physics; Embedded system","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007899752,0.000657157,0.0007177503,0.0005773203,0.0005242439,0.001622015,0.001517416,0.0004622,0.000008581007],"category_scores_gemma":[0.0001289824,0.000686848,0.0004571671,0.0005430822,0.00007714985,0.002050364,0.001288631,0.001019873,0.00005359543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000261603,"about_ca_system_score_gemma":0.0007913857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001465317,"about_ca_topic_score_gemma":0.000008425096,"domain_scores_codex":[0.9962236,0.0001724111,0.001194404,0.000786681,0.000861566,0.0007613515],"domain_scores_gemma":[0.9965886,0.0002943325,0.001028496,0.000946692,0.0009144396,0.0002273955],"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.0000271519,0.0000742557,0.00001284126,0.0004093471,0.00008855714,0.00001820901,0.006706354,0.8770972,0.00005686838,0.02384577,0.0007981819,0.09086526],"study_design_scores_gemma":[0.001338823,0.0001868082,0.0003556451,0.0003762372,0.0000416328,0.00009261713,0.0003767351,0.9891315,0.0001506089,0.003820345,0.003322973,0.0008060503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.201143,0.0001276188,0.7926862,0.0008529929,0.003301472,0.0009442153,0.00007702588,0.0006114403,0.0002559847],"genre_scores_gemma":[0.9107653,0.00003538084,0.08657147,0.0005306124,0.0004266768,0.00008897975,0.001522093,0.00003993121,0.000019509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7096223,"threshold_uncertainty_score":0.9995583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01531419014589208,"score_gpt":0.2561528027203275,"score_spread":0.2408386125744355,"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."}}