activity
20172026
most citedQuantum expectation-value estimation by computational basis sampling

31 citations · 87 across the 16 of their papers we have counts for

collaborators

16 papers

quant-ph2026

Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method

Keita Kanno, Kazumasa Ueno, Hayato Higuchi +5

Quantum computation of fluid dynamics has attracted growing attention as a key application of fault-tolerant quantum computers anticipated in the coming decade, with lattice Boltzm…

quant-ph2026

Evaluating higher-order product formulae for molecular ground-state energy estimation

Hiromu Abe, Keita Kanno, Ryosuke Kimura +2

We evaluate deterministic higher-order product formulae for molecular ground-state energy estimation. Motivated by recent fault-tolerant architectures in which non-Clifford operati…

quant-ph2026

A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method

Kazumasa Ueno, Keita Kanno, Yasunori Lee

Fluid simulations, especially at high Reynolds numbers, are computationally expensive on classical computers, making them promising application targets for quantum computing. Recen…

quant-ph2025

On universality of hardware-efficient ansatzes

Hokuto Iwakiri, Keita Kanno

The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of…

quant-ph2024

Quantum expectation value estimation by doubling the number of qubits

Hiroshi Yano, Masaya Kohda, Shoichiro Tsutsui +4

Expectation value estimation is ubiquitous in quantum algorithms. The expectation value of a Hamiltonian, which is essential in various practical applications, is often estimated b…

quant-ph2024★ 1 cited

Orbital-rotated Fermi-Hubbard model as a benchmarking problem for quantum chemistry with the exact solution

Ryota Kojima, Masahiko Kamoshita, Keita Kanno

Quantum chemistry is a key target for quantum computing, but benchmarking quantum algorithms for large molecular systems remains challenging due to the lack of exactly solvable yet…

quant-ph2023

Bias-preserving computation with the bit-flip code

Shoichiro Tsutsui, Keita Kanno

We explore the feasibility of fault-tolerant quantum computation using the bit-flip repetition code in a biased noise channel where only the bit-flip error can occur. While several…

quant-ph2023★ 1 cited

Modal analysis on quantum computers via qubitization

Yasunori Lee, Keita Kanno

Natural frequencies and normal modes are basic properties of a structure which play important roles in analyses of its vibrational characteristics. As their computation reduces to…

quant-ph2023★ 2 cited

Minimizing readout-induced noise for early fault-tolerant quantum computers

Yunzhe Zheng, Keita Kanno

Quantum error correcting code can diagnose potential errors and correct them based on measured outcomes by leveraging syndrome measurement. However, mid-circuit measurement has bee…

physics.chem-ph2023

Computational analysis of chemical reactions using a variational quantum eigensolver algorithm without specifying spin multiplicity

Soichi Shirai, Hokuto Iwakiri, Keita Kanno +4

The analysis of a chemical reaction along the ground state potential energy surface in conjunction with an unknown spin state is challenging because electronic states must be separ…

quant-ph2023★ 24 cited

Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers

Keita Kanno, Masaya Kohda, Ryosuke Imai +4

We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron…

quant-ph2023★ 2 cited

Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane

Wataru Inoue, Koki Aoyama, Yusuke Teranishi +3

We propose an efficient and almost optimal scheme for measuring molecular Hamiltonians in quantum chemistry on quantum computers, which requires distinct measurements in the…

quant-ph2021★ 31 cited

Quantum expectation-value estimation by computational basis sampling

Masaya Kohda, Ryosuke Imai, Keita Kanno +3

Measuring expectation values of observables is an essential ingredient in variational quantum algorithms. A practical obstacle is the necessity of a large number of measurements fo…

quant-ph2021★ 12 cited

Molecular Structure Optimization based on Electrons-Nuclei Quantum Dynamics Computation

Hirotoshi Hirai, Takahiro Horiba, Soichi Shirai +4

A new concept of the molecular structure optimization method based on quantum dynamics computations is presented. Nuclei are treated as quantum mechanical particles, as are electro…

hep-th2021★ 4 cited

W=0 Complex Structure Moduli Stabilization on CM-type K3 x K3 Orbifolds:---Arithmetic, Geometry and Particle Physics---

Keita Kanno, Taizan Watari

It is an important question in string compactification whether complex structure moduli stabilization inevitably ends up with a vacuum expectation value of the superpotential < W >…

hep-th2017★ 10 cited

Revisiting arithmetic solutions to the condition

Keita Kanno, Taizan Watari

The gravitino mass is expected not to be much smaller than the Planck scale for a large fraction of vacua in flux compactifications. There is no continuous parameter to tune even b…