{"id":"W2158764863","doi":"10.1098/rspa.2005.1546","title":"Quantum computing, postselection, and probabilistic polynomial-time","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":319,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Corollary; Postselection; Complexity class; Probabilistic logic; Class (philosophy); Generalization; Axiom; Mathematical proof; Quantum computer; Simple (philosophy); Intersection (aeronautics); Time complexity; Mathematics; Discrete mathematics; Polynomial; Quantum; Computation; Computer science; Algorithm; Quantum mechanics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003077265,0.0001243964,0.0001903377,0.00001823798,0.000272307,0.0001637002,0.0004799211,0.00003106356,0.000001641692],"category_scores_gemma":[0.0001015573,0.00008074072,0.0000995667,0.0003682133,0.0004391152,0.0002259984,0.0003645021,0.0001327032,0.00000202772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001295622,"about_ca_system_score_gemma":0.00001219237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003248778,"about_ca_topic_score_gemma":3.192674e-8,"domain_scores_codex":[0.9990919,0.000002941341,0.0001579047,0.0002598961,0.0002590584,0.0002282708],"domain_scores_gemma":[0.9996027,0.0001496061,0.00006276702,0.00006204074,0.00004910076,0.00007381652],"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.00000237522,0.000290171,0.0001664277,0.0004885157,0.00004074193,5.956091e-8,0.005022636,0.003628354,0.007203337,0.9778962,0.001049293,0.004211878],"study_design_scores_gemma":[0.00006803747,0.00006217595,0.001108877,0.00006754471,0.000008330442,0.000006511405,0.00002884246,0.9513376,0.0006732549,0.04647502,0.00005521933,0.000108585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9868341,0.00006420531,0.01071887,0.001632446,0.00004185958,0.0001329811,7.618925e-7,0.0001184645,0.0004563029],"genre_scores_gemma":[0.9625931,0.000002014579,0.03721175,0.0000376341,0.00009901563,0.000003099525,2.633413e-8,0.000003994079,0.0000493603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9477093,"threshold_uncertainty_score":0.3292511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007382453605906405,"score_gpt":0.2061353419719982,"score_spread":0.1987528883660918,"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."}}