Matthew Coudron

activity

20122026

most citedComputations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)

25 citations · 92 across the 16 of their papers we have counts for

collaborators

Showing 2026 · quant-phShow all

2 papers · 2 filters

quant-ph2026

Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits

Matthew Coudron, Michael J. Gullans, Jon Nelson +2

We give a deterministic classical algorithm that estimates $∣ ⟨ x ∣ U ∣ 0^{n} ⟩ ∣^{2}$ to additive error $ε$ in $poly (n, 1/ ε)$ time, where $U$ is a co…

quant-ph2026

A quantum lower bound for path finding in welded trees

Joseph Carolan, Andrew M. Childs, Matthew Coudron +1

In the welded tree problem, an algorithm is tasked with navigating a graph formed from two binary trees joined at the leaves through a ``weld'' of connecting edges. A quantum walk…