19 citations · 25 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…
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…