Tetsuro Nikuni

Tetsuro Nikuni

Auto-generated profile, based on publicly available information

Tetsuro Nikuni

Department of Physics, Tokyo University of Science, Shinjuku, Tokyo 162-8601, Japan

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 September 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
YSYuta Shingu
Yuta Shingu
YSYuya Seki
Yuya Seki
SWShohei Watabe
Shohei Watabe
SESuguru Endo
Suguru Endo
YMYuichiro Matsuzaki
Yuichiro Matsuzaki
HHHideaki Hakoshima
Hideaki Hakoshima
A Boltzmann machine is a powerful tool for modeling probability distributions that govern the training data. A thermal equilibrium state is typically used for the Boltzmann machine learning to obtain a suitable probability distribution. The Boltzmann machine learning consists of calculating the gradient of the loss function given in terms of the thermal average, which is the most time-consuming procedure. Here, we propose a method to implement the Boltzmann machine learning by using noisy intermediate-scale quantum devices. We prepare an initial pure state that contains all possible computational basis states with the same amplitude, and we apply a variational imaginary time simulation. Readout of the state after the evolution in the computational basis approximates the probability distribution of the thermal equilibrium state that is used for the Boltzmann machine learning. We perform the numerical simulations of our scheme and confirm that the Boltzmann machine learning works well. Our scheme leads to a significant step toward an efficient machine learning using quantum hardware.

3 February 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
YSYuta Shingu
Yuta Shingu
YTYuki Takeuchi
Yuki Takeuchi
SESuguru Endo
Suguru Endo
SKShiro Kawabata
Shiro Kawabata
SWShohei Watabe
Shohei Watabe
YMYuichiro Matsuzaki
Yuichiro Matsuzaki
Variational quantum algorithms (VQAs) have been considered to be useful applications of noisy intermediate-scale quantum (NISQ) devices. Typically, in VQAs, a parametrized ansatz circuit is used to generate a trial wave function, and the parameters are optimized to minimize a cost function. On the other hand, blind quantum computing (BQC) has been studied in order to provide a quantum algorithm with security by using cloud networks. A client with a limited ability to perform quantum operations hopes to have access to a quantum computer of a server, and BQC allows the client to use the server's computer without leakage of the client's information (such as input, running quantum algorithms, and output) to the server. However, BQC is designed for fault-tolerant quantum computing, and this requires many ancillary qubits, which may not be suitable for NISQ devices. Here, we propose an efficient way to implement the NISQ computing with guaranteed security for the client. In our architecture, only N+1 qubits are required, under an assumption that the form of ansätze is known to the server, where N denotes the necessary number of the qubits in the original NISQ algorithms. The client only performs single-qubit measurements on an ancillary qubit sent from the server, and the measurement angles can specify the parameters for the ansätze of the NISQ algorithms. The no-signaling principle guarantees that neither parameters chosen by the client nor the outputs of the algorithm are leaked to the server. This work paves the way for new applications of NISQ devices.

16 April 2008 in Journal of Low Temperature Physics
Verified
Journal Article
Closed access
PDF file
YEYuki Endo
Yuki Endo
TNTetsuro Nikuni
Tetsuro Nikuni

2 April 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
YSYuta Shingu
Yuta Shingu
TNTetsuro Nikuni
Tetsuro Nikuni
SKShiro Kawabata
Shiro Kawabata
YMYuichiro Matsuzaki
Yuichiro Matsuzaki
Quantum annealing (QA) is one of the methods to prepare a ground state of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied. However, in practice, systems are known to suffer from decoherence. Meanwhile, considerable research effort has been devoted to noisy intermediate-scale quantum (NISQ) computation. For practical NISQ computation, many error-mitigation (EM) methods have been proposed to mitigate the effects of noise. This paper proposes a QA strategy combined with an EM method, namely, dual-state purification, to suppress the effects of decoherence. Our protocol consists of four parts: the conventional dynamics, single-qubit projective measurements, the Hamiltonian dynamics corresponding to an inverse map of the first dynamics, and postprocessing of the measurement results. Importantly, our protocol works without two-qubit gates that require pulse operations; hence, it is suitable for devices designed for practical QA. In addition, we present numerical calculations to show that our protocol is more accurate than the conventional QA in estimating the ground-state energy under decoherence.

6 March 2025 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
RSRei Sato
Rei Sato
CGCui Gordon
Cui Gordon
KSKazuhiro Saito
Kazuhiro Saito
HKHideyuki Kawashima
Hideyuki Kawashima
TNTetsuro Nikuni
Tetsuro Nikuni
SWShohei Watabe
Shohei Watabe
Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the problem's constraints—is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solutions, creating a significant hurdle in designing quantum circuits for large-scale TSPs. To address this issue, we propose a two-step quantum search (TSQS) algorithm that employs two sets of operators. In the first step, all the feasible solutions are amplified into their equal superposition state. In the second step, the optimal solution state is amplified from this superposition state. The TSQS algorithm demonstrates greater efficiency compared to conventional search algorithms that employ a single oracle operator for finding a solution within the encoded space. Encoded in the higher-order unconstrained binary optimization (HOBO) representation, our approach significantly reduces the qubit requirements. This enables efficient initial state preparation through a unified circuit design, offering a quadratic speedup in solving the TSP without prior knowledge of feasible solutions.

10 February 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
RSRei Sato
Rei Sato
TNTetsuro Nikuni
Tetsuro Nikuni
SWShohei Watabe
Shohei Watabe
We investigate a quantum spatial search problem on fractal lattices, such as Sierpinski carpets and Menger sponges. In earlier numerical studies of the Sierpinski gasket, the Sierpinski tetrahedron, and the Sierpinski carpet, conjectures have been proposed for the scaling of a quantum spatial search problem finding a specific target, which is given in terms of the characteristic quantities of a fractal geometry. We find that our simulation results for extended Sierpinski carpets and Menger sponges support the conjecture for the optimal number of oracle calls, where the exponent is given by 1/2 for ds>2 and the inverse of the spectral dimension ds for ds<2. We also propose a scaling hypothesis for the effective number of oracle calls defined by the ratio of the optimal number of oracle calls to a square root of the maximum finding probability. The form of the scaling hypothesis for extended Sierpinski carpets is very similar but slightly different from the earlier conjecture for the Sierpinski gasket, the Sierpinski tetrahedron, and the conventional Sierpinski carpet.