{"id":"W7110396286","doi":"10.4230/lipics.itcs.2025.33","title":"Bosonic Quantum Computational Complexity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Agence Nationale de la Recherche; National Science Foundation","keywords":"Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Upper and lower bounds; Adiabatic quantum computation; Complexity class; Quantum information; Observable; Hilbert space","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.001946104,0.0005918753,0.0007964134,0.0009840759,0.001352773,0.004407204,0.001248079,0.001425378,0.007133192],"category_scores_gemma":[0.007482274,0.0003855643,0.001328835,0.00112832,0.004703519,0.007559541,0.002970961,0.005116723,0.0007732578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003176884,"about_ca_system_score_gemma":0.001421854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233664,"about_ca_topic_score_gemma":0.0007087782,"domain_scores_codex":[0.9975504,0.0005887264,0.0001364275,0.0005662914,0.0009045132,0.0002536471],"domain_scores_gemma":[0.9935237,0.004503177,0.0002267999,0.0009645364,0.0005687646,0.0002130356],"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.000007020904,0.000007018627,0.00008296305,0.00004688526,0.000004757354,0.000008630623,0.00004334367,0.002217873,0.0001642622,0.9915337,0.001106962,0.004776656],"study_design_scores_gemma":[0.000003647223,0.00000467765,0.00007301183,0.000008875537,0.000002305244,0.00001593859,0.0000121702,0.01406287,0.0001532049,0.9814123,0.004246656,0.000004380028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08113412,0.009120923,0.7444679,0.0221605,0.000728859,0.0002124137,0.001276063,0.0004650932,0.1404341],"genre_scores_gemma":[0.8258763,0.005518415,0.1412168,0.002295248,0.002089228,0.0005195041,0.001288755,0.000238854,0.02095685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007133192,"threshold_uncertainty_score":0.0238629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01538389680192718,"score_gpt":0.2703875122554101,"score_spread":0.2550036154534829,"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."}}