Classical symmetries and the quantum approximate optimization algorithm
From MaRDI portal
Publication:2099573
DOI10.1007/S11128-021-03298-4OpenAlexW3205061038MaRDI QIDQ2099573FDOQ2099573
Authors: Ruslan Shaydulin, Stuart Hadfield, Tad Hogg, Ilya Safro 
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
Recommendations
- scientific article
- Applying a new algorithm to derive nonclassical symmetries
- Applying a new algorithm to derive nonclassical symmetries
- Algorithms for the Nonclassical Method of Symmetry Reductions
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Symmetrizing quantum dynamics beyond gossip-type algorithms
- The theory of variational hybrid quantum-classical algorithms
- On the universality of the quantum approximate optimization algorithm
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- The parallel quantum algorithm for the class of optimization
Cites Work
- Practical graph isomorphism. II.
- Scikit-learn: machine learning in Python
- Asynchronously parallel optimization solver for finding multiple minima
- Optimization, approximation, and complexity classes
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Algebraic Graph Theory
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- 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?
- Symmetry in complex networks
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymmetric graphs
- Title not available (Why is that?)
- Orbital branching
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- On the asymmetry of random regular graphs and random graphs
- Title not available (Why is that?)
- A batch, derivative-free algorithm for finding multiple local minima
- Upper bounds on the automorphism group of a graph
- Advanced modern algebra. Part 1
- Novel techniques to speed up the computation of the automorphism group of a graph
- Automorphism group and diameter of a graph
- ELRUNA: elimination rule-based network alignment
Cited In (8)
- Empirical performance bounds for quantum approximate optimization
- Impact of graph structures for QAOA on maxcut
- Learning quantum symmetries with interactive quantum-classical variational algorithms
- Solving MaxCut with quantum imaginary time evolution
- A practitioner’s guide to quantum algorithms for optimisation problems
- Title not available (Why is that?)
- On the universality of the quantum approximate optimization algorithm
- A review on quantum approximate optimization algorithm and its variants
Uses Software
This page was built for publication: Classical symmetries and the quantum approximate optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099573)
