{"id":"W2950042952","doi":"10.48550/arxiv.1308.4134","title":"An algorithm for the T-count","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Toffoli gate; Gate count; Quantum computer; Context (archaeology); Quantum gate; Mathematics; Electronic circuit; Computation; Unitary state; Computer science; Algorithm; Discrete mathematics; Qubit; Quantum circuit; Topology (electrical circuits); Combinatorics; Quantum; Quantum error correction; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":false,"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.0008037683,0.001083907,0.0008560916,0.001136815,0.001128573,0.002236407,0.002341452,0.001705758,0.01504332],"category_scores_gemma":[0.004502892,0.0005486782,0.001331465,0.00124658,0.001313706,0.003584917,0.002637159,0.00247033,0.003068266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002109186,"about_ca_system_score_gemma":0.002752112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001481931,"about_ca_topic_score_gemma":0.002080219,"domain_scores_codex":[0.9987318,0.0002172816,0.0001009864,0.0003856741,0.0003700112,0.0001942608],"domain_scores_gemma":[0.9980732,0.0009609054,0.0001438015,0.0004089676,0.0003051469,0.0001077999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006944048,0.0003910662,0.001245499,0.0006491617,0.0001086616,0.0003009301,0.0003510376,0.06310048,0.02147855,0.3729914,0.02942928,0.5092595],"study_design_scores_gemma":[0.0003262318,0.0002491323,0.0002761456,0.0000847081,0.00005213174,0.0004851831,0.0001208017,0.5244666,0.02169102,0.4348314,0.01733937,0.00007737117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01146398,0.0001621364,0.9763259,0.0008065799,0.0001271531,0.0002556492,0.0002049354,0.002277191,0.008376457],"genre_scores_gemma":[0.1310632,0.0001613257,0.860784,0.0003606355,0.00008992368,0.0004299862,0.0004763679,0.0004437712,0.006190706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01504332,"threshold_uncertainty_score":0.05032492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03905979434288018,"score_gpt":0.1923644366158335,"score_spread":0.1533046422729533,"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."}}