{"id":"W2159862444","doi":"10.1109/sfcs.2000.892140","title":"Fast parallel circuits for the quantum Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Log-log plot; Bounded function; Quantum Fourier transform; Circuit complexity; Polynomial; Fourier transform; Combinatorics; Omega; Constant (computer programming); Discrete mathematics; Quantum computer; Electronic circuit; Quantum; Physics; Mathematical analysis; Quantum mechanics; Quantum gate; Computer science","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.0002107215,0.0001431302,0.0001249586,0.00004027894,0.0003792214,0.0001772833,0.0009979896,0.00004450935,0.00005410869],"category_scores_gemma":[0.00001643504,0.00008259255,0.0001431664,0.0002177518,0.00004343627,0.0001295644,0.00006404461,0.0001406202,0.00004926702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009085444,"about_ca_system_score_gemma":0.00001199675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001207743,"about_ca_topic_score_gemma":0.000007031758,"domain_scores_codex":[0.998904,0.00001893417,0.0001751025,0.0003072213,0.0002124891,0.0003821857],"domain_scores_gemma":[0.9990509,0.0003006716,0.00003671014,0.0004934922,0.00004187404,0.00007633999],"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":[9.224615e-7,0.00004012659,0.000005840178,0.000007700365,0.00002081743,0.000002848335,0.001158553,0.003996746,0.00001661109,0.08880644,0.007719117,0.8982243],"study_design_scores_gemma":[0.0003078755,0.00008364907,0.0001105761,0.000005944775,0.000004777049,0.00002617318,0.00002058005,0.9381272,0.00005206847,0.01008688,0.05103168,0.0001425485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007546039,0.0003247902,0.9783158,0.01605443,0.0004469147,0.0003110302,0.000002521769,0.0002237955,0.003566099],"genre_scores_gemma":[0.8284865,0.00006856753,0.1616369,0.003179295,0.0005844973,0.00009262993,0.000001461423,0.00003148829,0.005918608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9341305,"threshold_uncertainty_score":0.3368027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0235292123793545,"score_gpt":0.2300955484066118,"score_spread":0.2065663360272574,"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."}}