{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969118,0.0002297946,0.0002360618,0.0003378674,0.0003009232,0.0004532333,0.0004980864,0.00008004879,0.000003168275],"category_scores_gemma":[0.0000200603,0.000196212,0.0001009262,0.0008869668,0.0001189136,0.00025555,0.0002619829,0.0002499541,0.000005728604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000150844,"about_ca_system_score_gemma":0.0000696202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007974431,"about_ca_topic_score_gemma":0.000003642833,"domain_scores_codex":[0.9982642,0.000154004,0.0002203624,0.0004963541,0.0003680023,0.0004970859],"domain_scores_gemma":[0.9989876,0.0001595278,0.00006061802,0.0003777755,0.0001048152,0.0003096933],"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.000165014,0.0009662526,0.1440574,0.0003050066,0.0007453085,0.001074928,0.03888939,0.08090801,0.02174934,0.446144,0.002834509,0.2621608],"study_design_scores_gemma":[0.0003676402,0.0002619163,0.002802088,0.00006702178,0.00001892611,0.0001454853,0.0002613154,0.9867458,0.0006188018,0.00742247,0.0008903948,0.0003981167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4827043,0.0003371785,0.5163347,0.0001039925,0.0001861951,0.00008330737,0.00000235549,0.0001140292,0.0001339551],"genre_scores_gemma":[0.8581386,0.00001324439,0.1415388,0.0001659097,0.0001165352,0.000002875301,0.000001968091,0.00001675908,0.000005328783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058378,"threshold_uncertainty_score":0.8001291,"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."}}