{"id":"W4320473697","doi":"10.48550/arxiv.2112.02600","title":"A Quantum Computer Amenable Sparse Matrix Equation Solver","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quantum computer; Solver; Matrix (chemical analysis); Unitary matrix; Computer science; Sparse matrix; Quantum algorithm; Quantum; Generalization; Unitary state; Quantum phase estimation algorithm; Inverse; Applied mathematics; Mathematics; Algorithm; Mathematical optimization; Quantum simulator; Quantum mechanics; Mathematical analysis; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537348,0.000232609,0.0005019507,0.0002092581,0.0004117315,0.0007322678,0.0006691926,0.0012175,0.009866607],"category_scores_gemma":[0.0008899125,0.0002149527,0.0003730057,0.0003658805,0.0004846329,0.000652949,0.001051589,0.001125331,0.001284419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003924103,"about_ca_system_score_gemma":0.00119884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002226961,"about_ca_topic_score_gemma":0.003798858,"domain_scores_codex":[0.9998333,0.00003838032,0.000006094335,0.00002245624,0.00007451964,0.00002523696],"domain_scores_gemma":[0.999767,0.0001109206,0.00001548408,0.00003015148,0.0000556411,0.00002074369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001097748,0.0001109204,0.0009121102,0.0002067017,0.00004452659,0.0005012181,0.0001786408,0.4933061,0.01488189,0.4212004,0.01475157,0.05379622],"study_design_scores_gemma":[0.00002819556,0.00001825141,0.0000684066,0.000008188934,0.000003586923,0.00004183861,0.0000181308,0.9733403,0.001097347,0.0179664,0.007404213,0.000005208625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02476309,0.000270759,0.9268671,0.001582996,0.0001928912,0.0001405072,0.0004294692,0.0008294871,0.04492366],"genre_scores_gemma":[0.2511034,0.0003197782,0.72258,0.0004639267,0.0001171503,0.0003820395,0.0004541998,0.0001961974,0.02438336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009866607,"threshold_uncertainty_score":0.03300703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05648247164602924,"score_gpt":0.1956171321372463,"score_spread":0.1391346604912171,"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."}}