Fetching the paper…
Reading the bibliography…
Decoded Quantum Interferometry (DQI) provides a framework for superpolynomial quantum speedups by reducing certain optimization problems to reversible decoding tasks.
1910
Earlier work this paper cites.
E. Prange, The use of information sets in decoding cyclic codes, IRE Transactions on Information Theory 8
1962
Earlier work this paper cites.
W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58
1963
Earlier work this paper cites.
R. Chien, Cyclic decoding procedures for bose- chaudhuri-hocquenghem codes, IEEE Transactions on Information Theory 10
1964
Earlier work this paper cites.
G. Forney, On decoding bch codes, IEEE Transactions on Information Theory 11
1965
Earlier work this paper cites.
J. Stein, Computational problems associated with racah algebra, Journal of Computational Physics 1
1967
Earlier work this paper cites.
J. G. Earle, Latched carry save adder circuit for multipliers (1967), uS Patent 3,340,388
1967
Earlier work this paper cites.
A. Schönhage and V. Strassen, Schnelle multiplikation großer zahlen, Computing 7
1971
Earlier work this paper cites.
Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, A method for solving key equation for decoding goppa codes, Information and Control 27
1975
Earlier work this paper cites.
T. Itoh and S. Tsujii, Structure of parallel multipliers for a class of fields GF ( 2 m ) (2^{m}) , Information and Computation 83
1989
Earlier work this paper cites.
D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica 28
1991
Earlier work this paper cites.
V. Guruswami and M. Sudan, Improved decoding of reed-solomon and algebraic-geometric codes, in Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280) (IEEE, 1998) pp. 28–37
1998
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Review 41
1999
Earlier work this paper cites.
2001
Earlier work this paper cites.
J. Von Zur Gathen and J. Gerhard, Modern computer algebra (Cambridge university press, 2003)
2003
Earlier work this paper cites.
R. Koetter and A. Vardy, Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory 49
2003
Earlier work this paper cites.
P. Kaye and C. Zalka, Optimized quantum implementation of elliptic curve arithmetic over binary fields (2004), arXiv:quant-ph/0407095 [quant-ph]
2004
Earlier work this paper cites.
J. Proos and C. Zalka, Shor’s discrete logarithm quantum algorithm for elliptic curves (2004), arXiv:quant-ph/0301141 [quant-ph]
2004
Earlier work this paper cites.
D. E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions (Addison-Wesley Professional, 2005)
2005
Earlier work this paper cites.
J. Justesen, On the complexity of decoding reed-solomon codes (corresp.), IEEE Transactions on Information Theory 22
2006
Cited alongside, same era.
2009
Cited alongside, same era.
2012
Cited alongside, same era.
C. Jones, Low-overhead constructions for the fault-tolerant toffoli gate, Physical Review A 87
2013
Cited alongside, same era.
G. L. Mullen and D. Panario, Handbook of finite fields , Vol. 17 (CRC press Boca Raton, 2013)
2013
Cited alongside, same era.
2023
Later among the works it cites.
O. R. L. C. Facility, The EPYC™ CPU and INSTINCT™ MI250X GPUs in frontier, Frontier Training Workshop (2023), https://www.olcf.ornl.gov/wp-content/uploads/Public-AMD-Instinct-MI-250X-Frontier-8.23.23.pdf
2023
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
O. Garcia-Morchon, R. Rietman, I. E. Shparlinski, and L. Tolhuizen, Interpolation and approximation of polynomials in finite fields over a short interval from noisy values, Experimental mathematics 23
2014
Cited alongside, same era.
E. R. Berlekamp, Algebraic coding theory (revised edition) (World Scientific, 2015)
2015
Cited alongside, same era.
S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Physical Review Letters 116
2016
Cited alongside, same era.
2017
Cited alongside, same era.
C. Gidney, Halving the cost of quantum addition, Quantum 2
2018
Cited alongside, same era.
R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear T complexity, Physical Review X 8
2018
Cited alongside, same era.
G. H. Low, V. Kliuchnikov, and L. Schaeffer, Trading t gates for dirty qubits in state preparation and unitary synthesis, Quantum 8
2024
Later among the works it cites.
2024
Later among the works it cites.
C. Gidney, Inplace access to the surface code y basis, Quantum 8
2024
Later among the works it cites.
T. Khattar, N. Shutty, C. Gidney, A. Zalcman, N. Yosri, D. Maslov, R. Babbush, and S. Jordan, Data for "verifiable quantum advantage via optimized dqi circuits" (2025)
2025
Closest in time.
2025
Closest in time.
O. Regev, An efficient quantum factoring algorithm, Journal of the ACM 72
2025
Closest in time.
D. Maslov, N. Yosri, and D. Gavinsky, Asymptotic yet practical optimization of quantum circuits implementing GF( 2 m 2^{m} ) multiplication and division operations, in 7th International Workshop on Quantum Compilation, Helsinki, Finland (2025)
2025
Closest in time.
A. Gu and S. Jordan, Algebraic geometry codes and decoded quantum interferometry (2025), unpublished manuscript
2025
Closest in time.
D. W. Berry, Y. Tong, T. Khattar, A. White, T. I. Kim, G. H. Low, S. Boixo, Z. Ding, L. Lin, S. Lee, et al. , Rapid initial-state preparation for the quantum simulation of strongly correlated molecules, PRX Quantum 6
2025
Closest in time.
T. Khattar and C. Gidney, Rise of conditionally clean ancillae for efficient quantum circuit constructions, Quantum 9
2025
Closest in time.
2025
Closest in time.
G. D. Kahanamoku-Meyer, S. Ragavan, V. Vaikuntanathan, and K. Van Kirk, The Jacobi factoring circuit: Quantum factoring with near-linear gates and sublinear space and depth, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 1496–1507
2025
Closest in time.
C. Gidney, M. Newman, P. Brooks, and C. Jones, Yoked surface codes, Nature Communications 16
2025
Closest in time.
A. Chailloux and J.-P. Tillich, Quantum advantage from soft decoders, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 738–749
2025
Closest in time.