{"id":"W2794488470","doi":"10.1103/physreva.97.032344","title":"Quantum speedup in solving the maximal-clique problem","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Clique; Clique graph; Clique problem; Combinatorics; Quantum walk; Quantum computer; Speedup; Quantum algorithm; Mathematics; Quantum; Graph; Discrete mathematics; Algorithm; Computer science; Quantum mechanics; Physics; Graph power; Line graph; Pathwidth","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.001211629,0.0004667081,0.0006514697,0.0003349855,0.0008153524,0.0009271173,0.001296078,0.001092187,0.005912106],"category_scores_gemma":[0.00434122,0.000273801,0.0005917199,0.0006566119,0.001155072,0.002622583,0.001073246,0.001535571,0.0005239128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271326,"about_ca_system_score_gemma":0.002266899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00275091,"about_ca_topic_score_gemma":0.005097194,"domain_scores_codex":[0.9992077,0.0002183548,0.00002571562,0.0001712673,0.0002560412,0.0001208665],"domain_scores_gemma":[0.9979495,0.001311198,0.00007659267,0.0003849641,0.000180516,0.00009726532],"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.000542544,0.00050656,0.001249967,0.0004552664,0.0000826186,0.0001822416,0.0002050334,0.3637317,0.02018271,0.478786,0.01453615,0.1195393],"study_design_scores_gemma":[0.0001191139,0.0000838635,0.0003698626,0.00001491037,0.00001846623,0.00006622657,0.00004271275,0.8654816,0.004707038,0.1250975,0.003983997,0.00001474155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1724943,0.001149881,0.767872,0.003948002,0.000401551,0.000295946,0.0002539705,0.001804339,0.05178009],"genre_scores_gemma":[0.6030692,0.0004887949,0.3898914,0.0004607778,0.0001303035,0.0001793919,0.0002316599,0.000174156,0.005374373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005912106,"threshold_uncertainty_score":0.01977795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01549204870495696,"score_gpt":0.3347248867868579,"score_spread":0.3192328380819009,"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."}}