{"id":"W4409048807","doi":"10.1038/s41598-025-95283-5","title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings","year":2025,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Computer science; Speedup; Quantum; Arithmetic; Quantum computer; Binary logarithm; Polynomial; Binary number; Discrete mathematics; Quantum algorithm; Dimension (graph theory); Algorithm; Mathematics; Parallel computing; Combinatorics; Physics; Quantum mechanics","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":[],"consensus_categories":[],"category_scores_codex":[0.001926682,0.0001959304,0.000366313,0.0006585452,0.0005409411,0.0008166557,0.001070906,0.00007368249,0.000008769152],"category_scores_gemma":[0.0001937151,0.0001731012,0.000191212,0.001839986,0.0002484095,0.0004777417,0.001130331,0.0002069366,0.000001339198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005335641,"about_ca_system_score_gemma":0.0005959209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001526892,"about_ca_topic_score_gemma":0.000003435362,"domain_scores_codex":[0.9972163,0.00009532436,0.0007369933,0.0009903671,0.0005279735,0.0004330112],"domain_scores_gemma":[0.9978611,0.0001332186,0.0004877819,0.001243313,0.0001751286,0.00009941969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001446203,0.000714079,0.006849367,0.000681576,0.0002544179,0.002981385,0.005847145,0.1549345,0.6895935,0.003996737,0.02159999,0.1124027],"study_design_scores_gemma":[0.0006205144,0.00003439446,0.0008378657,0.0003853028,0.00002452731,0.0002676214,0.00004991802,0.9290113,0.05756256,0.008281951,0.002623901,0.0003000745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8774796,0.0002851177,0.108799,0.0002184707,0.01215982,0.0002627857,9.677004e-7,0.0001564379,0.000637872],"genre_scores_gemma":[0.9890386,0.000001382445,0.01039653,0.00004394442,0.00007867057,0.000004273051,0.000002191342,0.000008297147,0.0004260971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7740769,"threshold_uncertainty_score":0.787503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0192855527729682,"score_gpt":0.2836913155832633,"score_spread":0.2644057628102951,"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."}}