{"id":"W1890759571","doi":"10.1007/978-3-642-38616-9_6","title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Lattice problem; Quantum algorithm; Quantum; Quantum computer; Cryptosystem; Time complexity; Computational complexity theory; Search algorithm","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.001764319,0.0007421229,0.0006752902,0.0009591835,0.0005558539,0.001646799,0.00524942,0.0003364815,0.00002964469],"category_scores_gemma":[0.00006272434,0.0005216936,0.0001691476,0.001143287,0.0008791963,0.0007063199,0.002847621,0.002084793,0.00005729395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003051347,"about_ca_system_score_gemma":0.000704032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002726659,"about_ca_topic_score_gemma":0.0001520427,"domain_scores_codex":[0.9944747,0.0001320186,0.0007847295,0.001914194,0.00136505,0.001329286],"domain_scores_gemma":[0.9965257,0.001060532,0.0003039824,0.001666638,0.0002465433,0.0001966179],"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.000003551783,0.00004756541,0.0002144376,0.00007497004,0.00001686052,0.000181151,0.003707724,0.5499352,0.0003446606,0.01164625,0.00001306381,0.4338146],"study_design_scores_gemma":[0.0001688964,0.0001167931,0.0004220122,0.0007970025,0.000005820022,0.0001595952,9.023839e-7,0.9578241,0.0001983721,0.03938589,0.0002773345,0.0006432732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007974688,0.000651273,0.986369,0.001779452,0.001420605,0.0008018251,0.000003124492,0.000160543,0.0008394576],"genre_scores_gemma":[0.4929047,0.00002603988,0.5046575,0.001193158,0.000932266,0.00001455001,0.000002556299,0.00007936019,0.0001898288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.48493,"threshold_uncertainty_score":0.9997234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0275798073224334,"score_gpt":0.2599826376378988,"score_spread":0.2324028303154654,"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."}}