Shiro Tamiya

Quantum Computation / Quantum Imformation / Assistant Professor @ The University of Tokyo

[Shiro Tamiya @Shiro_Tamiya]

我々の論文がNature Physicsに掲載されました。

QLDPC符号を用いた誤り耐性量子計算に対して、定数空間・polylog時間オーバーヘッドという小さいコストで実行可能なプロトコルを与え、デコーダ等の古典計算の待機時間を考慮しても閾値定理が成立することを証明しました。https://t.co/X9FU3tFbJ9

[Shiro Tamiya @Shiro_Tamiya]

@TshkSasaki ありがとうございます！🙏

[Shiro Tamiya @Shiro_Tamiya]

6/1より東京大学大学院工学系研究科に助教として着任しました。小芦研です。引き続きよろしくお願いいたします！

[Shiro Tamiya @Shiro_Tamiya]

@haranyyyyy ありがとう！！

[東京大学 | UTokyo @UTokyo_News]

[プレスリリース] 量子コンピュータの規模と計算速度のジレンマを解消――誤り耐性量子計算のコストを大幅に削減する新提案―――工学系研究科・工学部
https://t.co/udGT9znFKu

[Shiro Tamiya @Shiro_Tamiya]

Joint work with Masato Koashi and Hayata Yamasaki.

[Shiro Tamiya @Shiro_Tamiya]

Our paper "Fault-tolerant quantum computation with polylogarithmic time and constant space overheads" has been published in @NaturePhysics.
We prove a threshold theorem for FTQC using QLDPC codes with constant space overhead and a negligibly small slowdown.https://t.co/X9FU3tFbJ9

[Shiro Tamiya @Shiro_Tamiya]

This is a joint work with Kento Tsubouchi and @HayataYamasaki .

[Shiro Tamiya @Shiro_Tamiya]

New paper on QEC!
We propose Degeneracy Cutting (DC), a parallelizable and efficient post-processing method for BP decoding of qLDPC codes. DC resolves degeneracy by removing a reliable variable node in each stabilizer support, improving BP performance. https://t.co/RcIq4ftYc3

[Shiro Tamiya @Shiro_Tamiya]

@ikkoham @HayataYamasaki Thank you, Hamamura-san!

[Shiro Tamiya @Shiro_Tamiya]

Honored that our paper received the Best Paper Award at TQC 2025.
Grateful to my collaborator Masato Koashi and @HayataYamasaki , and many thanks to the organizers, program committee, and reviewers for their efforts!

[Hayata Yamasaki @HayataYamasaki]

Our paper has received the Best Paper Award at TQC2025, one of the leading conferences in quantum information theory. We prove that FTQC can be achieved with polylog time overhead and constant space overhead. Joint work with Shiro Tamiya and Masato Koashi. https://t.co/kZlOPlrCQ3

[Satoshi Yoshida @sy_3104]

Our work “Concatenate codes, save qubits” has been published in npj Quantum Information!

https://t.co/iZJZty2gNM

The simulation code used in this work is available in GitHub:

https://t.co/LAUlGdtwVE

[Shiro Tamiya @Shiro_Tamiya]

量子LDPC符号を用いた誤り耐性量子計算(FTQC)に関するプレプリントを公開しました！

[Shiro Tamiya @Shiro_Tamiya]

Excited to share our latest research on FTQC!
Our protocol based on high-rate quantum LDPC codes (especially quantum expander codes) achieves polylogarithmic time and constant space overhead FTQC.

https://t.co/d8o4cZUlkp

[Shiro Tamiya @Shiro_Tamiya]

This is a joint work with Masato Koashi and @HayataYamasaki.

[Shiro Tamiya @Shiro_Tamiya]

Excited to share our latest research on FTQC!
Our protocol based on high-rate quantum LDPC codes (especially quantum expander codes) achieves polylogarithmic time and constant space overhead FTQC.

https://t.co/d8o4cZUlkp

[Shiro Tamiya @Shiro_Tamiya]

Importantly, our results hold even with the non-zero runtime of classical computations—especially for the decoder—as well as the idling errors that accumulate during these computation.

[Physical Review Research @PhysRevResearch]

Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder, Andrew S. Darmawan, Yoshifumi Nakata, Shiro Tamiya, and Hayata Yamasaki @shiro_tamiya @hayatayamasaki #Quantum #QuantumInformation https://t.co/S5ixmIhod7

[Satoshi Yoshida @sy_3104]

Our FTQC paper is out! We construct a fault-tolerant protocol based on concatenated codes, achieving a substantially lower space overhead and a higher threshold than that for the surface code. This is a joint work with @Shiro_Tamiya and @HayataYamasaki.
https://t.co/l7F7gy2aG1