Instantiate the membership oracle under computational assumptions
Construct an explicit, non-oracular instantiation of the balanced folded OPI membership oracles that yields a quantum advantage comparable to the oracle-based result, conditionally on computational complexity assumptions.
References
A clear open direction is thus to instantiate the oracle: to provide a similar result to ours conditionally on computational complexity assumptions.
— A provable quantum advantage for approximate optimization via decoded quantum interferometry
(2610.02145 - Kramer et al., 1 Oct 2026) in Section 6, Discussion
What is the classical hardness of OPI? We show a separation between classical and quantum relative to membership oracles when the field is very large. Can one show a similar separation (perhaps under some standard cryptographic assumptions) for polynomial field sizes?
— Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
(2610.12357 - Sun et al., 8 Oct 2026) in Section ‘Open Problems’