{"id":"W1599413552","doi":"10.4230/lipics.stacs.2014.482","title":"An optimal quantum algorithm for the oracle identification problem","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum algorithm; Oracle; Algorithm; Mathematics; Matrix multiplication; Conjecture; Discrete mathematics; Reduction (mathematics); Quantum; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00169467,0.0008399073,0.0007573997,0.0003341596,0.001143595,0.00343945,0.005311303,0.000586108,0.00001213433],"category_scores_gemma":[0.00006968037,0.0006329465,0.0006172951,0.0003379934,0.0001972579,0.001541155,0.002020585,0.001330924,0.00009424654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001496313,"about_ca_system_score_gemma":0.0002842286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000613189,"about_ca_topic_score_gemma":0.000005251909,"domain_scores_codex":[0.9950936,0.00009952352,0.001903336,0.0008937606,0.0008097935,0.00119995],"domain_scores_gemma":[0.9941186,0.0004399367,0.001464985,0.002774448,0.0008913922,0.0003106864],"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.0000429079,0.0006446189,0.00004171126,0.001410054,0.0004947617,0.000003024792,0.01657053,0.06186835,0.00004065945,0.01498321,0.009431492,0.8944687],"study_design_scores_gemma":[0.001018613,0.0003008337,0.0001692285,0.0002067436,0.00007272499,0.0000429704,0.0003786622,0.9629656,0.0003180634,0.009042934,0.02467398,0.0008096657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01401411,0.0001927458,0.9747109,0.001118377,0.003319461,0.004919421,0.001016626,0.0006161468,0.00009223949],"genre_scores_gemma":[0.07175548,0.00008036997,0.9218674,0.0008353213,0.001164966,0.002152324,0.001721949,0.000148906,0.0002732619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9010972,"threshold_uncertainty_score":0.9996122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01459900078775074,"score_gpt":0.2688054297050613,"score_spread":0.2542064289173106,"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."}}