{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-0407fccd91", "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-869eaab140", "United States DARPA issued 23 mathematical challenges in 2008. Physics problems included: advancing techniques in modelling fluid dynamics and soft matter , developing mathematics for quantum computing , applying quantum field theory and action principles to biology, and finding a relation between t", "quantum computing", "adjacent-field", "novel", "0 ingested titles mention both sides (text proxy for #177)", "unasked", null, "2026-09-02T20:10:35Z", "bridge", 6.446, "keyphrase 'quantum computing' appears in 3 problems across fields (mathematics / physics) and in 0 ingested paper titles; idf=6.45", "Both sides turn on 'quantum computing'. What does mathematics already know about quantum computing that physics is still asking, and vice versa? Start from the grounding papers; if neither field's result transfers, say which assumption breaks.", ""]], "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-0407fccd91"], "units": {}, "query_ms": 4.678795114159584, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}