{"id":"W4285800031","doi":"10.1103/physreva.106.012421","title":"Blind quantum factorization of 21","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Australian Research Council; Indian Institute of Technology Kanpur; University of Calgary; Shastri Indo-Canadian Institute","keywords":"Factorization; Computer science; Integer factorization; Scheme (mathematics); Quantum; Verifiable secret sharing; Quantum computer; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Algorithm; Physics; Encryption; Quantum mechanics; Computer network; Public-key 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006095188,0.0004036386,0.001335931,0.00007187483,0.0002677074,0.00004080573,0.001727192,0.00001930046,0.00003688989],"category_scores_gemma":[0.0004167643,0.000322894,0.0007703268,0.001907075,0.00009061048,0.0002277523,0.00110585,0.0006952042,0.00008658833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006702993,"about_ca_system_score_gemma":0.0001410444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001347288,"about_ca_topic_score_gemma":2.426753e-7,"domain_scores_codex":[0.9961025,0.0006374493,0.0007040512,0.000821265,0.001234076,0.0005006557],"domain_scores_gemma":[0.9973608,0.0004627569,0.000569715,0.001204436,0.0001747236,0.0002275561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003295366,0.004650969,0.0001741015,0.01792221,0.0002153511,0.00004868928,0.00100203,0.001490208,0.02993761,0.445131,0.01196415,0.4874307],"study_design_scores_gemma":[0.0009067457,0.001508532,0.0007755254,0.009612859,0.0003803047,0.00004600354,0.000009831802,0.6146497,0.00542711,0.1939217,0.1712678,0.001494003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2759665,0.1915959,0.5121398,0.01227328,0.001428367,0.004132139,0.0001181509,0.0006914765,0.001654396],"genre_scores_gemma":[0.9748901,0.02037038,0.001405069,0.002592104,0.0004484514,0.0001852065,0.0000369269,0.00003981505,0.00003194505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6989236,"threshold_uncertainty_score":0.9999223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01773675650501158,"score_gpt":0.3379044504636678,"score_spread":0.3201676939586562,"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."}}