Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut.
Conference
·
OSTI ID:1642618
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:
- AC04-94AL85000
- OSTI ID:
- 1642618
- Report Number(s):
- SAND2019-11766C; 679849
- Resource Relation:
- Conference: Proposed for presentation at the ArXiv version of a paper.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Almost optimal classical algorithms for a quantum generalization of Max Cut.
Investigating the Quantum Approximate Optimization Algorithm?s Advantage over Classical Algorithms.
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.
Conference
·
Sun Dec 01 00:00:00 EST 2019
·
OSTI ID:1642618
Investigating the Quantum Approximate Optimization Algorithm?s Advantage over Classical Algorithms.
Conference
·
Wed Feb 01 00:00:00 EST 2017
·
OSTI ID:1642618
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.
Conference
·
Sat Oct 01 00:00:00 EDT 2022
·
OSTI ID:1642618