An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs
We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state. The SDP is used to choose the parameters of a variational quantum circuit. The entangled state is then represented as the quantum circuit applied to a product state. It ach...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2023-11-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2023-11-09-1180/pdf/ |