Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
Quantum Physics
2025-04-22 v1
Abstract
We introduce a -approximation algorithm for Quantum MaxCut and a -approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to partially entangle pairs of qubits associated to edges in a matching, while preserving the direction of their single-qubit Bloch vectors. This allows us to interpolate between product states and matching-based states with a tunable parameter.
Cite
@article{arxiv.2504.15276,
title = {Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings},
author = {Anuj Apte and Eunou Lee and Kunal Marwaha and Ojas Parekh and James Sud},
journal= {arXiv preprint arXiv:2504.15276},
year = {2025}
}