{"id":"W1993936114","doi":"10.1023/b:ijtp.0000048589.20608.aa","title":"Unstructured Adiabatic Quantum Search","year":2004,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Adiabatic quantum computation; Hamiltonian (control theory); Adiabatic process; Quantum; Quantum computer; Computation; Quantum algorithm; Computational complexity theory; Mathematics; Time complexity; Speedup; Statistical physics; Physics; Quantum mechanics; Discrete mathematics; Computer science; Algorithm; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.0002939694,0.0001176065,0.0001718254,0.00009191509,0.00004990256,0.0001742262,0.001671189,0.00003972526,0.00001850325],"category_scores_gemma":[0.0001001352,0.0000880552,0.0001796951,0.0001724185,0.0002180318,0.0002261758,0.0002261082,0.0003904066,0.00001827263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000766119,"about_ca_system_score_gemma":0.0001613178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002256759,"about_ca_topic_score_gemma":7.101583e-8,"domain_scores_codex":[0.9984796,0.00006017659,0.0003264607,0.0001468093,0.0007910012,0.0001959751],"domain_scores_gemma":[0.9989426,0.0001486584,0.0001547653,0.0001930403,0.0004294333,0.0001315109],"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.00001467763,0.00006895413,0.00001142602,0.00000235387,0.00006201038,0.00009234712,0.0003893049,0.0355908,0.0004948947,0.9175898,0.00002389982,0.0456595],"study_design_scores_gemma":[0.0005594431,0.0001464867,0.0001966046,0.00006587122,0.000006086294,0.0003090778,0.00001149992,0.1156729,0.004249958,0.8785968,0.00008657513,0.00009866065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.138851,0.00003953928,0.8540334,0.00508997,0.001564594,0.00003235788,0.00000317358,0.00002682563,0.0003591019],"genre_scores_gemma":[0.9464304,0.000007350342,0.0522577,0.0004108172,0.0008812351,2.3504e-7,6.220653e-7,0.000008544232,0.000003112829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8075793,"threshold_uncertainty_score":0.3590786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00732138700881618,"score_gpt":0.2594384782595475,"score_spread":0.2521170912507313,"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."}}