{"id":"W2951495502","doi":"","title":"Finding shortest lattice vectors faster using quantum search","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Lattice problem; Quantum; Quantum algorithm; Computer science; Heuristic; Lattice (music); Mathematics; Discrete mathematics; Algorithm; Mathematical optimization; Cryptography; Physics; Quantum mechanics","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.00155542,0.0004495404,0.001081305,0.001129081,0.000826779,0.002025975,0.00131062,0.001103411,0.01120787],"category_scores_gemma":[0.008073104,0.0004158225,0.000872617,0.001375244,0.001960508,0.004380169,0.001945398,0.002513922,0.001489767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144177,"about_ca_system_score_gemma":0.001800387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142469,"about_ca_topic_score_gemma":0.001707892,"domain_scores_codex":[0.997962,0.0007029574,0.0001085409,0.0003147063,0.0007140986,0.0001976822],"domain_scores_gemma":[0.9960705,0.002546654,0.0002305954,0.0007326405,0.000270465,0.0001491069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006263298,0.000353503,0.001197246,0.000429672,0.0001019857,0.0000972097,0.0002403133,0.1762067,0.01445729,0.6637844,0.009221592,0.1332838],"study_design_scores_gemma":[0.0001475897,0.0001039849,0.0001489062,0.00003777736,0.00001267713,0.00006175316,0.00007212621,0.5494609,0.005223677,0.4401079,0.004597283,0.00002538902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1645717,0.001004684,0.7988437,0.002529098,0.0003013281,0.0002179025,0.0002302874,0.001714361,0.03058693],"genre_scores_gemma":[0.6522343,0.0004085984,0.3400338,0.0004713924,0.0001226877,0.000173649,0.0003048876,0.0003907177,0.005859995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01120787,"threshold_uncertainty_score":0.03749406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05176874913598306,"score_gpt":0.3106721060402166,"score_spread":0.2589033569042335,"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."}}