Fetching the paper…
Reading the bibliography…
Decoded Quantum Interferometry (DQI) is a framework for approximating special kinds of discrete optimization problems that relies on problem structure in a way that sets it apart from other classical or quantum approaches.
“Matching, Euler tours and the Chinese postman”
Jack Edmonds and Ellis. Johnson · 1973
Earlier work this paper cites.
“Finding a minimum circuit in a graph”
Alon Itai and Michael Rodeh · 1978
Earlier work this paper cites.
“On the complexity of Integer Programming”
Christos. Papadimitriou · 1981
Earlier work this paper cites.
“Improved approximation algorithms for MaxCut and satisfiability problems using semidefinite programming”
Michel. Goemans and David. Williamson · 1995
Earlier work this paper cites.
“Combinatorial optimization: polyhedra and efficiency” 24
Alexander Schrijver · 2003
Earlier work this paper cites.
“Faster algorithms for MaxCut and MaxCSP, with polynomial expected time for sparse instances”
Alexander. Scott and Gregory. Sorkin · 2003
Earlier work this paper cites.
“Optimal inapproximability results for MaxCut and other 2 2 -variable CSPs?”
Subhash Khot, Guy Kindler, Elchanan Mossel and Ryan O’Donnell · 2007
Earlier work this paper cites.
“A quantum approximate optimization algorithm”
Edward Farhi, Jeffrey Goldstone and Sam Gutmann · 2014
Earlier work this paper cites.
“On the power of quantum Fourier sampling”
Bill Fefferman and Christopher Umans · 2016
Cited alongside, same era.
“Analysis of Boolean functions”
Ryan O’Donnell · 2021
Cited alongside, same era.
“An explicit vector algorithm for high-girth MaxCut”
Jessica. Thompson, Ojas Parekh and Kunal Marwaha · 2022
Cited alongside, same era.
“Local algorithms for MaxCut and minimum bisection on locally treelike regular graphs of large degree”
Ahmed El, Andrea Montanari and Mark Sellke · 2023
Cited alongside, same era.
“Optimization by decoded quantum interferometry”
Stephen. Jordan, Noah Shutty, Mary Wootters, Adam Zalcman, Alexander Schmidhuber, Robbie King, Sergei. Isakov, Tanuj Khattar and Ryan Babbush · 2024
Cited alongside, same era.
“Quantum advantage from soft decoders” Extended version available as arXiv:2411.12553
André Chailloux and Jean-Pierre Tillich · 2025
Closest in time.
“Graph theory” 173
Reinhard Diestel · 2025
Closest in time.
“Lower bounding the MaxCut of high girth 3 3 -regular graphs using the QAOA”
Edward Farhi, Sam Gutmann, Daniel Ranard and Benjamin Villalonga · 2025
Closest in time.
“How to design a quantum streaming algorithm without knowing anything about quantum computing”
John Kallaugher, Ojas Parekh and Nadezhda Voronova · 2025
Closest in time.
“On the complexity of decoded quantum interferometry”
Kunal Marwaha, Bill Fefferman, Alexandru Gheorghiu and Vojtech Havlicek · 2025
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Exponential quantum space advantage for approximating maximum directed cut in the streaming model”
John Kallaugher, Ojas Parekh and Nadezhda Voronova · 2024
Cited alongside, same era.
“Decoded quantum interferometry requires structure”
Eric. Anschuetz, David Gamarnik and Jonathan. Lu · 2025
Cited alongside, same era.
“NIST digital library of mathematical functions” Release 1.2.3 of 2025-09-15, F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds., 2025
NIST Digital Library of Mathematical Functions · 2025
Closest in time.
“Quantum circuit design for decoded quantum interferometry”
Natchapol Patamawisut, Naphan Benchasattabuse, Michal Hajdušek and Rodney Van · 2025
Closest in time.