scientific article; zbMATH DE number 7650098

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.31MaRDI QIDQ5875485

Sevag Gharibian, Ojas Parekh

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1909.08846

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

zbMATH Keywords

approximation algorithmHeisenberg modelmax-cutproduct statelocal HamiltonianQMA-hard

Mathematics Subject Classification ID

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

Related Items (2)

Entropy constraints for ground energy optimization ⋮ Unnamed Item

Cites Work

• Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9--13, 2012. Proceedings, Part I
• On complexity of the quantum Ising model
• Perfect correlations in the Einstein-Podolsky-Rosen experiment and Bell's inequalities.
• Complexity Classification of Local Hamiltonian Problems
• Approximation Algorithms for QMA-Complete Problems
• Proof verification and the hardness of approximation problems
• Grothendieck inequalities for semidefinite programs with rank constraint
• Quantum Hamiltonian Complexity
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Probabilistic checking of proofs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The detectability lemma and quantum gap amplification
• Product-state approximations to quantum ground states
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: