Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs

Published 2021 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs
Authors
Keywords
-
Journal
Quantum
Volume 5, Issue -, Pages 437
Publisher
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Online
2021-04-20
DOI
10.22331/q-2021-04-20-437
References
View 4 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.