1
program role
34
collaborators
2017–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
8 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Constant-Overhead Magic State Distillation
best student paper
|
QIP 2025 | plenary_long | Adam Wills, Min-Hsiu Hsieh |
| 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 |
| Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes | TQC 2025 | regular | Shiro Tamiya, Masato Koashi |
| The New Frontier in Low-Overhead Fault-Tolerant Quantum Computation | TQC 2025 | invited ▸ presenter | — |
| 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 |
24 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes | QIP 2026 | ▸Shiro Tamiya, Kento Tsubouchi |
| Characterizing Memory-Constrained Implementability of Quantum Instruments via Signaling Conditions | QIP 2026 | ▸Kosuke Matsui, Jun-Yi Wu, Min-Hsiu Hsieh, Mio Murao |
| Learning with Optimized Random Feature: Quantum-Inspired Classical Sampling without Sparsity and Low-Rank Assumptions | QIP 2026 | ▸Natsuto Isogai, Mio Murao |
| 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 |
| 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 |
| Efficient decoding of stabilizer code by single-qubit local operations and classical communication | QIP 2024 | Koki Shiraishi, Mio Murao |
| Energy-Consumption Advantage of Quantum Computation | QIP 2024 | Florian Meier |
| Quantum State Preparation via Efficiently Represented Boolean Function | QIP 2024 | Yu Tanaka, Mio Murao |
| Every quantum helps: Operational advantage of quantum resources beyond convexity | QIP 2024 | Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso |
| Every quantum helps: Operational advantage of quantum resources beyond convexity | TQC 2024 | Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso |
| Advantage of Quantum Machine Learning from General Computational Advantages | TQC 2024 | Natsuto Isogai, Mio Murao |
| Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation | TQC 2023 | Sathyawageeswar Subramanian, Satoshi Hayakawa, Sho Sonoda |
| General Quantum Resource Theories: Distillation, Formation and Consistent Resource Measures | QIP 2021 | Kohdai Kuroiwa |
| Learning with Optimized Random Features: Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rank Assumptions | QIP 2021 | Sathyawageeswar Subramanian, Sho Sonoda, Masato Koashi |
| General Quantum Resource Theories: Maximal Resources, Catalytic Replication, and Consistent Measures | TQC 2021 | Kohdai Kuroiwa |
| Learning with Optimized Random Features: End-to-End Application of Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rankness Assumptions | TQC 2021 | Sathyawageeswar Subramanian, Sho Sonoda, Masato Koashi |
| Hierarchy of quantum operations in manipulating coherence and entanglement | QIP 2020 | Madhav Krishnan Vijayan, Min-Hsiu Hsieh |
| On the equivalence of approximate Gottesman-Kitaev-Preskill codes | QIP 2020 | Takaya Matsuura, Masato Koashi |
| Polylog-overhead fault-tolerant measurement-based quantum computation by homodyne detection | TQC 2020 | Kosuke Fukui, Yuki Takeuchi, Seiichiro Tani, Masato Koashi |
| One-shot quantum state merging for arbitrarily-small-dimensional systems under one-way and two-way communication | QIP 2019 | Mio Murao |
| Entanglement cost for state exchange Gerardo Adesso and Soojoon Lee | QIP 2019 | Yonghae Lee, Ryuji Takagi, Bartosz Regula |
| One-way and two-way LOCC separation in entanglement cost of one-shot quantum state merging | TQC 2019 | Mio Murao |
| Graph-Associated Entanglement Cost of Multipartite State in Exact and Finite-Block- Length Approximate Construction | QIP 2017 | Akihito Soeda, Mio Murao |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2025 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Mio Murao | 10 |
| Masato Koashi | 6 |
| Kohdai Kuroiwa | 5 |
| Min-Hsiu Hsieh | 4 |
| Shiro Tamiya | 4 |
| Natsuto Isogai | 3 |
| Ryuji Takagi | 3 |
| Sathyawageeswar Subramanian | 3 |
| Sho Sonoda | 3 |
| Gerardo Adesso | 2 |
| Jun-Yi Wu | 2 |
| Kosuke Matsui | 2 |
| Takaya Matsuura | 2 |
| Adam Wills | 1 |
| Akihisa Goban | 1 |
| Akihito Soeda | 1 |
| Bartosz Regula | 1 |
| Florian Meier | 1 |
| Kento Tsubouchi | 1 |
| Koki Shiraishi | 1 |