{"id":"W1966833372","doi":"10.1088/1367-2630/13/7/073011","title":"Elimination of perturbative crossings in adiabatic quantum optimization","year":2011,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Physics; Adiabatic process; Maxima and minima; Adiabatic quantum computation; Ising model; Quantum; Path (computing); Polynomial; Exponential growth; Exponential function; Order (exchange); Quantum computer; Quantum mechanics; PSPACE; Statistical physics; Computational complexity theory; Algorithm; Mathematical analysis; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001362076,0.0004268588,0.000914357,0.0005722247,0.001213664,0.0007597513,0.001031752,0.0007434867,0.002220237],"category_scores_gemma":[0.004489254,0.0004794906,0.0007979148,0.0007519987,0.00228202,0.001509543,0.002204705,0.002161065,0.0003391073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009506444,"about_ca_system_score_gemma":0.001329802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001120836,"about_ca_topic_score_gemma":0.001464479,"domain_scores_codex":[0.9988231,0.0003880921,0.00005124327,0.0001436142,0.0003872377,0.0002068039],"domain_scores_gemma":[0.9983404,0.0009854316,0.000124047,0.0003617851,0.0001071693,0.00008123185],"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.00021365,0.0001820682,0.0007757051,0.0001643511,0.00006289173,0.0001804269,0.0002766579,0.3204125,0.01275926,0.5855601,0.001888361,0.07752396],"study_design_scores_gemma":[0.00003464956,0.00008607034,0.0002105375,0.00001631454,0.00002391409,0.00006734882,0.00003176961,0.5973575,0.006450783,0.394257,0.001436802,0.00002738017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2008204,0.0004047178,0.777535,0.0006259056,0.00006911423,0.0001035205,0.00004867712,0.001238974,0.01915368],"genre_scores_gemma":[0.8200747,0.000218853,0.1766043,0.0001926901,0.0000387053,0.0001408527,0.0000671929,0.0002079054,0.00245491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002220237,"threshold_uncertainty_score":0.007427454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02145576038322922,"score_gpt":0.2386638769506149,"score_spread":0.2172081165673856,"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."}}