A comment on "Factoring integers with sublinear resources on a superconducting quantum processor"

Reading the bibliography…

Fetching the paper…

Built on

R. L. Rivest, A. Shamir, and L. Adleman, Commun. ACM 21
1978
Earlier work this paper cites.
L. Babai, Combinatorica 6
1986
Earlier work this paper cites.
C. P. Schnorr, in Advances in Cryptology — EUROCRYPT ’91 , edited by D. W. Davies (Springer Berlin Heidelberg, Berlin, Heidelberg, 1991) pp. 281–293
1991
Earlier work this paper cites.
P. Shor, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
I. Dinur, G. Kindler, R. Raz, and S. Safra, Combinatorica 23
2003
Earlier work this paper cites.
A. I. Vera, A note on integer factorization using lattices (2010), arXiv:1003.5461 [cs.DS]
Original
2010
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph]
Original
2014
Earlier work this paper cites.

C. Gidney and M. Ekerå, Quantum 5
2021
Cited alongside, same era.
C. P. Schnorr, Fast factoring integers by svp algorithms, corrected , Cryptology ePrint Archive, Paper 2021/933 (2021), https://eprint.iacr.org/2021/933
2021
Cited alongside, same era.
D. S, Does schnorr’s 2021 factoring method show that the rsa cryptosystem is not secure? , Cryptography Stack Exchange (2021), [Online:] https://crypto.stackexchange.com/a/88601
2021
Cited alongside, same era.
K. Ryan, Did https://eprint.iacr.org/2021/232 actually break rsa? probably not, and here’s why. , Twitter (2021), [Online:] https://twitter.com/inf_0_/status/1367376526300172288
2021
Cited alongside, same era.
L. Ducas, Testing schnorr’s factoring claim in sagemath, https://github.com/lducas/SchnorrGate (2021)
2021
Cited alongside, same era.

T. Khattar and N. Yosri, https://github.com/google-research/google-research/tree/master/factoring_sqif (2023)
Original
2022
Later among the works it cites.
D. Castelvecchi, Nature 613
2023
Closest in time.
B. Schneier, Breaking RSA with a quantum computer , Schneier on Security (2023)
2023
Closest in time.
S. V. Grebnev, M. A. Gavreev, E. O. Kiktenko, A. P. Guglya, K. V. Kuchkin, A. R. Efimov, and A. K. Fedorov, Pitfalls of the sublinear qaoa-based factorization algorithm (2023), arXiv:2303.04656 [quant-ph]
Original
2023
Closest in time.
S. Aaronson, Cargo cult quantum factoring , Shtetl-Optimized (2023), [Online:] https://scottaaronson.blog/?p=6957
2023
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…

A comment on "Factoring integers with sublinear resources on a superconducting quantum processor" · Around

R. L. Rivest, A. Shamir, and L. Adleman, Commun. ACM 21
1978
Earlier work this paper cites.
L. Babai, Combinatorica 6
1986
Earlier work this paper cites.
C. P. Schnorr, in Advances in Cryptology — EUROCRYPT ’91 , edited by D. W. Davies (Springer Berlin Heidelberg, Berlin, Heidelberg, 1991) pp. 281–293
1991
Earlier work this paper cites.
P. Shor, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
I. Dinur, G. Kindler, R. Raz, and S. Safra, Combinatorica 23
2003
Earlier work this paper cites.
A. I. Vera, A note on integer factorization using lattices (2010), arXiv:1003.5461 [cs.DS]
Original
2010
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph]
Original
2014
Earlier work this paper cites.

C. Gidney and M. Ekerå, Quantum 5
2021
Cited alongside, same era.
C. P. Schnorr, Fast factoring integers by svp algorithms, corrected , Cryptology ePrint Archive, Paper 2021/933 (2021), https://eprint.iacr.org/2021/933
2021
Cited alongside, same era.
D. S, Does schnorr’s 2021 factoring method show that the rsa cryptosystem is not secure? , Cryptography Stack Exchange (2021), [Online:] https://crypto.stackexchange.com/a/88601
2021
Cited alongside, same era.
K. Ryan, Did https://eprint.iacr.org/2021/232 actually break rsa? probably not, and here’s why. , Twitter (2021), [Online:] https://twitter.com/inf_0_/status/1367376526300172288
2021
Cited alongside, same era.
L. Ducas, Testing schnorr’s factoring claim in sagemath, https://github.com/lducas/SchnorrGate (2021)
2021
Cited alongside, same era.

T. Khattar and N. Yosri, https://github.com/google-research/google-research/tree/master/factoring_sqif (2023)
Original
2022
Later among the works it cites.
D. Castelvecchi, Nature 613
2023
Closest in time.
B. Schneier, Breaking RSA with a quantum computer , Schneier on Security (2023)
2023
Closest in time.
S. V. Grebnev, M. A. Gavreev, E. O. Kiktenko, A. P. Guglya, K. V. Kuchkin, A. R. Efimov, and A. K. Fedorov, Pitfalls of the sublinear qaoa-based factorization algorithm (2023), arXiv:2303.04656 [quant-ph]
Original
2023
Closest in time.
S. Aaronson, Cargo cult quantum factoring , Shtetl-Optimized (2023), [Online:] https://scottaaronson.blog/?p=6957
2023
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…