{"id":"W4417128656","doi":"10.4230/lipics.tqc.2025.6","title":"Quantum SAT Problems with Finite Sets of Projectors Are Complete for a Plethora of Classes","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja; Government of Canada","keywords":"Constraint satisfaction problem; Hamiltonian (control theory); Quantum entanglement; Mathematical proof; Satisfiability; Qubit; Quantum; Boolean satisfiability problem; Set (abstract data type)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003599647,0.00134337,0.001784749,0.001311158,0.002579591,0.006056942,0.003162277,0.002200044,0.009468189],"category_scores_gemma":[0.01122942,0.001009981,0.003928733,0.001978953,0.00433225,0.0135858,0.003993166,0.008895567,0.001019927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003923614,"about_ca_system_score_gemma":0.00328569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003070485,"about_ca_topic_score_gemma":0.003578903,"domain_scores_codex":[0.993644,0.001589813,0.0004884218,0.001828253,0.001530192,0.0009193757],"domain_scores_gemma":[0.9788208,0.01627634,0.0009116422,0.002237744,0.001034244,0.0007191293],"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.0003083499,0.0003540476,0.0013024,0.0007391603,0.0001607446,0.0001373981,0.0006486234,0.03705869,0.001565416,0.9050111,0.01473638,0.03797762],"study_design_scores_gemma":[0.00009468008,0.00004014608,0.0005296704,0.00005818348,0.00003259847,0.00008214033,0.0001849819,0.04547407,0.001253851,0.946254,0.005969121,0.00002650512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.321331,0.002409204,0.5585992,0.02144452,0.0003274657,0.0005843556,0.01132159,0.001916857,0.08206573],"genre_scores_gemma":[0.7927235,0.002026317,0.1686939,0.002392029,0.001109836,0.0009933343,0.01469057,0.0006648414,0.01670574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009468189,"threshold_uncertainty_score":0.03167427,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04009980170754116,"score_gpt":0.2752251301860881,"score_spread":0.2351253284785469,"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."}}