{"id":"W3042833497","doi":"10.1016/j.laa.2020.07.018","title":"Complex Hadamard diagonalisable graphs","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brandon University; University of Victoria; University of Manitoba; University of Regina; York University","funders":"University Research Committee, Emory University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation; Brandon University","keywords":"Hadamard transform; Mathematics; Complex Hadamard matrix; Hadamard three-lines theorem; Hadamard's inequality; Laplacian matrix; Hadamard matrix; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors; Hadamard three-circle theorem; Vertex (graph theory); Indifference graph; Chordal graph; Graph; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":true,"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.00005669782,0.0001150015,0.0001291591,0.00003212541,0.0002523272,0.00009693592,0.0004611271,0.00003619723,0.00002020541],"category_scores_gemma":[0.00001252646,0.00010239,0.00004600836,0.000445175,0.00003447273,0.0001035104,0.0002301645,0.0001365427,0.00009601263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003008871,"about_ca_system_score_gemma":0.00002239333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000435342,"about_ca_topic_score_gemma":6.154871e-7,"domain_scores_codex":[0.9991374,0.00002168693,0.0001550089,0.0003672905,0.0001311821,0.0001874321],"domain_scores_gemma":[0.9993938,0.00007651943,0.00004716688,0.00023839,0.00004822009,0.0001958804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003044531,0.00007816612,0.0001731363,0.00005130881,0.00003225582,0.000003456709,0.0009396324,0.0005536884,0.002889168,0.876257,0.005041665,0.1139775],"study_design_scores_gemma":[0.0001513192,0.00004130067,0.0007663872,0.000003832818,0.000005257986,0.000008458167,0.000009137543,0.8132989,0.0004301275,0.0117638,0.1733685,0.0001528821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02684416,0.0006982,0.9427162,0.02730434,0.00005354848,0.000428305,0.00002605032,0.0004998159,0.001429315],"genre_scores_gemma":[0.8855269,0.0000884572,0.1071513,0.006618775,0.0003846377,0.00007555313,0.00002994264,0.00001832948,0.0001061302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8644932,"threshold_uncertainty_score":0.4175342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02440982208039354,"score_gpt":0.2483199456875361,"score_spread":0.2239101236071426,"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."}}