Classical symmetries and the Quantum Approximate Optimization Algorithm
- 26 October 2021
- journal article
- research article
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (11) , 1-28
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ames Research Center
- Defense Advanced Research Projects Agency (IAA 8839, Annex 114)
- NASA Academic Mission Services (Contract NNA16BD14C)
- Argonne National Laboratory
- Advanced Scientific Computing Research
This publication has 55 references indexed in Scilit:
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- Automorphism group and diameter of a graphJournal of Graph Theory, 2011
- Orbital branchingMathematical Programming, 2009
- On the asymmetry of random regular graphs and random graphsRandom Structures & Algorithms, 2002
- Direct search algorithms for optimization calculationsActa Numerica, 1998
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Computing automorphisms and canonical labellings of graphs1978
- Asymmetric graphsActa Mathematica Hungarica, 1963