{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000503216,0.0003806043,0.0005699281,0.0002237104,0.0003294963,0.0002756123,0.001444961,0.00009416576,0.00000451546],"category_scores_gemma":[0.0002079612,0.0003308008,0.0003336058,0.0006364783,0.0001207424,0.0008551753,0.000472593,0.0003333647,0.00002168956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003653525,"about_ca_system_score_gemma":0.0001492528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009613625,"about_ca_topic_score_gemma":0.000005390802,"domain_scores_codex":[0.9971831,0.0000380227,0.001208265,0.0004186828,0.0004458909,0.0007059925],"domain_scores_gemma":[0.9977794,0.0001622891,0.0006307922,0.0007440741,0.0004201113,0.0002632756],"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.0006633642,0.002348207,0.002806056,0.01562873,0.001719667,0.00002344952,0.208748,0.06724633,0.00220621,0.3532829,0.06244414,0.282883],"study_design_scores_gemma":[0.00163274,0.0005299706,0.0001808174,0.00007815306,0.00002428877,0.00002381409,0.0002463606,0.9649373,0.002220093,0.007906501,0.02180104,0.0004188896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08176035,0.00005400921,0.9111961,0.002899103,0.0005753734,0.001720334,0.001166044,0.0002689481,0.0003597022],"genre_scores_gemma":[0.6774178,0.00001472035,0.319554,0.001904011,0.0003085109,0.0001771743,0.0004669726,0.00005796812,0.00009885227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.897691,"threshold_uncertainty_score":0.9999144,"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."}}