{"id":"W2035288980","doi":"10.1103/physrevlett.110.190502","title":"Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>T</mml:mi></mml:math>Circuits Using a Constant Number of Ancillary Qubits","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Qubit; Upper and lower bounds; Unitary state; Sequence (biology); Algorithm; Quantum computer; Gate count; Discrete mathematics; Computer science; Mathematics; Quantum; Quantum mechanics; Physics; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0002838271,0.0002115992,0.0003107505,0.00003010813,0.0001504467,0.0001182092,0.0003848709,0.00005635768,0.000002518052],"category_scores_gemma":[0.0001655391,0.000203845,0.0002069123,0.0002670541,0.0003453103,0.0003244973,0.0003203673,0.0002408061,0.00003464587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009023267,"about_ca_system_score_gemma":0.0000778109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005476682,"about_ca_topic_score_gemma":0.000001107735,"domain_scores_codex":[0.9982547,0.00008905103,0.000474039,0.0003737896,0.0004650851,0.0003433013],"domain_scores_gemma":[0.9986544,0.0003282299,0.0004031809,0.0004177673,0.00007350501,0.0001228773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005382824,0.0001245324,0.00001168793,0.001005019,0.00005574215,0.00001021633,0.0003451959,0.0008139716,0.01504998,0.976007,0.00009241481,0.006478792],"study_design_scores_gemma":[0.0001607384,0.00013064,0.00004381581,0.00145906,0.00007006984,0.0000780316,0.00001481946,0.9952781,0.001864642,0.0004846102,0.000223332,0.0001921775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531391,0.0007201144,0.0448698,0.0009603018,0.0001007937,0.00008742246,0.0000158469,0.00004669673,0.00005995248],"genre_scores_gemma":[0.9741508,0.0001749907,0.02372533,0.001763303,0.0001137967,0.00002388039,0.00001971623,0.00002739616,8.237242e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9944641,"threshold_uncertainty_score":0.8312556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560738654984679,"score_gpt":0.2461841977216992,"score_spread":0.2305768111718524,"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."}}