Hajime Nakamura
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hajime Nakamura has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Shu Kanno
Science and Innovation Center, Mitsubishi Chemical Corporation, Yokohama, Japan
3 shared publications - Miho Hatanaka
Faculty of Science and Technology, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Japan
2 shared publications - Naoki Yamamoto
Keio University
2 shared publications - Qi Gao
Mitsubishi Chemical Corporation, Science & Innovation Center, Yokohama, Japan
2 shared publications Shigeki Gocho
Quantum Computing Center, Keio University, Yokohama, Japan
2 shared publicationsEtsuko Harada
University of Tsukuba, Tennodai, Tsukuba-shi, Ibaraki, Japan
1 shared publication
Latest Publications
- Open Access
- 15 May 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (5)
Tensor-based phase difference estimation on time-series analysis
We propose a phase-difference-estimation algorithm based on tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy with a quantum-phase-estimation- (QPE) type algorithm. Using tensor networks, we construct circuits composed solely of nearest-neighbor gates and extract time-evolution data with four-type circuit measurements. In addition, to enhance the accuracy of the time-evolution and state-preparation circuits, we propose techniques based on algorithmic error mitigation and on iterative circuit optimization combined with merging into matrix product states, respectively. Verification using a noiseless simulator for the eight-qubit one-dimensional Hubbard model using an ancilla qubit shows that the proposed algorithm achieves accuracies with 0.4%–4.7% error from a true energy gap with an appropriate time-step size and that accuracy improvements due to the algorithmic error mitigation are observed. We also confirm the enhancement of the overlap with matrix product states through iterative optimization. Finally, the proposed algorithm is demonstrated on IBM Heron devices with Q-CTRL error suppression for 8-, 36-, and 52-qubit models using more than 4000 2-qubit gates. These largest-scale demonstrations for the QPE-type algorithm represent significant progress not only toward practical applications of near-term quantum computing but also toward preparation for the era of error-corrected quantum devices.
- 15 May 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (5)
Open AccessTensor-based phase difference estimation on time-series analysis
We propose a phase-difference-estimation algorithm based on tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy with a quantum-phase-estimation- (QPE) type algorithm. Using tensor networks, we construct circuits composed solely of nearest-neighbor gates and extract time-evolution data with four-type circuit measurements. In addition, to enhance the accuracy of the time-evolution and state-preparation circuits, we propose techniques based on algorithmic error mitigation and on iterative circuit optimization combined with merging into matrix product states, respectively. Verification using a noiseless simulator for the eight-qubit one-dimensional Hubbard model using an ancilla qubit shows that the proposed algorithm achieves accuracies with 0.4%–4.7% error from a true energy gap with an appropriate time-step size and that accuracy improvements due to the algorithmic error mitigation are observed. We also confirm the enhancement of the overlap with matrix product states through iterative optimization. Finally, the proposed algorithm is demonstrated on IBM Heron devices with Q-CTRL error suppression for 8-, 36-, and 52-qubit models using more than 4000 2-qubit gates. These largest-scale demonstrations for the QPE-type algorithm represent significant progress not only toward practical applications of near-term quantum computing but also toward preparation for the era of error-corrected quantum devices.
- Open Access
- 6 June 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-13
Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.
- 6 June 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-13
Open AccessQuantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.
- Open Access
- 21 January 2023
- Published by Springer Nature in npj Computational Materials
- Vol. 9 (1) , 1-9
Excited state calculations using variational quantum eigensolver with spin-restricted ansätze and automatically-adjusted constraints
The ground and excited state calculations at key geometries, such as the Frank–Condon (FC) and the conical intersection (CI) geometries, are essential for understanding photophysical properties. To compute these geometries on noisy intermediate-scale quantum devices, we proposed a strategy that combined a chemistry-inspired spin-restricted ansatz and a new excited state calculation method called the variational quantum eigensolver under automatically-adjusted constraints (VQE/AC). Unlike the conventional excited state calculation method, called the variational quantum deflation, the VQE/AC does not require the pre-determination of constraint weights and has the potential to describe smooth potential energy surfaces. To validate this strategy, we performed the excited state calculations at the FC and CI geometries of ethylene and phenol blue at the complete active space self-consistent field (CASSCF) level of theory, and found that the energy errors were at most 2 kcal mol−1 even on the ibm_kawasaki device.
- 21 January 2023
- Published by Springer Nature in npj Computational Materials
- Vol. 9 (1) , 1-9
Open AccessExcited state calculations using variational quantum eigensolver with spin-restricted ansätze and automatically-adjusted constraints
The ground and excited state calculations at key geometries, such as the Frank–Condon (FC) and the conical intersection (CI) geometries, are essential for understanding photophysical properties. To compute these geometries on noisy intermediate-scale quantum devices, we proposed a strategy that combined a chemistry-inspired spin-restricted ansatz and a new excited state calculation method called the variational quantum eigensolver under automatically-adjusted constraints (VQE/AC). Unlike the conventional excited state calculation method, called the variational quantum deflation, the VQE/AC does not require the pre-determination of constraint weights and has the potential to describe smooth potential energy surfaces. To validate this strategy, we performed the excited state calculations at the FC and CI geometries of ethylene and phenol blue at the complete active space self-consistent field (CASSCF) level of theory, and found that the energy errors were at most 2 kcal mol−1 even on the ibm_kawasaki device.
- Open Access
- 30 August 2011
- Published by Association for Computing Machinery (ACM)
- p. 177-180
Field study of a waiting-time filler delivery system
As the variety of mobile services increases, the uses of mobile communications become more diverse and the control of service quality from a user experience perspective becomes increasingly important in mobile service design. The quality of the network is one of the critical factors determining mobile service quality. However, quality has mainly been evaluated in objective physical terms, such as delay reduction and increased bandwidth. It is less common to use a human-centered design viewpoint to improve network performance. In this paper, we discuss a waiting-time filler delivery system that actively addresses the human factor to improve the subjective quality of a mobile network. The main contribution of this paper is to quantitatively show the effect of time fillers on waiting. Field experiments show that time fillers can significantly decrease user dissatisfaction with waiting, but that this effect is strongly influenced by user preferences concerning content.
- 30 August 2011
- Published by Association for Computing Machinery (ACM)
- p. 177-180
Open AccessField study of a waiting-time filler delivery system
As the variety of mobile services increases, the uses of mobile communications become more diverse and the control of service quality from a user experience perspective becomes increasingly important in mobile service design. The quality of the network is one of the critical factors determining mobile service quality. However, quality has mainly been evaluated in objective physical terms, such as delay reduction and increased bandwidth. It is less common to use a human-centered design viewpoint to improve network performance. In this paper, we discuss a waiting-time filler delivery system that actively addresses the human factor to improve the subjective quality of a mobile network. The main contribution of this paper is to quantitatively show the effect of time fillers on waiting. Field experiments show that time fillers can significantly decrease user dissatisfaction with waiting, but that this effect is strongly influenced by user preferences concerning content.