Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks.
E. Noether, Math. Z. 30
1929
Earlier work this paper cites.
E. Noether, Math. Z. 37
1933
Earlier work this paper cites.
R. Brauer and H. Weyl, Am. J. Math. 57
1935
Earlier work this paper cites.
H. Weyl, Ann. Math. 37
1936
Earlier work this paper cites.
L. Onsager, Phys. Rev. 65
1944
Earlier work this paper cites.
B. Kaufman, Phys. Rev. 76
1949
Earlier work this paper cites.
A. Borel and J. de Siebenthal, Comment. Math. Helv. 23
1949
Earlier work this paper cites.
G. C. Wick, A. S. Wightman, and E. P. Wigner, Phys. Rev. 88
1952
Earlier work this paper cites.
H. Weyl, The Classical Groups (Princeton University Press, Princeton, 1953)
1953
Earlier work this paper cites.
M. Obata, Trans. Am. Math. Soc. 87
1958
Earlier work this paper cites.
C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras (Wiley, New York, 1962)
1962
Earlier work this paper cites.
P. Erdős and A. Rényi, Acta Math. Acad. Sci. Hung. 14
1963
Earlier work this paper cites.
F. D. Murnaghan, The Theory of Group Representations (Dover Publications, New York, 1963)
1963
Earlier work this paper cites.
H. Boerner, Representation of Groups , 2nd ed. (North-Holland, Amsterdam, 1969)
1969
Earlier work this paper cites.
F. Lowenthal, Rocky Mt. J. Math. 1
1971
Earlier work this paper cites.
R. M. Karp, in Complexity of Computer Computations , edited by R. E. Miller and J. W. Thatcher (Plenum Press, New York, 1972) pp. 85–103
1972
Earlier work this paper cites.
W. Miller, Jr., Symmetry Groups and Their Applications (Academic Press, New York, 1972)
1972
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, Theor. Comput. Sci. 1
1976
Earlier work this paper cites.
S. Helgason, Differential Geometry, Lie Groups, and Symmetric Spaces (Academic Press, New York, 1978)
1978
Earlier work this paper cites.
M. Goto and F. D. Grosshans, Semisimple Lie Algebras (Marcel Dekker, New York, 1978)
1978
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractibility (W. H. Freeman and Company, San Francisco, 1979)
1979
Earlier work this paper cites.
N. Jacobson, Lie Algebras (Dover Publications, New York, 1979)
1979
Earlier work this paper cites.
M. Grötschel and W. R. Pulleyblank, Oper. Res. Lett. 1
1981
Earlier work this paper cites.
C. W. Curtis and I. Reiner, Methods of Representation Theory, Volume I (Wiley, New York, 1981)
1981
Earlier work this paper cites.
E. Noether, Gesammelte Abhandlungen – Collected Papers (Springer, Berlin, 1983)
1983
Earlier work this paper cites.
D. Shemesh, Lin. Alg. Appl. 62
1984
Earlier work this paper cites.
N. Jacobson, Basic Algebra I , 2nd ed. (Freeman, San Francisco, 1985)
1985
Earlier work this paper cites.
D. H. Sattinger and O. L. Weaver, Lie Groups and Algebras with Applications to Physics, Geometry, and Mechanics (Springer, New York, 1986)
1986
Earlier work this paper cites.
W. Ledermann, Introduction to group characters , 2nd ed. (Cambridge University Press, Cambridge, 1987)
1987
Earlier work this paper cites.
N. Bourbaki, Elements of Mathematics, Lie Groups and Lie Algebras, Chapters 1–3 (Springer, Berlin, 1989)
1989
Earlier work this paper cites.
N. Jacobson, Basic Algebra II , 2nd ed. (Freeman, San Francisco, 1989)
1989
Earlier work this paper cites.
F. Silva Leite, Rocky Mt. J. Math. 21
1991
Earlier work this paper cites.
C. H. Papadimitriou and M. Yannakakis, J. Comput. Syst. Sci. 43
1991
Earlier work this paper cites.
B. L. van der Waerden, Algebra, Volume II , 3rd ed. (Springer, New York, 1991)
1991
Earlier work this paper cites.
W. Fulton and J. Harris, Representation Theory: A First Course (Springer, New York, 1991)
1991
Earlier work this paper cites.
W. A. Adkins and S. H. Weintraub, Algebra: An Approach via Module Theory (Springer, New York, 1992)
1992
Earlier work this paper cites.
V. V. Gorbatsevich, A. L. Onishchik, and E. B. Vinberg, Structure of Lie Groups and Lie Algebras, in Lie Groups and Lie Algebras III (Springer, Berlin, 1994) pp. 1–244
1994
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, J. ACM 42
1995
Earlier work this paper cites.
D. P. DiVincenzo, Phys. Rev. A 51
1995
Earlier work this paper cites.
S. Lloyd, Phys. Rev. Lett. 75
1995
Earlier work this paper cites.
M. M. Deza and M. Laurent, Geometry of Cuts and Metrics (Springer, Berlin, 1997)
1997
Earlier work this paper cites.
W. Bosma, J. Cannon, and C. Playoust, J. Symbolic Comput. 24
1997
Earlier work this paper cites.
E. W. Mayr, H. J. Prömel, and A. Steger, eds., Lectures on Proof Verification and Approximation Algorithms (Springer, Berlin, 1998)
1998
Earlier work this paper cites.
A. Borel, Semisimple Groups and Riemannian Symmetric Spaces (Hindustan Book Agency, New Delhi, 1998)
1998
Earlier work this paper cites.
C. W. Commander, Maximum Cut Problem, MAX-CUT, in Encyclopedia of Optimization , edited by C. A. Floudas and P. M. Pardalos (Springer, Boston, 2008) pp. 1991–1999
1999
Earlier work this paper cites.
H. Karloff, SIAM J. Comput. 29
1999
Earlier work this paper cites.
S. Arora, D. Karger, and M. Karpinski, J. Comput. Syst. Sci. 58
1999
Earlier work this paper cites.
H. Georgi, Lie Algebras in Particle Physics , 2nd ed. (CRC Press, Boca Ration, 1999)
1999
Earlier work this paper cites.
H. Samelson, Notes on Lie Algebras , 2nd ed. (Springer, New York, 1999)
1999
Earlier work this paper cites.
W. A. de Graaf, Lie Algebras: Theory and Algorithms (Elsevier, Amsterdam, 2000)
2000
Earlier work this paper cites.
V. V. Vazirani, Approximation Algorithms (Springer, Berlin, 2001)
2001
Earlier work this paper cites.
J. Håstad, J. ACM 48
2001
Earlier work this paper cites.
B. T. Kiani, S. Lloyd, and R. Maity, Learning unitaries by gradient descent (2020), arXiv:2001.11897
2001
Earlier work this paper cites.
B. E. Sagan, The Symmetric Group , 2nd ed. (Springer, New York, 2001)
2001
Earlier work this paper cites.
C. Godsil and G. Royle, Algebraic Graph Theory (Springer, New York, 2001)
2001
Earlier work this paper cites.
U. Feige and G. Schechtman, Random Struct. Alg. 20
2002
Earlier work this paper cites.
D. D’Alessandro, Syst. Control Lett. 47
2002
Earlier work this paper cites.
D. S. Dummit and R. M. Foote, Abstract Algebra , 3rd ed. (John Wiley & Sons, Hoboken, 2004)
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
K. Jansen, M. Karpinski, and A. L. E. Seidel, SIAM J. Comput. 35
2005
Cited alongside, same era.
C. V. Kraus, M. M. Wolf, and J. I. Cirac, Phys. Rev. A. 75
2007
Cited alongside, same era.
M.-C. Bañuls, J. I. Cirac, and M. M. Wolf, Phys. Rev. A 76
2007
Cited alongside, same era.
A. Newman, Max Cut, in Encyclopedia of Algorithms , edited by M.-Y. Kao (Springer, Boston, 2008) pp. 489–492
2008
Cited alongside, same era.
N. Bourbaki, Elements of Mathematics, Lie Groups and Lie Algebras, Chapters 7–9 (Springer, Berlin, 2008)
2008
Cited alongside, same era.
F. Lorenz, Algebra, Volume II (Springer, New York, 2008)
2008
Cited alongside, same era.
M. Jünger, E. Lobe, P. Mutzel, G. Reinelt, F. Rendl, G. Rinaldi, and T. Stollenwerk, ACM J. Exp. Algorithmics 26
2021
Later among the works it cites.
V. H. Nguyen and M. Minoux, Optim. Lett. 15
2021
Later among the works it cites.
R. Shaydulin and S. M. Wild, IEEE Trans. Quantum Eng. 2
2021
Later among the works it cites.
R. Shaydulin, S. Hadfield, T. Hogg, and I. Safro, Quantum Inf. Process. 20
2021
Later among the works it cites.
K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, et al. , Rev. Mod. Phys. 94
2022
Later among the works it cites.
M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, Nat. Comput. Sci. 10.1038/s43588-022-00311-3 (2022)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. Bourbaki, Elements of Mathematics, Lie Groups and Lie Algebras, Chapters 4–6 (Springer, Berlin, 2008)
2008
Cited alongside, same era.
D. Elliott, Bilinear Control Systems (Springer, London, 2009)
2009
Cited alongside, same era.
A. W. Harrow and R. A. Low, Commun. Math. Phys. 291
2009
Cited alongside, same era.
D. A. Roozemond, Algorithms for Lie algebras of algebraic groups , Ph.D. thesis , Technische Universiteit Eindhoven, Netherlands (2010)
2010
Cited alongside, same era.
R. A. Low, Pseudo-randomness and Learning in Quantum Computation , Ph.D. thesis , University of Bristol, UK (2010)
2010
Cited alongside, same era.
W. G. Brown and L. Viola, Phys. Rev. Lett. 104
2010
Cited alongside, same era.
2022
Later among the works it cites.
E. R. Anschuetz and B. T. Kiani, Nat. Commun. 13
2022
Later among the works it cites.
E. R. Anschuetz, Critical points in quantum generative models (2022)
2022
Later among the works it cites.
E. Fontana, M. Cerezo, A. Arrasmith, I. Rungger, and P. J. Coles, Quantum 6
2022
Later among the works it cites.
E. Kökcü, T. Steckmann, Y. Wang, J. Freericks, E. F. Dumitrescu, and A. F. Kemper, Phys. Rev. Lett. 129
2022
Later among the works it cites.
K. Shi, R. Herrman, R. Shaydulin, S. Chakrabarti, M. Pistoia, and J. Larson, in 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC) (Seattle, WA, 2022) pp. 414–419
2022
Later among the works it cites.
Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, PRX Quantum 3
2022
Later among the works it cites.
D. D’Alessandro, Introduction to Quantum Control and Dynamics , 2nd ed. (CRC Press, Boca Raton, 2022)
2022
Later among the works it cites.
M. Oszmaniec, A. Sawicki, and M. Horodecki, IEEE Trans. Inf. Theory 68
2022
Later among the works it cites.
J. Haferkamp, Quantum 6
2022
Later among the works it cites.
I. Marvian, Nat. Phys. 18
2022
Later among the works it cites.
C.-N. Chou, P. J. Love, J. S. Sandhu, and J. Shi, Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond, in 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 229, edited by M. Bojańczyk, E. Merelli, and D. P. Woodruff (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022) pp. 41:1–41:20
2022
Later among the works it cites.
J. Basso, D. Gamarnik, S. Mei, and L. Zhou, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
2022
Later among the works it cites.
J. Charfreitag, M. Jünger, S. Mallach, and P. Mutzel, in Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX , edited by C. A. Phillips and B. Speckmann (SIAM, 2022) pp. 54–66
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Later among the works it cites.
M. Larocca, N. Ju, D. García-Martín, P. J. Coles, and M. Cerezo, Nat. Comput. Sci. 3
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
I. Marvian, Theory of Quantum Circuits with Abelian Symmetries (2023), arXiv:2302.12466
2023
Later among the works it cites.
2023
Later among the works it cites.
A. W. Harrow and S. Mehraban, Commun. Math. Phys. 401
2023
Later among the works it cites.
R. O’Donnell, R. A. Servedio, and P. Paredes, in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023)
2023
Later among the works it cites.
E. Malvetti, Computing common eigenvectors and simultaneous triangulation (2023), arXiv:2309.14344
2023
Later among the works it cites.
S. Moudgalya, N. Regnault, and B. A. Bernevig, Phys. Rev. B 107
2023
Later among the works it cites.
M. Cerezo, M. Larocca, D. García-Martín, N. L. Diaz, P. Braccia, E. Fontana, M. S. Rudolph, P. Bermejo, A. Ijaz, S. Thanasilp, et al. , Does provable absence of barren plateaus imply classical simulability? or, why we need to rethink variational quantum computing (2023)
2023
Later among the works it cites.
A. Misra-Spieldenner, T. Bode, P. K. Schuhmacher, T. Stollenwerk, D. Bagrets, and F. K. Wilhelm, PRX Quantum 4
2023
Later among the works it cites.
D. Rehfeldt, T. Koch, and Y. Shinano, Math. Program. Comput. 15
2023
Later among the works it cites.
J. K. Fichte, D. L. Berre, M. Hecher, and S. Szeider, SIAM J. Comput. 66
2023
Later among the works it cites.
D. E. Knuth, The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 (Addison-Wesley, Upper Saddle River, New Jersey, 2023)
2023
Later among the works it cites.
2024
Closest in time.
2024
Closest in time.
P. Bermejo, B. Aizpurua, and R. Orús, Phys. Rev. Res. 6
2024
Closest in time.
M. Ragone, B. N. Bakalov, F. Sauvage, A. F. Kemper, C. Ortiz Marrero, M. Larocca, and M. Cerezo, Nat. Commun. 15
2024
Closest in time.
E. Fontana, D. Herman, S. Chakrabarti, N. Kumar, R. Yalovetzky, J. Heredge, S. H. Sureshbabu, and M. Pistoia, Nat. Commun. 15
2024
Closest in time.
L. Schatzki, M. Larocca, Q. T. Nguyen, F. Sauvage, and M. Cerezo, npj Quantum Inf. 10
2024
Closest in time.
S. Kazi, M. Larocca, and M. Cerezo, New Journal of Physics 26
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
F. Sauvage, M. Larocca, P. J. Coles, and M. Cerezo, Quantum Sci. Technol. 9
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
P.-G. Rozon and K. Agarwal, Phys. Rev. Research 6
2024
Closest in time.
M. H. Muñoz-Arias, S. Kourtis, and A. Blais, Phys. Rev. Res. 6
2024
Closest in time.
2024
Closest in time.
I. Marvian, H. Liu, and A. Hulse, Physical Review Letters 132
2024
Closest in time.
R. Gargiulo, M. Rizzi, and R. Zeier, in ReAQCT ’24: Proceedings of Recent Advances in Quantum Computing and Technology, June 19–20, 2024, Budapest, Hungary (ACM, 2024) pp. 20–50
2024
Closest in time.