{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001229874,0.0006006906,0.0006747694,0.0005595154,0.0005151073,0.001237517,0.0009965972,0.0008919881,0.00468013],"category_scores_gemma":[0.00531701,0.0003239898,0.0004446388,0.0005381864,0.001337767,0.001799547,0.001147423,0.0009356639,0.0004169018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001681869,"about_ca_system_score_gemma":0.001358912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006976197,"about_ca_topic_score_gemma":0.001171992,"domain_scores_codex":[0.9988285,0.0003230523,0.00006862509,0.0001795971,0.0004084551,0.0001918891],"domain_scores_gemma":[0.9978372,0.001380403,0.0001771104,0.0002954078,0.0002162237,0.00009358537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004991078,0.0001956405,0.0007529759,0.0002830592,0.00004368532,0.0000999212,0.0001134018,0.442163,0.0287212,0.4381606,0.002958867,0.08600849],"study_design_scores_gemma":[0.00007267592,0.0000862721,0.00007890927,0.00001312532,0.00001367825,0.00003252894,0.00001562309,0.9041155,0.0124587,0.08191577,0.001186526,0.00001065916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2112861,0.0004267163,0.7726795,0.0009032082,0.00008535816,0.000187105,0.0001572484,0.001140004,0.01313477],"genre_scores_gemma":[0.8531026,0.0001206675,0.1445874,0.0001666648,0.00002799728,0.0001269396,0.0001353373,0.0000918675,0.0016405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00468013,"threshold_uncertainty_score":0.01565659,"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."}}