{"id":"W2911695748","doi":"10.1038/s41598-022-11687-7","title":"Factoring semi-primes with (quantum) SAT-solvers","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Quantum computer; Computer science; Integer factorization; Quantum algorithm; Post-quantum cryptography; Boolean satisfiability problem; Factorization; Quantum; Cryptography; Time complexity; Theoretical computer science; Factoring; Satisfiability; Algorithm; Discrete mathematics; Parallel computing; Public-key cryptography; Mathematics; Quantum mechanics; Encryption","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.002102299,0.0006951059,0.0008327561,0.0006113965,0.0008858505,0.00247719,0.001262622,0.0009956065,0.01315824],"category_scores_gemma":[0.00948673,0.0005452873,0.001434545,0.001017083,0.002213909,0.004869004,0.002192637,0.00279317,0.002773006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008660387,"about_ca_system_score_gemma":0.0015091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006691391,"about_ca_topic_score_gemma":0.001240375,"domain_scores_codex":[0.9982108,0.0005919851,0.0001170246,0.0003786589,0.0005293557,0.0001721595],"domain_scores_gemma":[0.9955369,0.002818359,0.0002261916,0.001062003,0.0002809681,0.00007567825],"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.0004022636,0.0002409898,0.001337577,0.0009832592,0.0001380258,0.0002808751,0.0005390681,0.1129662,0.01030773,0.7347478,0.01081991,0.1272363],"study_design_scores_gemma":[0.0001114225,0.0001033585,0.0001214794,0.00008940403,0.00004023408,0.0001458104,0.0001634211,0.2209927,0.01455329,0.7469988,0.01665474,0.00002529165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05111943,0.000690527,0.9170762,0.001606612,0.0002153981,0.0002458081,0.0004201498,0.001684808,0.02694107],"genre_scores_gemma":[0.3429025,0.0006983335,0.6474975,0.000442669,0.0001615125,0.0002712003,0.0008665956,0.0004423504,0.006717348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01315824,"threshold_uncertainty_score":0.04401869,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009637495079463697,"score_gpt":0.2141646400311276,"score_spread":0.2045271449516639,"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."}}