4 citations · 7 across the 10 of their papers we have counts for
4 papers · 2 filters
Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits
Hiroyuki Harada, Kaito Wada, Naoki Yamamoto +1
Quantum circuit cutting and knitting are divide-and-conquer methods that enable large-scale quantum computations on hardware with limited qubit resources and connectivity by decomp…
Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries
Kaito Wada, Hiroyuki Harada, Yasunari Suzuki +3
The randomized linear combination of unitaries (LCU) method with many applications to early fault-tolerant quantum computing algorithms has been proposed. This quantum algorithm co…
State-to-Hamiltonian conversion with a few copies
Kaito Wada, Jumpei Kato, Hiroyuki Harada +1
Density matrix exponentiation (DME) is a general procedure that converts an unknown quantum state into the Hamiltonian evolution. This enables state-dependent operations and can re…
Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit
Kohei Oshio, Kaito Wada, Naoki Yamamoto
Quantum amplitude estimation is one of the core subroutines in quantum algorithms. This paper gives a parallelized amplitude estimation (PAE) algorithm that simultaneously achieves…