19 citations · 25 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
A Shortest Augmenting Path Algorithm for Linear Matroid Parity
Kou Hamada, Satoru Iwata
The matroid parity problem generalizes both graph matching and matroid intersection. Although the general version is intractable, Lovász (1981) developed a polynomial-time algorith…
quant-ph2026
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Kou Hamada, Hiroki Hamaguchi, Yosuke Ueno +3
Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between su…