8
talks
3
posters
1
committee roles
0
leadership roles
2023–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Generalized Quantum Stein’s Lemma and Second Law of Quantum Resource Theories | QIP 2025 | plenary_long | ▸Masahito Hayashi |
| Continuous-Variable Fault-Tolerant Quantum Computation under General Noise | QIP 2025 | regular | ▸Takaya Matsuura, Nicolas Menicucci |
|
Constant-Overhead Magic State Distillation
best student paper
|
QIP 2025 | plenary_long | Adam Wills, Min-Hsiu Hsieh |
| The New Frontier in Low-Overhead Fault-Tolerant Quantum Computation | TQC 2025 | invited ▸ presenter | — |
| Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes | TQC 2025 | regular | Shiro Tamiya, Masato Koashi |
| Entanglement cost for infinite-dimensional physical systems | QIP 2024 | regular ▸ presenter | Kohdai Kuroiwa, Patrick Hayden, Ludovico Lami |
|
Concatenate codes, save qubits ↗
|
TQC 2024 | regular | ▸Satoshi Yoshida, Shiro Tamiya |
The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and the modularity. A major obstacle in realizing FTQC with conventional protocols, such as those based on the surface code and the concatenated Steane code, has been the space overhead, i.e., the required number of physical qubits per logical qubit. Protocols based on high-rate quantum low-density parity-check (LDPC) codes gather considerable attention as a way to reduce the space overhead, but problematically, the existing fault-tolerant protocols for such quantum LDPC codes sacrifice the other factors. Here we construct a new fault-tolerant protocol to meet these requirements simultaneously based on more recent progress on the techniques for concatenated codes rather than quantum LDPC codes, achieving a constant space overhead, a high threshold, and flexibility in modular architecture designs. In particular, under a physical error rate of 0.1%, our protocol reduces the space overhead to achieve the logical CNOT error rates 10^-10 and 10^-24 by more than 90% and 97%, respectively, compared to the protocol for the surface code. Furthermore, our protocol achieves the threshold of 2.4% under a conventional circuit-level error model, substantially outperforming that of the surface code. The use of concatenated codes also naturally introduces abstraction layers essential for the modularity of FTQC architectures. These results indicate that the code-concatenation approach opens a way to significantly save qubits in realizing FTQC while fulfilling the other essential requirements for the practical protocol design. |
|||
| Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation | QIP 2023 | plenary_short ▸ presenter | Masato Koashi |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computers | QIP 2025 | Shinichi Sunami, Shiro Tamiya, Ryotaro Inoue, Akihisa Goban |
| Advantage of Quantum Machine Learning from General Computational Advantages | QIP 2025 | Natsuto Isogai, Mio Murao |
| Reducing qubit usage in entanglement distillation protocols | QIP 2025 | Kosuke Matsui, Jun-Yi Wu, Min-Hsiu Hsieh, Mio Murao |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2025 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Shiro Tamiya | 3 |
| Masato Koashi | 2 |
| Min-Hsiu Hsieh | 2 |
| Mio Murao | 2 |
| Adam Wills | 1 |
| Akihisa Goban | 1 |
| Jun-Yi Wu | 1 |
| Kohdai Kuroiwa | 1 |
| Kosuke Matsui | 1 |
| Ludovico Lami | 1 |
| Masahito Hayashi | 1 |
| Natsuto Isogai | 1 |
| Nicolas Menicucci | 1 |
| Patrick Hayden | 1 |
| Ryotaro Inoue | 1 |
| Satoshi Yoshida | 1 |
| Shinichi Sunami | 1 |
| Takaya Matsuura | 1 |