{"id":"W1964699768","doi":"10.1007/s00453-015-9985-x","title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Collision; Computer science; Matrix multiplication; Graph; Logical matrix; Quantum; Multiplication (music); Theoretical computer science; Mathematics; Combinatorics; Physics; Quantum mechanics; Programming language","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.000603721,0.0002238182,0.0003222124,0.000228377,0.0001814321,0.0001015821,0.0009130383,0.0001017112,0.000001197536],"category_scores_gemma":[0.0000963971,0.0002073654,0.0001267398,0.0007043065,0.000177668,0.0003000301,0.0004936351,0.0002338831,0.000009420565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007368008,"about_ca_system_score_gemma":0.0001817224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008288336,"about_ca_topic_score_gemma":0.000007493631,"domain_scores_codex":[0.9979959,0.0001354361,0.0004742847,0.0005319243,0.0004776557,0.0003847719],"domain_scores_gemma":[0.9982582,0.0001053634,0.0003547494,0.0007778503,0.0002876122,0.0002162245],"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.0001412848,0.001344183,0.001443794,0.0003622089,0.0002110838,0.0001054981,0.008180154,0.1232335,0.08485395,0.207331,0.001634943,0.5711583],"study_design_scores_gemma":[0.0004963179,0.0001283242,0.0004419012,0.00003787014,0.00001031807,0.00005053579,0.00007095827,0.9754964,0.008354334,0.01444771,0.0002222426,0.0002431697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.293799,0.0001452885,0.7048965,0.0003391919,0.0004121605,0.000184112,0.00001010541,0.0001817115,0.00003193766],"genre_scores_gemma":[0.6080986,0.00000166867,0.3917004,0.00004410719,0.0001202538,0.000003022583,0.000006338643,0.00001535654,0.00001023965],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8522628,"threshold_uncertainty_score":0.8456114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04442195042262893,"score_gpt":0.287607876807903,"score_spread":0.2431859263852741,"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."}}