{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009536427,0.0001521715,0.0002689309,0.00006981979,0.0002310781,0.00007103146,0.000831794,0.00005784119,0.00003846784],"category_scores_gemma":[0.000009395113,0.0001697266,0.00008939939,0.0003573575,0.0002341666,0.0002398134,0.0008073391,0.0001750325,0.00006282533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001210927,"about_ca_system_score_gemma":0.00003908847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001043129,"about_ca_topic_score_gemma":0.00001272626,"domain_scores_codex":[0.9989023,0.00006628082,0.0001077915,0.0004324517,0.0002335351,0.0002576687],"domain_scores_gemma":[0.9992583,0.0000394858,0.0001134761,0.0002993093,0.00006721055,0.0002222024],"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":[0.0001495584,0.0004050744,0.005160408,0.0004308268,0.0002475304,0.0005770209,0.04623483,0.0007192077,0.002978882,0.04487889,0.007086566,0.8911312],"study_design_scores_gemma":[0.0007759647,0.0006094585,0.00956422,0.00007764844,0.00001764608,0.00003558607,0.0005113554,0.9704967,0.00005420835,0.002184494,0.01533551,0.0003371739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7336387,0.0001119961,0.2488721,0.01503858,0.0001244259,0.0002775482,0.00001432859,0.0004587376,0.001463565],"genre_scores_gemma":[0.9348838,0.000006282244,0.06450558,0.0003443035,0.00006039026,8.169101e-8,0.00001012277,0.000009804535,0.0001795894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9697775,"threshold_uncertainty_score":0.6921249,"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."}}