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…
cs.DS2024
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
Kou Hamada, Sankardeep Chakraborty, Seungbum Jo +3
Tree covering is a technique for decomposing a tree into smaller-sized trees with desirable properties, and has been employed in various succinct data structures. However, signific…
quant-ph2024
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…