activity
20242026
most citedCompilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture

2 citations · 4 across the 10 of their papers we have counts for

collaborators

11 papers

quant-ph2026

Efficient Fidelity Estimation of General Quantum Resource States via Clifford Circuits

Shunta Takahashi, Keisuke Fujii

Fidelity estimation is a fundamental tool for assessing quantum resource states across quantum information science. For small infidelity , tomography and direct fidelity estimat…

quant-ph2026

Zero-level Distillation

Tomohiro Itogawa, Yutaka Hirano, Yutaro Akahoshi +1

Magic state distillation is a key component of fault-tolerant quantum computation, as it enables the implementation of non-Clifford gates such as the gate and the gate vi…

quant-ph2026

Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry

Kohei Yamamoto, Keisuke Fujii

One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum…

quant-ph2026

Adaptive Window Decoding based on Spatiotemporal Complementary Gap

Moeto Mishima, Riki Toshio, Kaito Kishi +4

Real-time decoding plays a crucial role in practical fault-tolerant quantum computing. Window decoding, in which the decoding problem is divided into windows, is a promising approa…

quant-ph2026

STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer

Riki Toshio, Shota Kanasugi, Jun Fujisaki +3

We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on early fault-tolerant quantum computers. This protocol judiciously combines two of…

quant-ph2026

Partially Fault-Tolerant Quantum Computation for Megaquop Applications

Ming-Zhi Chung, Ali H. Z. Kavaki, Artur Scherer +14

Partially fault-tolerant quantum computing (FTQC) has recently emerged as a promising approach for the execution of megaquop-scale circuits with millions of logical operations. In…

quant-ph2026

Even More Efficient Soft-Output Decoding with Extra-Cluster Growth and Early Stopping

Kaito Kishi, Riki Toshio, Jun Fujisaki +3

In fault-tolerant quantum computing, soft outputs from real-time decoders play a crucial role in improving decoding accuracy, post-selecting magic states, and accelerating lattice…

quant-ph2025

Decoder Switching: Breaking the Speed-Accuracy Tradeoff in Real-Time Quantum Error Correction

Riki Toshio, Kaito Kishi, Jun Fujisaki +3

The realization of fault-tolerant quantum computers hinges on the construction of high-speed, high-accuracy, real-time decoding systems. The persistent challenge lies in the fundam…

quant-ph2025

Runtime reduction in lattice surgery utilizing time-like soft information

Yutaro Akahoshi, Riki Toshio, Jun Fujisaki +3

Runtime optimization of the quantum computing within a given computational resource is important to achieve practical quantum advantage. In this paper, we propose a runtime reducti…

quant-ph2024★ 2 cited

Practical quantum advantage on partially fault-tolerant quantum computer

Riki Toshio, Yutaro Akahoshi, Jun Fujisaki +3

Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles…

quant-ph2024★ 2 cited

Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture

Yutaro Akahoshi, Riki Toshio, Jun Fujisaki +3

Achieving practical quantum speedup with limited resources is a crucial challenge in both academic and industrial communities. To address this, a partially fault-tolerant quantum c…