3 papers
quant-ph2026
Advances in quantum algorithms for the shortest path problem
Adam WesoÅowski, Stephen Piddock
Given an undirected, weighted graph, with vertices and edges, and two special vertices and , the problem is to find the shortest path between them. We give two bound…
quant-ph2025
The classical limit of Quantum Max-Cut
Vir B. Bulchandani, Stephen Piddock
It is well-known in physics that the limit of large quantum spin should be understood as a semiclassical limit. This raises the question of whether such emergent classicality f…
quant-ph2025
Elfs, trees and quantum walks
Simon Apers, Stephen Piddock
We study an elementary Markov process on graphs based on electric flow sampling (elfs). The elfs process repeatedly samples from an electric flow on a graph. While the sinks of the…