collaborators

6 papers

quant-ph2026

The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits

Leonardo Placidi, Enrico Rinaldi, Keisuke Fujii +1

Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the…

quant-ph2025

Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC

Yohei Ibe, Yutaka Hirano, Yasuo Ozu +2

We propose a measurement-based FTQC (MB-FTQC) architecture for high-connectivity platforms such as trapped ions and neutral atoms. The key idea is to use verified logical ancillas…

quant-ph2025

Efficient magic state cultivation with lattice surgery

Yutaka Hirano, Riki Toshio, Tomohiro Itogawa +1

Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physic…

quant-ph2025

Locality-aware Pauli-based computation for local magic state preparation

Yutaka Hirano, Keisuke Fujii

Magic state distillation, a process for preparing magic states needed to implement non-Clifford gates fault-tolerantly, plays a crucial role in fault-tolerant quantum computation.…

quant-ph2025

Efficient Magic State Distillation by Zero-Level Distillation

Tomohiro Itogawa, Yugo Takada, Yutaka Hirano +1

Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using idea…

quant-ph2025

Clifford gates with logical transversality for self-dual CSS codes

Theerapat Tansuwannont, Yugo Takada, Keisuke Fujii

Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same dis…