{"id":"W4415500131","doi":"10.1007/978-3-031-90731-9_10","title":"Quantum Parallelism and Computational Complexity","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computational complexity theory; Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Parallelism (grammar); Superposition principle; Quantum sort; Quantum error correction","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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002135522,0.0004581937,0.0006129523,0.0001126719,0.001639859,0.001310532,0.001737973,0.000347275,0.00008764835],"category_scores_gemma":[0.00003287599,0.0003380813,0.0002266115,0.0001552827,0.001786926,0.0002215444,0.002722625,0.000982488,0.0000460427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000812111,"about_ca_system_score_gemma":0.0004396423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001103574,"about_ca_topic_score_gemma":0.00002402308,"domain_scores_codex":[0.9964176,0.0003238222,0.0005251591,0.0008744532,0.00116222,0.0006967093],"domain_scores_gemma":[0.9974743,0.0008119512,0.0001888527,0.0008935984,0.0004849085,0.0001463675],"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.00002192019,0.00001743569,7.548496e-7,0.0002659918,0.0001667496,0.00001638624,0.001686149,0.000214125,0.0001935658,0.9498327,0.04335094,0.004233295],"study_design_scores_gemma":[0.0002535434,0.0001465698,0.00009541513,0.0002628716,0.00001217466,0.00005756728,0.00006686831,0.04661844,0.00007179278,0.7526427,0.1993425,0.0004295348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02871552,0.02656662,0.4176389,0.2205096,0.01891975,0.01591759,0.005240692,0.006558751,0.2599326],"genre_scores_gemma":[0.06341702,0.005015922,0.192203,0.004340461,0.004285579,0.0002562197,0.0007613843,0.0003118406,0.7294086],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.469476,"threshold_uncertainty_score":0.9999071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05550053442615115,"score_gpt":0.315315444999755,"score_spread":0.2598149105736038,"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."}}