adjacent_pair: ap-0407fccd91

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

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
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   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.  

Links from other tables