{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003318794,0.0003331246,0.0002701616,0.0001269204,0.0004429058,0.0003994282,0.0037249,0.000223079,0.00001283544],"category_scores_gemma":[0.00001322541,0.0002638069,0.0002590727,0.0003102721,0.0001125512,0.0002396553,0.001426949,0.0006095304,0.0000442334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007860084,"about_ca_system_score_gemma":0.0001642462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002596402,"about_ca_topic_score_gemma":0.00001097789,"domain_scores_codex":[0.9980772,0.00009979465,0.0001685419,0.001107723,0.0001019765,0.0004447435],"domain_scores_gemma":[0.9972879,0.0002921948,0.0002006921,0.001855897,0.0002001733,0.0001631054],"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.00000370867,0.00008604945,0.00003484271,0.00002922321,0.00009994632,0.00004139304,0.0003540815,0.7651126,0.000009172564,0.06390247,0.000994525,0.169332],"study_design_scores_gemma":[0.000234326,0.00008162892,0.0002738162,0.00002938552,0.00003706416,0.000006187536,0.00003177387,0.9416987,0.00002610516,0.05399891,0.003235361,0.0003468037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0351113,0.0001156534,0.9620609,0.0003305288,0.001312823,0.0005849186,0.00002681404,0.000332133,0.0001249246],"genre_scores_gemma":[0.9060606,0.00008015795,0.0919601,0.0004053133,0.0006139645,0.000007358996,0.00001922831,0.0000350614,0.0008182491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8709493,"threshold_uncertainty_score":0.9999814,"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."}}