{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750218,0.0007163361,0.001238708,0.0007629512,0.00146065,0.001786479,0.002492222,0.002533995,0.008709878],"category_scores_gemma":[0.007420434,0.0005214494,0.001028137,0.001123489,0.001851052,0.00501407,0.004058773,0.002852106,0.001949015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164971,"about_ca_system_score_gemma":0.003456751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090805,"about_ca_topic_score_gemma":0.00149178,"domain_scores_codex":[0.9972134,0.0006408812,0.0001774178,0.0008465188,0.0007820035,0.0003398098],"domain_scores_gemma":[0.9974422,0.001315626,0.0001406754,0.0006253782,0.0003372107,0.0001389012],"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.0008766205,0.0005223248,0.00101845,0.0003025838,0.0000885072,0.0001937892,0.0004450955,0.07970192,0.0171943,0.5342183,0.01745254,0.3479856],"study_design_scores_gemma":[0.000236113,0.0001174735,0.0002439691,0.0000272888,0.00003402042,0.0001780234,0.0000898244,0.5667415,0.01073241,0.4156796,0.005869098,0.00005067085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02060456,0.0001119103,0.9707569,0.001046924,0.00009562098,0.0001408856,0.0001376737,0.001465188,0.005640261],"genre_scores_gemma":[0.278413,0.0001207288,0.7123793,0.0005695114,0.0001112231,0.0003752924,0.0004891982,0.0003708072,0.007170861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008709878,"threshold_uncertainty_score":0.02913743,"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."}}