Outperforming QAOA on MaxCut with Fast Classical Hyperplane Rounding Algorithms.
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- NA0003525
- OSTI ID:
- 1882084
- Report Number(s):
- SAND2021-9056C; 697892
- Resource Relation:
- Conference: Proposed for presentation at the SIAM Optimization Conference held July 22-22, 2021 in ,
- Country of Publication:
- United States
- Language:
- English
Similar Records
Combinatorial Approximation Algorithms for MAXCUT using Random Walks.
Combinatorial Approximation Algorithms for MAXCUT using Random Walks.
Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems.
Conference
·
Sat Jan 01 00:00:00 EST 2011
·
OSTI ID:1882084
Combinatorial Approximation Algorithms for MAXCUT using Random Walks.
Conference
·
Sat Jan 01 00:00:00 EST 2011
·
OSTI ID:1882084
Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems.
Conference
·
Wed Aug 01 00:00:00 EDT 2018
·
OSTI ID:1882084