{"id":"W4400026835","doi":"10.1016/j.physleta.2024.129668","title":"Quantum resources in Harrow-Hassidim-Lloyd algorithm","year":2024,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum entanglement; Multipartite; Multipartite entanglement; Bipartite graph; Algorithm; Coherence (philosophical gambling strategy); Computer science; Quantum algorithm; Quantum; Mathematics; Squashed entanglement; Statistical physics; Theoretical computer science; Quantum mechanics; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002377875,0.0002221377,0.0002099404,0.0001524177,0.0001023078,0.0005223906,0.0007839813,0.00004169358,0.000003316702],"category_scores_gemma":[0.000007848723,0.0001967044,0.0001273044,0.0008784914,0.00006194437,0.0003196266,0.0002789586,0.0004559061,0.00009925578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004791368,"about_ca_system_score_gemma":0.00003812127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008910146,"about_ca_topic_score_gemma":0.000002282475,"domain_scores_codex":[0.9982839,0.0000805474,0.0002276801,0.0006149832,0.0003321466,0.0004607518],"domain_scores_gemma":[0.9992343,0.0001545057,0.00004058383,0.0004745077,0.00001557228,0.0000805434],"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.000002852574,0.0001165193,0.0001132554,0.00009267082,0.00005218534,0.0008058083,0.006870131,0.008683216,0.01337851,0.03914072,0.01019065,0.9205535],"study_design_scores_gemma":[0.0001414026,0.00003180533,0.0003559987,0.00014701,0.000003892103,0.00002373665,0.00001041381,0.9706864,0.0008609517,0.01230377,0.0151521,0.0002825035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.171871,0.0005501945,0.8133897,0.01224692,0.00109185,0.0001114011,0.000005439557,0.0005430087,0.0001904199],"genre_scores_gemma":[0.9070514,0.00001425417,0.08674379,0.004349763,0.001662992,0.00002709633,0.000006091109,0.00005682839,0.00008774346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9620032,"threshold_uncertainty_score":0.8021373,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009143057348884112,"score_gpt":0.2275665349988513,"score_spread":0.2184234776499672,"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."}}