scientific article; zbMATH DE number 7650098

DOI10.4230/LIPICS.APPROX-RANDOM.2019.31MaRDI QIDQ5875485zbMATH OpenFDO

Authors Sevag Gharibian, Ojas Parekh

Publication date 3 February 2023

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

zbMATH Keywords

approximation algorithmHeisenberg modellocal Hamiltonianmax-cutproduct stateQMA-hard

Mathematics Subject Classification ID

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

Cites work

• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation algorithms for QMA-complete problems
• Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9--13, 2012. Proceedings, Part I
• Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
• Complexity classification of local Hamiltonian problems
• Grothendieck inequalities for semidefinite programs with rank constraint
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On complexity of the quantum Ising model
• Perfect correlations in the Einstein-Podolsky-Rosen experiment and Bell's inequalities.
• Probabilistic checking of proofs
• Product-state approximations to quantum ground states
• Proof verification and the hardness of approximation problems
• Quantum Hamiltonian Complexity
• The detectability lemma and quantum gap amplification

Cited in

(8)

• scientific article; zbMATH DE number 7758361 (Why is no real title available?)
• Entropy constraints for ground energy optimization
• An improved quantum max cut approximation via maximum matching
• Bounds on the ground state energy of quantum p-spin Hamiltonians
• Sphere valued noise stability and quantum max-cut hardness
• Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms
• Improved algorithms for quantum MaxCut via partially entangled matchings
• Improved approximation algorithms for the EPR Hamiltonian

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875485)