Fetching the paper…
Reading the bibliography…
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases.
A.Yu. Kitaev, Quantum measurements and the abelian stabilizer problem , quant-ph/9511026 (1995)
1995
Earlier work this paper cites.
Bernd Sturmfels, Gröbner bases and convex polytopes , University Lecture Series, vol. 8, American Mathematical Society, Providence, RI, 1996. MR 1363949
1996
Earlier work this paper cites.
Peter W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer , SIAM J. Comput. 26
1997
Earlier work this paper cites.
David A. Cox, John B. Little, and Donal O’Shea, Using algebraic geometry , Graduate texts in mathematics, Springer, New York, 1998
1998
Earlier work this paper cites.
Pablo A. Parrilo and Bernd Sturmfels, Minimizing polynomial functions , DIMACS Series in Discrete Mathematics and Theoretical Computer Science (2001)
2001
Earlier work this paper cites.
C.J.C. Burges, Factoring as optimization , Tech. Report MSR-TR-2002-83, Microsoft Research, January 2002
2002
Earlier work this paper cites.
Vicky Choi, Minor-embedding in adiabatic quantum computation: I. the parameter setting problem , Quantum Information Processing 7
2008
Earlier work this paper cites.
Gernot Schaller and Ralf Schutzhold, The role of symmetries in adiabatic quantum algorithms , Quantum Information & Computation 10
2010
Cited alongside, same era.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose, Quantum annealing with manufactured spins , Nature 473
2011
Cited alongside, same era.
2012
Cited alongside, same era.
Sergio Boixo, Tameem Albash, Federico M. Spedalieri, Nicholas Chancellor, and Daniel A. Lidar, Experimental signature of programmable quantum annealing , Nat Commun 4
2013
Sergio Boixo, Troels F. Ronnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer, Evidence for quantum annealing with more than one hundred qubits , Nat Phys 10
2014
Later among the works it cites.
2014
Later among the works it cites.
T. Lanting, A. J. Przybysz, A. Yu. Smirnov, F. M. Spedalieri, M. H. Amin, A. J. Berkley, R. Harris, F. Altomare, S. Boixo, P. Bunyk, N. Dickson, C. Enderud, J. P. Hilton, E. Hoskinson, M. W. Johnson, E. Ladizinsky, N. Ladizinsky, R. Neufeld, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, S. Uchaikin, A. B. Wilson, and G. Rose, Entanglement in a quantum annealing processor , Phys. Rev. X 4
2014
Later among the works it cites.
Cristian S. Calude, Elena Calude, and Michael J. Dinneen, Guest column: Adiabatic quantum computing challenges , SIGACT News 46
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Robert Raussendorf, Contextuality in measurement-based quantum computation , Phys. Rev. A 88
2013
Cited alongside, same era.
John A. Smolin, Graeme Smith, and Alexander Vargo, Oversimplifying quantum factoring , Nature 499
2013
Cited alongside, same era.
Zhengbing Bian, Fabian Chudak, Robert Israel, Brad Lackey, William G Macready, and Aidan Roy, Discrete optimization using quantum annealing on sparse ising models , Frontiers in Physics 2
2014
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
Thomas Monz, Daniel Nigg, Esteban A. Martinez, Matthias F. Brandl, Philipp Schindler, Richard Rines, Shannon X. Wang, Isaac L. Chuang, and Rainer Blatt, Realization of a scalable shor algorithm , Science 351
2016
Closest in time.