Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Quantum Max Cut for complete tripartite graphs
Tea Å trekelj
The Quantum Max--Cut (-QMC) problem is a special instance of a -local Hamiltonian problem, representing the quantum analog of the classical Max--Cut problem. The -QM…
quant-ph2025
Quantum Max d-Cut via qudit swap operators
Igor Klep, Tea Å trekelj, Tea Štrekelj +2
Quantum Max Cut (QMC) problem for systems of qubits is an example of a 2-local Hamiltonian problem, and a prominent paradigm in computational complexity theory. This paper investig…