{"id":"W2981894857","doi":"10.1038/s41598-020-71654-y","title":"On speeding up factoring with quantum SAT solvers","year":2020,"lang":"en","type":"preprint","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Speedup; Factorization; Factoring; Computer science; Integer factorization; Quantum; Quantum sort; Quantum algorithm; Quantum computer; Quantum phase estimation algorithm; Parallel computing; Multiplication (music); Prime factor; Algorithm; Arithmetic; Mathematics; Prime (order theory); Combinatorics; Quantum mechanics; Quantum simulator; Physics","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.001933139,0.001299747,0.001152487,0.001031778,0.0009604293,0.002406697,0.001696142,0.001303938,0.02875972],"category_scores_gemma":[0.01094708,0.0005883146,0.001554319,0.001766699,0.00179564,0.006746511,0.001947944,0.002939476,0.004941524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001662641,"about_ca_system_score_gemma":0.001504759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003089272,"about_ca_topic_score_gemma":0.004604366,"domain_scores_codex":[0.9978827,0.0006462099,0.0001030466,0.0004383964,0.0005789067,0.0003507539],"domain_scores_gemma":[0.9950073,0.003350068,0.0001860963,0.0009949468,0.0003626298,0.00009894809],"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.0007372136,0.0002809837,0.002000937,0.0007815616,0.0001514924,0.0002585994,0.0003992839,0.1539379,0.01728337,0.4890532,0.02263239,0.312483],"study_design_scores_gemma":[0.000175911,0.0001361186,0.0003060992,0.0001269997,0.00007422679,0.0002133759,0.0001066713,0.5895929,0.01598951,0.366979,0.02625456,0.00004462282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07103124,0.001888421,0.8621989,0.002787809,0.0003723198,0.0002812128,0.000299324,0.01042562,0.0507152],"genre_scores_gemma":[0.3651714,0.00101485,0.6204271,0.0007177219,0.0002212815,0.0002370645,0.0006159908,0.001170504,0.01042412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02875972,"threshold_uncertainty_score":0.09621084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02793392925822373,"score_gpt":0.2520456904705258,"score_spread":0.2241117612123021,"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."}}