Bounds on approximating Max $k$XOR with quantum and classical local algorithms
We consider the power of local algorithms for approximately solving Max $k$XOR, a generalization of two constraint satisfaction problems previously studied with classical and quantum algorithms (MaxCut and Max E3LIN2). In Max $k$XOR each constraint is the XOR of exactly $k$ variables and a parity bi...
Na minha lista:
| Principais autores: | , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-07-01
|
| 叢編: | Quantum |
| 在線閱讀: | https://quantum-journal.org/papers/q-2022-07-07-757/pdf/ |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|