{"id":"W7060971830","doi":"","title":"OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM COMPUTATION","year":2011,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Gyrotron and Vacuum Electronics Research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Quantum annealing; Adiabatic quantum computation; Quantum computer; Adiabatic process; Factorization; Computation; Quantum algorithm; Quantum; Exponential function; Quadratic unconstrained binary optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.00048166,0.000363613,0.0004020511,0.0004444914,0.0006686641,0.0006777227,0.000518041,0.0007024194,0.007583906],"category_scores_gemma":[0.00230708,0.0003396184,0.0003561506,0.0004631946,0.0009840174,0.0009903183,0.0006990273,0.0009561946,0.0005873764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205893,"about_ca_system_score_gemma":0.001164544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00181413,"about_ca_topic_score_gemma":0.003148868,"domain_scores_codex":[0.9997813,0.00007558203,0.000008062682,0.0000363271,0.0000611404,0.00003750917],"domain_scores_gemma":[0.9996189,0.00024806,0.00002405114,0.00005451417,0.00003722798,0.0000172668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001497486,0.00006948355,0.0003334708,0.00007096922,0.00001272001,0.00004034637,0.0001095482,0.6446103,0.003832505,0.300973,0.002730683,0.04706718],"study_design_scores_gemma":[0.00002711734,0.0000304803,0.0000964006,0.000009909367,0.000006026251,0.0000105422,0.00001841321,0.862975,0.001517572,0.1330169,0.00228176,0.000009867261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1574367,0.0007552251,0.7860968,0.0009703995,0.0001047368,0.0001518193,0.0002703345,0.001024355,0.05318961],"genre_scores_gemma":[0.7407265,0.0003443415,0.2505507,0.0001118588,0.00001856374,0.0002031661,0.0002050138,0.0002286148,0.007611293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007583906,"threshold_uncertainty_score":0.02537072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006828315937963072,"score_gpt":0.1856834500686861,"score_spread":0.178855134130723,"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."}}