Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms

DOI10.4230/LIPICS.ICALP.2021.102MaRDI QIDQ7241202zbMATH OpenFDO

Authors Ojas Parekh, Kevin E. Thompson

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.102

zbMATH Keywords

Heisenberg modelLasserre hierarchylocal Hamiltonianquantum approximation algorithmsquantum max cut

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Approximating CSPs with global cardinality constraints using SDP hierarchies
• Approximation algorithms for quantum many-body problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity of Positivstellensatz proofs for the knapsack
• Consistency of Local Density Matrices Is QMA-Complete
• Convergent relaxations of polynomial optimization problems with noncommuting variables
• Global optimization with polynomials and the problem of moments
• scientific article; zbMATH DE number 3496213 (Why is no real title available?)
• scientific article; zbMATH DE number 1757962 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 7651034 (Why is no real title available?)
• scientific article; zbMATH DE number 7650098 (Why is no real title available?)
• scientific article; zbMATH DE number 7758361 (Why is no real title available?)
• Hypercontractivity, sum-of-squares proofs, and their applications
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
• On the power of unique 2-prover 1-round games
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• Ordering Energy Levels of Interacting Spin Systems
• Product-state approximations to quantum ground states
• Semidefinite Programming
• The design of approximation algorithms

Cited in

(3)

• Classical algorithms for constant approximation of the ground state energy of local Hamiltonians
• Improved algorithms for quantum MaxCut via partially entangled matchings
• Improved approximation algorithms for the EPR Hamiltonian

This page was built for publication: Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms

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