Can classical algorithms match decoded quantum interferometry on polynomial intersection?
66No. 192 in all physics · No. 18 in Quantum Information and Foundations
This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.
Optimal Polynomial Intersection (OPI): given a prime $p$, points $x_{1}..x_{m}$ in $F_{p}$ and subsets $S_{i}$ of $F_{p}$, find a polynomial $Q$ over $F_{p}$ of $\mathrm{degree}<n$ maximizing the number of $i$ with $Q(x_{i})$ in $S_{i}$. For the parameter families of Jordan et al. (Nature 646, 831, 2025, arXiv:2408.08292), decoded quantum interferometry reaches a satisfied fraction (given by a semicircle-law formula) above that of every known polynomial-time classical algorithm. Answer: a classical polynomial-time algorithm achieving the same fraction, or a hardness proof under a standard complexity assumption.
What would settle it
A classical algorithm matching the DQI fraction on the stated OPI families, or a reduction showing that doing so would break a standard assumption.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
2025-2026 work gave faster DQI implementations and inapproximability results for related max-LINSAT problems; no classical match for OPI has been reported.
No solutions, ideas or subproblems yet.
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Posed
- 2024
- Topic review
- A. M. Dalzell et al., Quantum algorithms: A survey of applications and end-to-end complexities, arXiv, 2023. Link
- Record
- Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
- Batch approval
- Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
- Earlier revisions
- revision 1 bundle
Proof
- Fingerprint
- 0cf7dc74b6f5…
- Public log
- Entry 2,061, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.