activity
20222026
most citedPartially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations

40 citations · 98 across the 21 of their papers we have counts for

collaborators
Showing quant-phShow all

19 papers · 1 filter

quant-ph2026

Idling error suppression through gate scheduling

Hoiki Madison Liu, Kazunori Maruyama, Hirotaka Oshima +1

Achieving high-precision quantum computation requires effective suppression of idling errors that occur when qubits remain inactive during waiting periods within a quantum circuit.…

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

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-ph2025

Implementation and verification of coherent error suppression using randomized compiling for Grover's algorithm on a trapped-ion device

Masatoshi Ishii, Hammam Qassim, Tomochika Kurita +4

In near-term quantum computations that do not employ fault tolerant error correction, noise can proliferate rapidly, corrupting the quantum state and making results unreliable. The…

quant-ph2024★ 2 cited

Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution

Norifumi Matsumoto, Shoichiro Tsutsui, Yuya O. Nakagawa +5

Simulating thermal-equilibrium properties at finite temperature is crucial for studying quantum many-body systems. Quantum computers are expected to enable us to simulate large sys…

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…

quant-ph2024★ 4 cited

Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation

Shota Kanasugi, Yuichiro Hidaka, Yuya O. Nakagawa +5

Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-…

quant-ph2023

Comparative study of decoding the surface code using simulated annealing under depolarizing noise

Yusaku Takeuchi, Yugo Takada, Tatsuya Sakashita +4

We explored decoding methods for the surface code under depolarizing noise by mapping the problem into the Ising model optimization. We consider two kinds of mapping with and witho…

quant-ph2023

Quantum error correction with an Ising machine under circuit-level noise

Jun Fujisaki, Kazunori Maruyama, Hirotaka Oshima +4

Efficient decoding to estimate error locations from outcomes of syndrome measurement is the prerequisite for quantum error correction. Decoding in presence of circuit-level noise i…

quant-ph2023★ 10 cited

Splitting and Parallelizing of Quantum Convolutional Neural Networks for Learning Translationally Symmetric Data

Koki Chinzei, Quoc Hoan Tran, Kazunori Maruyama +2

The quantum convolutional neural network (QCNN) is a promising quantum machine learning (QML) model that is expected to achieve quantum advantages in classically intractable proble…

quant-ph2023★ 9 cited

Computation of Green's function by local variational quantum compilation

Shota Kanasugi, Shoichiro Tsutsui, Yuya O. Nakagawa +3

Computation of the Green's function is crucial to study the properties of quantum many-body systems such as strongly correlated systems. Although the high-precision calculation of…

quant-ph2023★ 40 cited

Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations

Yutaro Akahoshi, Kazunori Maruyama, Hirotaka Oshima +2

Quantum computers are expected to bring drastic acceleration to several computing tasks against classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have ten…

quant-ph2022★ 16 cited

Synergetic quantum error mitigation by randomized compiling and zero-noise extrapolation for the variational quantum eigensolver

Tomochika Kurita, Hammam Qassim, Masatoshi Ishii +3

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…

quant-ph2022★ 1 cited

Pauli String Partitioning Algorithm with the Ising Model for Simultaneous Measurement

Tomochika Kurita, Mikio Morita, Hirotaka Oshima +1

We propose an efficient algorithm for partitioning Pauli strings into subgroups, which can be simultaneously measured in a single quantum circuit. Our partitioning algorithm drasti…

quant-ph2022

A Practical and Scalable Decoder for Topological Quantum Error Correction with Digital Annealer

Jun Fujisaki, Hirotaka Oshima, Shintaro Sato +1

Quantum error correction is one of the most important milestones for realization of large-scale quantum computation. To achieve this, it is essential not only to integrate a large…