100 citations · 215 across the 14 of their papers we have counts for
16 papers · 1 filter
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…
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…
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…
Towards near-term quantum simulation of materials
Laura Clinton, Toby Cubitt, Brian Flynn +6
Simulation of materials is one of the most promising applications of quantum computers. On near-term hardware the crucial constraint on these simulations is circuit depth. Many qua…
General conditions for universality of Quantum Hamiltonians
Tamara Kohler, Stephen Piddock, Johannes Bausch +1
Recent work has demonstrated the existence of universal Hamiltonians - simple spin lattice models that can simulate any other quantum many body system to any desired level of accur…
Termwise versus globally stoquastic local Hamiltonians: questions of complexity and sign-curing
Marios Ioannou, Stephen Piddock, Milad Marvian +2
We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We show that the stoquastic local Hamiltonian pr…