2 citations · 2 across the 2 of their papers we have counts for
3 papers
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…
quant-ph2026★ 2 cited
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Kou Hamada, Yasunari Suzuki, Yuuki Tokunaga
Encoding logical qubits with surface codes and performing multi-qubit logical operations with lattice surgery is one of the most promising approaches to demonstrate fault-tolerant…
quant-ph2025
Faster computation of nonstabilizerness
Hiroki Hamaguchi, Kou Hamada, Naoki Marumo +1
The characterization of nonstabilizerness is fruitful due to its application in gate synthesis and classical simulation. In particular, the resource monotone called the stabilizer…