Classical symmetries and the quantum approximate optimization algorithm
From MaRDI portal
Publication:2099573
DOI10.1007/s11128-021-03298-4OpenAlexW3205061038MaRDI QIDQ2099573
Ilya Safro, Ruslan Shaydulin, Stuart Hadfield, Tad Hogg
Publication date: 24 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04713
Related Items (3)
A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Impact of graph structures for QAOA on maxcut ⋮ Solving MaxCut with quantum imaginary time evolution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbital branching
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Optimization, approximation, and complexity classes
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Asynchronously parallel optimization solver for finding multiple minima
- Upper bounds on the automorphism group of a graph
- Novel techniques to speed up the computation of the automorphism group of a graph
- A batch, derivative-free algorithm for finding multiple local minima
- Practical graph isomorphism. II.
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Automorphism group and diameter of a graph
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Algebraic Graph Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the asymmetry of random regular graphs and random graphs
- ELRUNA
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Fixed-point definability and polynomial time on graphs with excluded minors
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Asymmetric graphs
- Symmetry in complex networks
This page was built for publication: Classical symmetries and the quantum approximate optimization algorithm
