![Error-Correcting Codes: Theory and Practice Logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-05/Quantum%20Algorithms%2C%20Complexity%2C%20and%20Fault%20Tolerance.jpg?h=49a0d866&itok=FUjtT9Ai)
Abstract
By exploiting the link between time-independent Hamiltonians and thermalisation, heuristic predictions on the performance of continuous-time quantum walks for MAX-CUT are made. The resulting predictions depend on the number of triangles in the underlying MAX-CUT graph. We extend these results to the time-dependent setting with multi-stage quantum walks and Floquet systems. The approach followed here provides a novel way of understanding the role of unitary dynamics in tackling combinatorial optimisation problems with continuous-time quantum algorithms.
Reference: Quantum 8, 1254 (2024)