Jorquera, Z. (CSE) – Quantum Entanglement Bounds and the Approximation Algorithms That Use Them
Hybrid Event
One of the central challenges in quantum computing is finding or approximating the ground-state energy of a local Hamiltonian, a quantum analogue of classical constraint satisfaction problems (CSPs). Among these, the Quantum Max-Cut problem serves as a canonical example, paralleling the classical Max-Cut problem. Despite its foundational importance in both theoretical computer science and condensed […]