Hirotaka Oshima

Hirotaka Oshima

Auto-generated profile, based on publicly available information

Hirotaka Oshima

Fujitsu Limited

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 March 2024 in PRX Quantum
Verified
Journal Article
Open access
PDF file
YAYutaro Akahoshi
Yutaro Akahoshi
KMKazunori Maruyama
Kazunori Maruyama
HOHirotaka Oshima
Hirotaka Oshima
SSShintaro Sato
Shintaro Sato
KFKeisuke Fujii
Keisuke Fujii
Quantum computers are expected to drastically accelerate certain computing tasks versus classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually becoming available, but it is still challenging to achieve useful quantum advantages in meaningful tasks. On the other hand, full fault-tolerant quantum computing (FTQC) based on quantum error correction code remains far beyond realization due to its extremely large requirement of high-precision physical qubits. In this study, we propose a quantum computing architecture to close the gap between NISQ and FTQC architectures. Our architecture is based on erroneous arbitrary rotation gates and error-corrected Clifford gates implemented by lattice surgery. We omit the typical distillation protocol to achieve direct analog rotations and small qubit requirements, and minimize the remnant errors of the rotations by a carefully designed state injection protocol. Our estimation based on numerical simulations shows that for early-FTQC devices that consist of 104 physical qubits with physical error probability p=10−4, we can perform roughly 1.72×107 Clifford operations and 3.75×104 arbitrary rotations on 64 logical qubits. Such computations cannot be realized by the existing NISQ and FTQC architectures on the same device, as well as classical computers. We hope that our proposal and the corresponding development of quantum algorithms based on it will bring new insights into the realization of practical quantum computers in the future.

16 May 2025 in Physical Review X
Verified
Journal Article
Open access
RTRiki Toshio
Riki Toshio
YAYutaro Akahoshi
Yutaro Akahoshi
JFJun Fujisaki
Jun Fujisaki
HOHirotaka Oshima
Hirotaka Oshima
SSShintaro Sato
Shintaro Sato
KFKeisuke Fujii
Keisuke Fujii
Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited scalability of current near-term algorithms. Meanwhile, assuming a typical architecture for fault-tolerant quantum computing (FTQC), realistic applications inevitably require a vast number of qubits, typically exceeding 10 6 , which seems far beyond near-term realization. In this work, to bridge the gap between the NISQ and FTQC eras, we propose an alternative approach to achieve practical quantum advantages on early-FTQC devices. Our framework is based on partially fault-tolerant logical operations to minimize spatial overhead and avoids the costly distillation techniques typically required for executing non-Clifford gates. To this end, we develop a space-time efficient state preparation protocol to generate an ancillary non-Clifford state consumed for implementing an analog rotation gate with an arbitrary small angle θ and a remarkably low worst-case error rate below O ( | θ | p ph ) , where p ph is the physical error rate. Furthermore, we propose several error suppression schemes tailored to our preparation protocol, which are essential to minimize the overhead for mitigating errors. Based on this framework, we present several promising applications that leverage the potential of our framework, including the Trotter simulation and quantum phase estimation (QPE). Notably, we demonstrate that our framework allows us to perform the QPE for an ( 8 × 8 ) -site Hubbard model with fewer than 6.8 × 10 4 qubits and an execution time of 10.6 days (or 14 min with full parallelization) under p ph = 10 − 4 , which is significantly faster than recent classical estimation with tensor network techniques (density matrix renormalization group and projected entangled pair states).

20 November 2023 in Quantum
Verified
Journal Article
Open access
PDF file
TKTomochika Kurita
Tomochika Kurita
HQHammam Qassim
Hammam Qassim
MIMasatoshi Ishii
Masatoshi Ishii
HOHirotaka Oshima
Hirotaka Oshima
SSShintaro Sato
Shintaro Sato
JEJoseph Emerson
Joseph Emerson
We propose a quantum error mitigation strategy for the variational quantum eigensolver (VQE) algorithm. We find, via numerical simulation, that very small amounts of coherent noise in VQE can cause substantially large errors that are difficult to suppress by conventional mitigation methods, and yet our proposed mitigation strategy is able to significantly reduce these errors. The proposed strategy is a combination of previously reported techniques, namely randomized compiling (RC) and zero-noise extrapolation (ZNE). Intuitively, randomized compiling turns coherent errors in the circuit into stochastic Pauli errors, which facilitates extrapolation to the zero-noise limit when evaluating the cost function. Our numerical simulation of VQE for small molecules shows that the proposed strategy can mitigate energy errors induced by various types of coherent noise by up to two orders of magnitude.

8 November 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
JFJun Fujisaki
Jun Fujisaki
HOHirotaka Oshima
Hirotaka Oshima
SSShintaro Sato
Shintaro Sato
KFKeisuke Fujii
Keisuke Fujii
Quantum error correction is one of the most important milestones for the realization of large-scale quantum computation. To achieve this, it is essential not only to integrate a large number of qubits with high fidelity but also to build a scalable classical system that can perform error correction. Here, we propose an efficient and scalable decoder for quantum error correction using “Fujitsu Digital Annealer” (DA). Specifically, the error correction problem of stabilizer codes is mapped into an Ising-type optimization problem, so-called quadratic unconstrained binary optimization (QUBO) problem, which is solved by DA. In particular, we implement the proposed DA decoder for the surface code and perform detailed numerical experiments for various code distances to see its performance and scalability. We observe that computational scaling for the DA decoder has a lower order of polynomials than the decoding methods using simulated annealing (SA) and minimum-weight perfect matching (MWPM) algorithm under all tested conditions. It is also shown that the DA decoder has advantages over the Union-Find (UF) decoder from a variety of perspectives including hardware implementation. Furthermore, the threshold behavior of the logical error probability for the DA decoder is analyzed and the resultant threshold lies between 9.4% and 9.8%, which is very close to that obtained by the MWPM decoder. This result clearly shows the high potential of the DA decoder for quantum error correction.

28 October 2025 in PRX Quantum
Verified
Journal Article
Open access
YAYutaro Akahoshi
Yutaro Akahoshi
RTRiki Toshio
Riki Toshio
JFJun Fujisaki
Jun Fujisaki
HOHirotaka Oshima
Hirotaka Oshima
SSShintaro Sato
Shintaro Sato
KFKeisuke Fujii
Keisuke Fujii
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 computing architecture called “space-time efficient analog rotation quantum computing architecture” (STAR architecture) been recently been proposed. This architecture focuses on minimizing resource requirements while maximizing the precision of non-Clifford gates, essential for universal quantum computation. However, nondeterministic processes such as the repeat-until-success (RUS) protocol and state injection can introduce significant computational overhead. Therefore, optimizing the logical circuit to minimize this overhead by using efficient fault-tolerant operations is essential. This paper presents an efficient method for simulating the time evolution of the two-dimensional (2D) Hubbard-model Hamiltonian, a promising application of the STAR architecture. We present two techniques, the parallel-injection protocol and adaptive injection-region updating, to reduce unnecessary time overhead specific to our architecture. By integrating these with the existing fermionic (f) technique, we develop an efficient Trotter-based time-evolution operation for the 2D Hubbard model. Our analysis reveals an acceleration of over 10 times compared to naive serial compilation. Based on this optimized compilation, we estimate the computational resources required for the quantum phase estimation of the 2D Hubbard model. For devices with a physical error rate of p phys = 10 − 4 , we estimate that approximately 6.2 × 10 4 physical qubits are required to achieve faster ground-state energy estimation of the 8 × 8 Hubbard model compared to classical computation.

1 June 2015 in IEEE Transactions on Magnetics
Verified
Journal Article
Closed access
AFAtsushi Furuya
Atsushi Furuya
JFJun Fujisaki
Jun Fujisaki
KSKoichi Shimizu
Koichi Shimizu
YUYuji Uehara
Yuji Uehara
TATadashi Ataka
Tadashi Ataka
HOHirotaka Oshima
Hirotaka Oshima
We report an acceleration method for evaluating the coercivity and the M-H curve of a magnetic material based on micromagnetic simulation. To avoid stability constraint of explicit schemes, we examine a semi-implicit integration for the steepest descent method to find the local minimum state. The present method is applied to simulate a magnetization reversal process in the simplified microstructure of permanent magnets, and a major improvement of calculation speed is achieved to simulate the M-H curve of permanent magnets correctly.