{"id":"W3014455327","doi":"10.4230/lipics.tqc.2020.7","title":"Beyond Product State Approximations for a Quantum Analogue of Max Cut","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Maximum cut; Semidefinite programming; Hamiltonian (control theory); Qubit; Mathematics; Bounded function; Eigenvalues and eigenvectors; Relaxation (psychology); Quantum; Upper and lower bounds; Quantum computer; Graph; Product (mathematics); Discrete mathematics; Combinatorics; Quantum mechanics; Mathematical optimization; Mathematical analysis; Physics","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.002157303,0.0008649555,0.0009270391,0.0005833869,0.0006479955,0.001991341,0.001770794,0.001450147,0.005712303],"category_scores_gemma":[0.009797412,0.0004810736,0.001043139,0.001104033,0.002421823,0.004754396,0.001787288,0.003833576,0.0005418935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001749038,"about_ca_system_score_gemma":0.0009714048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001359687,"about_ca_topic_score_gemma":0.001542298,"domain_scores_codex":[0.9986328,0.0005712332,0.00004634755,0.0002528145,0.0003483892,0.0001482822],"domain_scores_gemma":[0.9947589,0.003690548,0.0002320028,0.0009222534,0.0002656416,0.0001306567],"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.0003531832,0.0001463159,0.0005848364,0.0001611221,0.00005618088,0.00008430468,0.0001789241,0.4519745,0.00303314,0.5091568,0.002562768,0.03170794],"study_design_scores_gemma":[0.00001546938,0.00003155013,0.00005559789,0.00001071565,0.000006872015,0.00002220348,0.00001828878,0.7196213,0.00117543,0.2782262,0.0008100902,0.000006363229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09103633,0.0004333435,0.8919733,0.001246264,0.00008577677,0.00007272197,0.0001796927,0.0006709586,0.01430169],"genre_scores_gemma":[0.7359473,0.0003215302,0.2569264,0.0003788617,0.00007752822,0.00016219,0.0004058496,0.0003767638,0.005403392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005712303,"threshold_uncertainty_score":0.01910955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01661698165759976,"score_gpt":0.2428065866925685,"score_spread":0.2261896050349687,"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."}}