{"id":"W2950488211","doi":"10.48550/arxiv.1212.6253","title":"Efficient Clifford+T approximation of single-qubit operators","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity","keywords":"Combinatorics; Mathematics; Sequence (biology); Operator (biology); Binary logarithm; Product (mathematics); Constant (computer programming); Polynomial; Discrete mathematics; Mathematical analysis; Computer science","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.0006953872,0.0007217815,0.0008211601,0.0003350839,0.0006021782,0.0008717855,0.001569616,0.0008526829,0.004660765],"category_scores_gemma":[0.002874456,0.0003014084,0.0006939757,0.0005747711,0.0008323737,0.001410864,0.001518329,0.001168181,0.001327871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242473,"about_ca_system_score_gemma":0.001817012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002807473,"about_ca_topic_score_gemma":0.004313489,"domain_scores_codex":[0.9990034,0.0002059171,0.00004708222,0.0001526854,0.0003623037,0.0002287365],"domain_scores_gemma":[0.9989648,0.0002881239,0.00009406285,0.0004715286,0.0001235874,0.00005790309],"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.001557045,0.0003661755,0.003363292,0.0003654363,0.0001076668,0.0004146519,0.0004321627,0.364943,0.05404789,0.2959087,0.01269327,0.2658006],"study_design_scores_gemma":[0.00008577292,0.0001006299,0.0001660278,0.00001131491,0.0000117166,0.00007970759,0.00003438321,0.9230236,0.01700892,0.05778919,0.00167204,0.00001672227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1528773,0.000190301,0.8334332,0.000373512,0.00007869622,0.0001283912,0.0001597629,0.002973061,0.009785893],"genre_scores_gemma":[0.705363,0.00009763414,0.2878792,0.0001866734,0.00003173606,0.0001671039,0.0003844992,0.00026246,0.005627744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004660765,"threshold_uncertainty_score":0.0155918,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04388913428643814,"score_gpt":0.181536052302251,"score_spread":0.1376469180158128,"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."}}