{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759458,0.0006388543,0.0007265661,0.0004643675,0.0006494598,0.0009167246,0.0005888694,0.0006532702,0.006287575],"category_scores_gemma":[0.002302373,0.0003469933,0.0007264927,0.000607165,0.001896249,0.002138537,0.001611823,0.002100039,0.0007832906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009509451,"about_ca_system_score_gemma":0.0007157905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009604581,"about_ca_topic_score_gemma":0.0009418143,"domain_scores_codex":[0.9996357,0.0001601851,0.00001498771,0.00004668587,0.00008280569,0.00005961894],"domain_scores_gemma":[0.9995292,0.0002475239,0.00002435187,0.0001291984,0.00003733571,0.00003250837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007234251,0.00003441029,0.0001038374,0.00006200507,0.00001404114,0.00002739299,0.00008155,0.0926462,0.002282684,0.8756118,0.002263753,0.02679991],"study_design_scores_gemma":[0.00001594476,0.00002336477,0.00004602654,0.00001276273,0.000005859648,0.00001353939,0.00001855483,0.3291391,0.00123863,0.6659814,0.003495466,0.000009353312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03808553,0.001126177,0.9337859,0.0009246837,0.0001514225,0.00005743644,0.00006316406,0.0003041907,0.02550152],"genre_scores_gemma":[0.6113962,0.001209115,0.374386,0.0004037514,0.0001408395,0.0002073793,0.0001601648,0.0003058019,0.01179074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006287575,"threshold_uncertainty_score":0.02103406,"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."}}