{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164732,0.0005524728,0.001231864,0.0006603697,0.0007735703,0.001829703,0.00120407,0.001150796,0.0107724],"category_scores_gemma":[0.003182692,0.0004276425,0.0008825206,0.001316698,0.001105295,0.004952063,0.001098079,0.002657173,0.001698428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008517012,"about_ca_system_score_gemma":0.001699382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001961884,"about_ca_topic_score_gemma":0.004102044,"domain_scores_codex":[0.9991872,0.0002526997,0.00004256636,0.0001016127,0.0003273703,0.00008872573],"domain_scores_gemma":[0.9989471,0.0006491041,0.00005351926,0.0002000163,0.00009793676,0.00005247659],"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.0004680147,0.0003608169,0.0004791517,0.000640445,0.0001251688,0.00007471108,0.0003121682,0.1387365,0.016405,0.601656,0.0229273,0.2178147],"study_design_scores_gemma":[0.0001916142,0.00008263943,0.0001381057,0.00004101923,0.00002357307,0.0000563365,0.0001068793,0.4435048,0.003985085,0.5420791,0.009764906,0.00002594005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1499913,0.003145844,0.7658351,0.004211388,0.0008643563,0.0001946318,0.0003576424,0.002422706,0.07297695],"genre_scores_gemma":[0.3499253,0.00114349,0.6316276,0.0004917759,0.0003356953,0.00017706,0.0004573998,0.0005852822,0.01525648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0107724,"threshold_uncertainty_score":0.03603727,"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."}}