19 citations · 25 across the 4 of their papers we have counts for
6 papers
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…
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…
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…
Handbook for Quantifying Robustness of Magic
Hiroki Hamaguchi, Kou Hamada, Nobuyuki Yoshioka
The nonstabilizerness, or magic, is an essential quantum resource to perform universal quantum computation. Robustness of magic (RoM) in particular characterizes the degree of usef…