{"id":"W1992938819","doi":"10.1007/s10623-015-0067-5","title":"Finding shortest lattice vectors faster using quantum search","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Engineering and Physical Sciences Research Council; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Lorentz Center; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Lattice problem; Quantum; Lattice (music); Computer science; Theoretical computer science; Algorithm; Physics; Quantum mechanics; Cryptography","routes":{"ca_aff":true,"ca_fund":true,"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.00126207,0.0006748764,0.001222264,0.001290528,0.0009356158,0.002047115,0.00148274,0.00120952,0.01110597],"category_scores_gemma":[0.008053584,0.0005742931,0.001113459,0.001883397,0.001848279,0.005793813,0.002061534,0.002515236,0.002241723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784995,"about_ca_system_score_gemma":0.002553947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002362266,"about_ca_topic_score_gemma":0.00454759,"domain_scores_codex":[0.9980978,0.0005178099,0.0001022368,0.0003482907,0.0007320936,0.0002017871],"domain_scores_gemma":[0.9970405,0.001692315,0.0002112684,0.0006932967,0.0002572601,0.000105336],"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.0005166916,0.0003329377,0.0009038033,0.0004339714,0.0001114338,0.00008543587,0.0002355858,0.1819599,0.01487622,0.5848801,0.01194488,0.203719],"study_design_scores_gemma":[0.0001871722,0.00009622561,0.0001471374,0.00004304518,0.0000204697,0.00005799133,0.00008117162,0.5871657,0.004886474,0.4007394,0.006541844,0.00003338468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.078821,0.000781259,0.8897461,0.001787514,0.0002423438,0.00018076,0.0002326944,0.002300927,0.02590742],"genre_scores_gemma":[0.3847722,0.0005478958,0.6056462,0.000539278,0.0001364985,0.0002630658,0.0004738797,0.0005951928,0.007025698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01110597,"threshold_uncertainty_score":0.03715312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08119813990694018,"score_gpt":0.2931261093051544,"score_spread":0.2119279693982142,"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."}}