{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00132014,0.0006044946,0.001422783,0.00006736573,0.0002957443,0.0001643656,0.002544821,0.00004448928,0.000017302],"category_scores_gemma":[0.0006372952,0.0003662742,0.0007207284,0.00196958,0.0003451607,0.0003648705,0.001029745,0.00104978,0.0008562881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007788555,"about_ca_system_score_gemma":0.0001620879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004916446,"about_ca_topic_score_gemma":0.000009696762,"domain_scores_codex":[0.9954184,0.0007148829,0.0008306291,0.001163131,0.0008722524,0.001000703],"domain_scores_gemma":[0.996644,0.0007318497,0.0004077183,0.001705594,0.0002274791,0.000283402],"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.00001594327,0.002025537,0.0001818674,0.0102856,0.0001053717,0.00009075149,0.001379101,0.00007153579,0.007068716,0.3573934,0.01524101,0.6061411],"study_design_scores_gemma":[0.0004334196,0.0007849467,0.001482813,0.03468065,0.0001550688,0.000076494,0.000006135608,0.5394068,0.002528191,0.3197842,0.09933593,0.001325328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4151363,0.2579151,0.1929547,0.1061133,0.001608411,0.01036779,0.00002647436,0.001481743,0.01439612],"genre_scores_gemma":[0.9278107,0.0458549,0.007678326,0.01570718,0.002480224,0.0003077118,0.000007442119,0.00008491362,0.00006865112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6048158,"threshold_uncertainty_score":0.9999217,"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."}}