Classical symmetries and the quantum approximate optimization algorithm (Q2099573): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MLSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Traces / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3205061038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism group and diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point definability and polynomial time on graphs with excluded minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetry of random regular graphs and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the automorphism group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A batch, derivative-free algorithm for finding multiple local minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronously parallel optimization solver for finding multiple minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel techniques to speed up the computation of the automorphism group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ELRUNA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3462469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840778 / rank
 
Normal rank

Latest revision as of 22:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Classical symmetries and the quantum approximate optimization algorithm
scientific article

    Statements

    Classical symmetries and the quantum approximate optimization algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2022
    0 references
    quantum approximate optimization algorithm
    0 references
    quantum optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers