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.
Most quantum methods for hard optimization problems give only modest speedups. A quantum method called decoded quantum interferometry finds better approximate solutions to a structured problem than any known classical method, and it is open whether a classical method can catch up.
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.