{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003381613,0.0003040747,0.0003722111,0.0002748917,0.0001352559,0.00007950053,0.001509502,0.000239214,0.000009696662],"category_scores_gemma":[0.00002566738,0.0003129163,0.0002275359,0.000595753,0.0001092101,0.00009309261,0.001913293,0.0004647059,0.00002686401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001164147,"about_ca_system_score_gemma":0.0001155289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000438294,"about_ca_topic_score_gemma":0.0000023268,"domain_scores_codex":[0.9982705,0.0001391903,0.0002790501,0.0007771509,0.0001425699,0.0003915215],"domain_scores_gemma":[0.9981471,0.00008448571,0.0003674339,0.001076452,0.0001613915,0.0001631221],"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.000007421203,0.0002192444,0.0003361563,0.0001020124,0.00003977647,0.00001818109,0.0006006546,0.9473594,0.0002456536,0.04736043,0.00002760962,0.003683452],"study_design_scores_gemma":[0.0002489044,0.00005117818,0.0004209589,0.0001205726,0.00003338815,0.000005167679,0.00002816939,0.9941312,0.0008937336,0.003616803,0.0001148564,0.0003350355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5156633,0.0000569667,0.4827858,0.00003294444,0.0005744776,0.0001670846,0.000006639513,0.0001288288,0.0005840653],"genre_scores_gemma":[0.9879746,0.000007015796,0.01173247,0.00003250016,0.0001189042,4.918829e-7,0.000009180201,0.00001652416,0.0001082911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4723114,"threshold_uncertainty_score":0.9999323,"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."}}