Classical symmetries and the quantum approximate optimization algorithm
type: Item
instance of: scholarly article
title: Classical symmetries and the quantum approximate optimization algorithm
author: Ruslan Shaydulin
author: Stuart Hadfield
author: Tad Hogg
author: Ilya Safro
published in: Quantum Information Processing
publication date: 2022-11-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/2012.04713
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 7622793
zbMATH Keywords: quantum approximate optimization algorithm
zbMATH Keywords: quantum optimization
describes a project that uses: libEnsemble
describes a project that uses: SciPy
describes a project that uses: Scikit
describes a project that uses: bliss
describes a project that uses: LIBSVM
describes a project that uses: NetworkX
describes a project that uses: GNU parallel
describes a project that uses: MLSVM
describes a project that uses: Traces
describes a project that uses: nauty
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W3205061038
cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
cites work: Graph isomorphism in quasipolynomial time [extended abstract]
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Algebraic Graph Theory
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: Automorphism group and diameter of a graph
cites work: Asymmetric graphs
cites work: Q3002797
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Fixed-point definability and polynomial time on graphs with excluded minors
cites work: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
cites work: Some optimal inapproximability results
cites work: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: On the asymmetry of random regular graphs and random graphs
cites work: Upper bounds on the automorphism group of a graph
cites work: A batch, derivative-free algorithm for finding multiple local minima
cites work: Asynchronously parallel optimization solver for finding multiple minima
cites work: Novel techniques to speed up the computation of the automorphism group of a graph
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Symmetry in complex networks
cites work: Q4182548
cites work: Practical graph isomorphism. II.
cites work: Q3671211
cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
cites work: Orbital branching
cites work: Optimization, approximation, and complexity classes
cites work: Q5396710
cites work: Q4308910
cites work: Q4215359
cites work: ELRUNA
cites work: Q3462469
cites work: Q4840778
DOI: 10.1007/S11128-021-03298-4
Recommended article: Q3400477
Recommended article: Applying a new algorithm to derive nonclassical symmetries
Recommended article: Algorithms for the Nonclassical Method of Symmetry Reductions
Recommended article: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Recommended article: Symmetrizing quantum dynamics beyond gossip-type algorithms
Recommended article: The theory of variational hybrid quantum-classical algorithms
Recommended article: On the universality of the quantum approximate optimization algorithm
Recommended article: A study of the performance of classical minimizers in the quantum approximate optimization algorithm
Recommended article: The Parallel Quantum Algorithm for the Class of Optimization
description: scientific article; zbMATH DE number 7622793