scientific article; zbMATH DE number 7758361

DOI10.4230/lipics.approx/random.2020.59MaRDI QIDQ6058189

Ojas Parekh, Unnamed Author, Sean Hallgren

Publication date: 31 October 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmquantum computingmean-field theoryrandomized roundinglocal Hamiltonian

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Complexity Classification of Local Hamiltonian Problems
• Hardness of Approximation for Quantum Problems
• Grothendieck-Type Inequalities in Combinatorial Optimization
• Towards Sharp Inapproximability for Any 2-CSP
• Approximation Algorithms for QMA-Complete Problems
• The Positive Semidefinite Grothendieck Problem with Rank Constraint
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Approximation Algorithms for CSPs
• Approximation algorithms for quantum many-body problems
• Product-state approximations to quantum states
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: