continuous-time quantum walk 1graph optimization 1greedy heuristic 1hybrid quantum-classical algorithm 1minimum vertex cover 1trotterization 1
From the 1 of 2 linked papers with an AI index.
2 papers
quant-ph2026
Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks
Ruben Pariente Bassa, Finley A. Quinton, Franz G. Fuchs +1
The paper proposes a hybrid quantum‑classical greedy algorithm that uses continuous‑time quantum walks to solve the minimum vertex cover problem (and maximum independent set) more…
quant-ph2025
Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers
Finley Alexander Quinton, Per Arne Sevle Myhr, Mostafa Barani +2
Quantum computing is rapidly advancing, harnessing the power of qubits' superposition and entanglement for computational advantages over classical systems. However, scalability pos…