3
talks
1
posters
0
committee roles
0
leadership roles
2021–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes | TQC 2025 | regular | Masato Koashi, Hayata Yamasaki |
|
Concatenate codes, save qubits ↗
|
TQC 2024 | regular | ▸Satoshi Yoshida, Hayata Yamasaki |
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. |
|||
| Explicit constructions of exact unitary $t$-designs and applications to higher-order randomized benchmarking | TQC 2021 | regular | Yoshifumi Nakata, Da Zhao, Takayuki Okuda, Eiichi Bannai, Yasunari Suzuki, Kentaro Heya, Zhiguang Yan, Kun Zuo, Shuhei Tamate, Yutaka Tabuchi, Yasunobu Nakamura |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computers | QIP 2025 | Shinichi Sunami, Ryotaro Inoue, Hayata Yamasaki, Akihisa Goban |
Collaborators
| Co-author | Joint talks |
|---|---|
| Hayata Yamasaki | 3 |
| Akihisa Goban | 1 |
| Da Zhao | 1 |
| Eiichi Bannai | 1 |
| Kentaro Heya | 1 |
| Kun Zuo | 1 |
| Masato Koashi | 1 |
| Ryotaro Inoue | 1 |
| Satoshi Yoshida | 1 |
| Shinichi Sunami | 1 |
| Shuhei Tamate | 1 |
| Takayuki Okuda | 1 |
| Yasunari Suzuki | 1 |
| Yasunobu Nakamura | 1 |
| Yoshifumi Nakata | 1 |
| Yutaka Tabuchi | 1 |
| Zhiguang Yan | 1 |