{"id":"W1544479598","doi":"10.26421/qic14.11-12-4","title":"Decomposition and gluing for adiabatic quantum optimization","year":2014,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adiabatic process; Overhead (engineering); Factorization; Decomposition; Computer science; Quantum; Exploit; Quantum computer; Integer (computer science); Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005743408,0.0003373166,0.0003618653,0.0004100067,0.0004149339,0.001132177,0.0002911826,0.0002404172,0.000001103392],"category_scores_gemma":[0.00008810491,0.0003411667,0.00008449462,0.0001696997,0.00005229354,0.0009425182,0.0004313507,0.000304987,0.000004760115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004693518,"about_ca_system_score_gemma":0.00008683297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002159186,"about_ca_topic_score_gemma":9.178606e-7,"domain_scores_codex":[0.9982082,0.0001086173,0.0007069139,0.000416783,0.000277256,0.0002822045],"domain_scores_gemma":[0.9983751,0.0003110341,0.0006302915,0.0002649701,0.0002810812,0.0001375188],"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.00001207212,0.00001493228,0.00001303008,0.0004918599,0.00002133258,2.60873e-7,0.001547411,0.8235289,0.000005102578,0.03327097,0.0001909718,0.1409031],"study_design_scores_gemma":[0.0006036818,0.0001754728,0.0004310045,0.0002492387,0.00002553062,0.00002796664,0.00004844313,0.9594432,0.00001557735,0.0381605,0.0004319067,0.0003874792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05976251,0.0001863028,0.9370021,0.001012581,0.0009247691,0.0007090789,0.00001818797,0.0003318726,0.00005257882],"genre_scores_gemma":[0.752058,0.00008196101,0.2465182,0.0005865157,0.0001391675,0.00006932063,0.0005276685,0.00001663365,0.000002518699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6922954,"threshold_uncertainty_score":0.9999048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009687598522840056,"score_gpt":0.2610205254780608,"score_spread":0.2513329269552207,"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."}}