{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-0092dbe40f", "problem", "se-mo-35151", "What impact would P!=NP have on the characterization of BQP? Many complexity theorists assume that $P\\ne NP.$ If this is proved, how would it impact quantum computing and quantum algorithms? Would the proof immediately disallow quantum algorithms from ever solving NP-Complete problems in Quantum Pol", "problem", "wp-physics-36641b7683", "Complexity classes problems: What is the relation between BQP and BPP ? What is the relation between BQP and NP ? Can computation in plausible physical theories (quantum algorithms) go beyond BQP? [ 108 ]", "quantum algorithms", "adjacent-field", "novel", "0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) \u00b7 withdrawn by ts-synth: the same question on two sources", "withdrawn", "ts-synth", "2026-09-02T18:02:06Z", null, null, null, null, null]], "columns": ["id", "a_kind", "a_ref", "a_label", "b_kind", "b_ref", "b_label", "bridge", "distance", "novelty", "evidence", "status", "asked_by", "created_ts", "signal", "score", "why", "prompt", "reading"], "primary_keys": ["id"], "primary_key_values": ["ap-0092dbe40f"], "units": {}, "query_ms": 0.6856187246739864, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}