{"id":"W4399856244","doi":"10.1103/physrevresearch.6.023294","title":"Low-depth Clifford circuits approximately solve MaxCut","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Office of Science; Canada First Research Excellence Fund; U.S. Department of Energy","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Clifford algebra; Graph; Discrete mathematics; Algebra over a field; Pure mathematics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001817973,0.0002262783,0.000416593,0.0001183524,0.0002455249,0.0005753125,0.001713207,0.00003966642,0.00001934097],"category_scores_gemma":[0.0002458067,0.000162871,0.0002568595,0.002013413,0.0001577585,0.0002647329,0.000970842,0.001183872,0.001509785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006387532,"about_ca_system_score_gemma":0.0001864309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001635879,"about_ca_topic_score_gemma":0.000001486768,"domain_scores_codex":[0.9963043,0.0003129906,0.0002943186,0.0008853882,0.001301384,0.0009016063],"domain_scores_gemma":[0.9978444,0.0007527733,0.00003095254,0.0009119133,0.0001880602,0.0002718753],"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":[7.6103e-7,0.0001361961,0.000002059867,0.002977368,0.00002228049,0.0001138916,0.0002175216,0.00001895781,0.0006645178,0.0957385,0.006756192,0.8933517],"study_design_scores_gemma":[0.000126443,0.0002994739,0.0001337696,0.008203884,0.00001477996,0.0000758388,0.000005636126,0.7733381,0.002175081,0.08941662,0.125752,0.0004584343],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.06472259,0.4109283,0.4085137,0.04143086,0.002816353,0.005089541,0.00003751613,0.004276202,0.06218488],"genre_scores_gemma":[0.9724714,0.01670695,0.006542546,0.001248846,0.002056065,0.0002332615,0.00001306966,0.00009169785,0.0006361774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9077488,"threshold_uncertainty_score":0.9992676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07557673831340554,"score_gpt":0.4096493076952153,"score_spread":0.3340725693818098,"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."}}