518 citations · 2.1k across the 45 of their papers we have counts for
6 papers · 1 filter
Demonstration of a quantum comparator on an ion-trap quantum device
Tatsuhiko N. Ikeda, Riku Nakama, Shunsuke Saeki +4
Quantum computers are believed to solve a class of computational problems that are based on modular arithmetic faster than classical computers. Among the arithmetic building blocks…
Explicit error bounds with commutator scaling for time-dependent product and multi-product formulas
Kaoru Mizuta, Tatsuhiko N. Ikeda, Keisuke Fujii
Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time evolution operators, is one of the central approaches for sim…
A Quantum-Resistant Photonic Hash Function
Tomoya Hatanaka, Rikuto Fushio, Masataka Watanabe +3
We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer, aiming to provide quantum-resistant security. Extensive simulations demonstrate…
Robust effective ground state in a nonintegrable Floquet quantum circuit
Tatsuhiko N. Ikeda, Sho Sugiura, Anatoli Polkovnikov
An external periodic (Floquet) drive is believed to bring any initial state to the featureless infinite temperature state in generic nonintegrable isolated quantum many-body system…
Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
Tatsuhiko N. Ikeda, Hideki Kono, Keisuke Fujii
Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computational…
Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
Tatsuhiko N. Ikeda, Asir Abrar, Isaac L. Chuang +1
When a time propagator for duration consists of two noncommuting parts , Trotterization approximately decomposes the propagator into a product of exponential…