{"id":"W3081696210","doi":"10.4230/lipics.mfcs.2020.26","title":"Span Programs and Quantum Time Complexity.","year":2020,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum complexity theory; Computer science; Quantum algorithm; Time complexity; Quantum phase estimation algorithm; Span (engineering); Algorithm; Computational complexity theory; Quantum computer; Worst-case complexity; Quantum; Theoretical computer science; Average-case complexity; Quantum error correction; 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.00168431,0.0006415176,0.00054708,0.0008430294,0.001172292,0.002320096,0.00116694,0.001105141,0.007763908],"category_scores_gemma":[0.008569274,0.0005030205,0.00173006,0.001102079,0.00353701,0.007880703,0.002548791,0.004043113,0.0007232581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002504653,"about_ca_system_score_gemma":0.001585664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002039484,"about_ca_topic_score_gemma":0.001284495,"domain_scores_codex":[0.9973071,0.0006806489,0.0001270252,0.0005628243,0.0009210717,0.0004015047],"domain_scores_gemma":[0.9945372,0.003559148,0.0003299526,0.0009300828,0.0004915431,0.0001520846],"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.00004588555,0.00003077982,0.0001848259,0.00007243582,0.00001166737,0.00003502897,0.0001372255,0.00596734,0.001425678,0.9796316,0.000949308,0.01150808],"study_design_scores_gemma":[0.00002422295,0.00007257537,0.0002999131,0.00003191826,0.00003048036,0.00009690325,0.00005256062,0.07322773,0.005413529,0.9081143,0.01261625,0.00001974357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05067404,0.0006203155,0.9069769,0.002428309,0.0001950773,0.0001684958,0.0002212614,0.00124548,0.03747017],"genre_scores_gemma":[0.6118078,0.001034388,0.3625896,0.001392785,0.0003730418,0.0007189629,0.0004768022,0.0009849839,0.02062154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007763908,"threshold_uncertainty_score":0.0259729,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02141957794863317,"score_gpt":0.1881405908427754,"score_spread":0.1667210128941423,"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."}}