{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657056,0.0009704331,0.002336547,0.001174456,0.001683839,0.003303391,0.003493376,0.002007088,0.01079894],"category_scores_gemma":[0.01569351,0.0006647757,0.001198316,0.002314224,0.002475717,0.008939289,0.004634812,0.003114205,0.001410527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002641948,"about_ca_system_score_gemma":0.004955015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004209125,"about_ca_topic_score_gemma":0.005551559,"domain_scores_codex":[0.9947407,0.001223891,0.0001913317,0.000795663,0.002022423,0.001026119],"domain_scores_gemma":[0.9858196,0.009476497,0.0005063452,0.002630186,0.001078633,0.0004887517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003135359,0.0009797787,0.003233362,0.0005591591,0.0002332642,0.0003430715,0.0005106039,0.2649772,0.02665454,0.4907266,0.02670255,0.1819444],"study_design_scores_gemma":[0.0001880547,0.0001449066,0.0003122438,0.00001574334,0.00005278086,0.0000951792,0.0000787991,0.7779126,0.006255754,0.2130179,0.001888145,0.0000379772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2592923,0.001514477,0.7036296,0.00483811,0.0005988872,0.0003203817,0.0004254401,0.003846988,0.02553378],"genre_scores_gemma":[0.8773671,0.0003704885,0.1151243,0.0005687401,0.0002901792,0.0001451395,0.0002699343,0.0003448815,0.005519181],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01079894,"threshold_uncertainty_score":0.03612602,"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."}}