{"id":"W2952032150","doi":"10.48550/arxiv.quant-ph/0006004","title":"Fast parallel circuits for the quantum Fourier transform","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Bounded function; Polynomial; Circuit complexity; Logarithm; Quantum Fourier transform; Fourier transform; Constant (computer programming); Combinatorics; Quantum computer; Discrete mathematics; Quantum circuit; Quantum; Electronic circuit; Quantum mechanics; Mathematical analysis; Physics; Quantum error correction; 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.001019016,0.00104748,0.000593752,0.001060272,0.00122537,0.002190193,0.001291979,0.001360869,0.01498491],"category_scores_gemma":[0.005217895,0.0005152232,0.001305157,0.001088676,0.001651093,0.00603446,0.002382545,0.003959471,0.001985493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003048314,"about_ca_system_score_gemma":0.001227663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001408514,"about_ca_topic_score_gemma":0.002422253,"domain_scores_codex":[0.9986493,0.0001938731,0.00006640267,0.0001986295,0.0007070325,0.000184752],"domain_scores_gemma":[0.997566,0.001509072,0.0001368291,0.000454468,0.000266709,0.00006689144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001661297,0.00007955165,0.0001843018,0.0001640742,0.00002347552,0.00008276173,0.0001545361,0.02340898,0.008178993,0.9032654,0.007011915,0.05727986],"study_design_scores_gemma":[0.00007353986,0.0000786274,0.0001583648,0.00007071038,0.0000396501,0.0001293943,0.00003658505,0.1872634,0.0115106,0.771139,0.02946445,0.0000357116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04319785,0.002192727,0.8680548,0.003802334,0.0007927832,0.0002403134,0.0005198529,0.002092568,0.07910668],"genre_scores_gemma":[0.5404195,0.002301916,0.4204557,0.001240684,0.000791658,0.0007287345,0.0006857884,0.0005944078,0.03278164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01498491,"threshold_uncertainty_score":0.05012953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03433781165195882,"score_gpt":0.2603485672887043,"score_spread":0.2260107556367454,"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."}}