{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906188,0.0007444826,0.0007648873,0.001011368,0.001761334,0.002868731,0.002009423,0.001530093,0.005695296],"category_scores_gemma":[0.01200813,0.0003534834,0.001368891,0.001879148,0.005389874,0.01009633,0.003731887,0.004661893,0.000498904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002539469,"about_ca_system_score_gemma":0.001190973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117577,"about_ca_topic_score_gemma":0.000888755,"domain_scores_codex":[0.9982013,0.0004974521,0.00005939524,0.0003671569,0.0004266746,0.0004480039],"domain_scores_gemma":[0.9867216,0.01021601,0.001100733,0.001160746,0.0004025249,0.0003983475],"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.00004008269,0.00003786313,0.0004752057,0.00005569061,0.00001479916,0.00003549274,0.0001200386,0.007117519,0.0005550765,0.9841052,0.001238298,0.006204584],"study_design_scores_gemma":[0.000008221798,0.00002262577,0.0002629038,0.00001004767,0.00001099407,0.00004686608,0.00006193329,0.05415192,0.0009760326,0.9428359,0.001603897,0.00000868467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3053418,0.001845946,0.612833,0.01388988,0.0002470788,0.0001487128,0.0003335279,0.0003616353,0.06499846],"genre_scores_gemma":[0.9608769,0.0008068103,0.03290701,0.0004406913,0.0002484304,0.0001126591,0.0001535579,0.00006652384,0.004387422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005695296,"threshold_uncertainty_score":0.01905262,"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."}}