{"id":"W4389116444","doi":"10.48550/arxiv.2311.15873","title":"Taming Quantum Time Complexity","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; QuantERA; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum; Quantum complexity theory; Computer science; Computational complexity theory; Subroutine; Reduction (mathematics); Bounded function; Quantum algorithm; Time complexity; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Quantum mechanics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003464355,0.000848869,0.001133991,0.001009231,0.001796522,0.004844669,0.0021158,0.001868462,0.00988953],"category_scores_gemma":[0.02596395,0.0008035245,0.002016856,0.001122549,0.008140806,0.01411752,0.006861964,0.00681875,0.001713824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003443416,"about_ca_system_score_gemma":0.002427594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001568912,"about_ca_topic_score_gemma":0.0009826374,"domain_scores_codex":[0.9920639,0.001716808,0.0004100647,0.001886575,0.003034061,0.0008886388],"domain_scores_gemma":[0.9769576,0.01351854,0.0007461414,0.006937338,0.0013367,0.0005035945],"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.00006457674,0.00002517067,0.0002464402,0.00007944,0.00001318693,0.00005543283,0.0002593511,0.006020756,0.001779087,0.9797714,0.00121595,0.01046913],"study_design_scores_gemma":[0.0000279682,0.00004863472,0.000137893,0.00002754326,0.00002324296,0.00007227855,0.00005623597,0.03752132,0.003581954,0.9484706,0.01000869,0.00002370405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05664901,0.0009165935,0.8755082,0.008004952,0.0005170612,0.000123056,0.0003123791,0.002532127,0.0554367],"genre_scores_gemma":[0.8070178,0.001192774,0.1690692,0.003263832,0.0008670033,0.0004486338,0.0003439785,0.001232359,0.01656437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00988953,"threshold_uncertainty_score":0.0330838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09829531483341708,"score_gpt":0.1995981029478562,"score_spread":0.1013027881144391,"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."}}