{"id":"W3081124664","doi":"10.1007/s11128-020-02758-7","title":"Quantum walk inspired algorithm for graph similarity and isomorphism","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Quantum walk; Quantum computer; Computer science; Quantum algorithm; Isomorphism (crystallography); Quantum; Graph; Algorithm; Theoretical computer science; Line graph; Physics; Quantum mechanics; Crystallography; Crystal structure","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.000387575,0.0002967595,0.0009568476,0.001219152,0.0009407708,0.0008761766,0.001621389,0.001393562,0.005003353],"category_scores_gemma":[0.001886468,0.0002090538,0.0007348722,0.001518825,0.0007665199,0.001942886,0.001685861,0.001179454,0.0006621324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008734634,"about_ca_system_score_gemma":0.001530427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00251938,"about_ca_topic_score_gemma":0.003125443,"domain_scores_codex":[0.9995347,0.0001028272,0.00002283013,0.0001209559,0.0001678256,0.00005080838],"domain_scores_gemma":[0.9995075,0.0001654832,0.00003030823,0.0001139355,0.000129736,0.00005297354],"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.0002775666,0.0003108665,0.001166155,0.0002424276,0.0001275886,0.0001586862,0.0002871463,0.1127675,0.01555614,0.4239759,0.01058058,0.4345494],"study_design_scores_gemma":[0.00006551787,0.00008556485,0.00034833,0.00001163878,0.00002645521,0.0001386006,0.00005838026,0.8408797,0.00354257,0.1509749,0.00384248,0.0000258305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03697772,0.0003461416,0.9553282,0.000461809,0.0001874592,0.0001247195,0.0001293279,0.0006770308,0.005767465],"genre_scores_gemma":[0.3915724,0.0002202072,0.5990174,0.0002345756,0.00007239557,0.0002389031,0.0003760756,0.0001285186,0.008139537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005003353,"threshold_uncertainty_score":0.01673794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01682708285040525,"score_gpt":0.2355561352207956,"score_spread":0.2187290523703904,"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."}}