1 citations · 1 across the 11 of their papers we have counts for
12 papers
Circuit growth and subspace read-out in quantum-selected configuration interaction: Separating the Hartree-Fock determinant
Ayaka Fujimoto, Norifumi Matsumoto, Shota Kanasugi +2
Predicting many molecular properties requires accurate ground-state energies of molecular Hamiltonians. Quantum-selected configuration interaction (QSCI) obtains such energies by m…
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.…
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…
Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime
Shota Kanasugi, Riki Toshio, Kazunori Maruyama +1
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly…
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…
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…
Mirror subspace diagonalization: A real-time quantum Krylov algorithm with near-optimal sampling cost
Shota Kanasugi, Yuya O. Nakagawa, Norifumi Matsumoto +3
Quantum Krylov algorithms are a promising approach for ground-state energy estimation on near-term quantum computers. However, their sampling cost is inherently high because each H…
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…
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…
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…
Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition
Yuichiro Hidaka, Shoichiro Tsutsui, Shota Kanasugi +3
We study the Hamiltonian algebra of qubit-mapped interacting fermion models and their fast-forwardability. We prove that the dimension of the Hamiltonian algebra of the fermion mod…
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…