Fetching the paper…
Reading the bibliography…
Introducing additional tunable parameters to quantum circuits is a powerful way of improving performance without increasing hardware requirements.
T. Hogg and D. Portnov, “Quantum optimization,” Information Sciences , vol. 128, no. 3-4, pp. 181–197, 2000
2000
Earlier work this paper cites.
B. D. McKay, “Nauty user’s guide (version 2.4),” Computer Science Dept., Australian National University , pp. 225–239, 2007
2007
Earlier work this paper cites.
C. C. McGeoch and C. Wang, “Experimental evaluation of an adiabiatic quantum system for combinatorial optimization,” in Proceedings of the ACM International Conference on Computing Frontiers , 2013, pp. 1–11
2013
Earlier work this paper cites.
B. D. McKay and A. Piperno, “Nauty and Traces user’s guide (Version 2.5),” Computer Science Department, Australian National University, Canberra, Australia , 2013
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
L. Babai, “Graph isomorphism in quasipolynomial time,” in Proceedings of the ACM Symposium on Theory of Computing , 2016, pp. 684–697
2016
Earlier work this paper cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al. , “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, 2019
2019
Earlier work this paper cites.
R. Shaydulin and Y. Alexeev, “Evaluating quantum approximate optimization algorithm: A case study,” in International Green and Sustainable Computing Conference . IEEE, 2019, pp. 1–6
2019
Cited alongside, same era.
Y. Wu, W.-S. Bao, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan et al. , “Strong quantum computational advantage using a superconducting quantum processor,” Physical Review Letters , vol. 127, no. 18, p. 180501, 2021
2021
Cited alongside, same era.
M. P. Harrigan, K. J. Sung, M. Neeley, K. J. Satzinger, F. Arute, K. Arya, J. Atalaya, J. C. Bardin, R. Barends, S. Boixo et al. , “Quantum approximate optimization of non-planar graph problems on a planar superconducting processor,” Nature Physics , vol. 17, no. 3, pp. 332–336, 2021
2021
Cited alongside, same era.
R. Shaydulin and A. Galda, “Error mitigation for deep quantum optimization circuits by leveraging problem symmetries,” in International Conference on Quantum Computing and Engineering . IEEE, 2021
M. Ringbauer, M. Meth, L. Postler, R. Stricker, R. Blatt, P. Schindler, and T. Monz, “A universal qudit quantum processor with trapped ions,” Nature Physics , pp. 1–5, 2022
2022
Closest in time.
N. Mohseni, P. L. McMahon, and T. Byrnes, “Ising machines as hardware solvers of combinatorial optimization problems,” Nature Reviews Physics , vol. 4, no. 6, pp. 363–379, 2022
2022
Closest in time.
2022
Closest in time.
P. Niroula, R. Shaydulin, R. Yalovetzky, P. Minssen, D. Herman, S. Hu, and M. Pistoia, “Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer,” 2022
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,” Nature Reviews Physics , vol. 3, no. 9, pp. 625–644, 2021
2021
Cited alongside, same era.
R. Shaydulin, S. Hadfield, T. Hogg, and I. Safro, “Classical symmetries and the quantum approximate optimization algorithm,” Quantum Information Processing , vol. 20, no. 11, pp. 1–28, 2021
2021
Cited alongside, same era.
L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins et al. , “Quantum computational advantage with a programmable photonic processor,” Nature , vol. 606, no. 7912, pp. 75–81, 2022
2022
Cited alongside, same era.
B. McKay, “Graphs [data set],” found at http://users.cecs.anu.edu.au/ bdm/data/graphs.html
Cited in the paper.
P. C. Lotshaw and T. S. Humble, “QAOA dataset,” found at https://code.ornl.gov/qci/qaoa-dataset-version1
Cited in the paper.
2022
Closest in time.
R. Herrman, “Investigating parameters in the multi-angle approximate optimization algorithm,” in APS March Meeting Abstracts , vol. 2022, 2022, pp. G00–075
2022
Closest in time.