Shu Kanno
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shu Kanno has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Naoki Yamamoto
Keio University
6 shared publications Rei Sakuma
JSR Corporation
5 shared publications- Kenji Sugisaki
Quantum Computing Center, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Yokohama, Kanagawa 223-8522, Japan
4 shared publications - Hajime Nakamura
Quantum Computing Center, Keio University, Yokohama, Japan
3 shared publications - Qi Gao
Mitsubishi Chemical Corporation, Science & Innovation Center, Yokohama, Japan
3 shared publications - Suguru Endo
NTT Computer and Data Science Laboratories, NTT Corporation, Musashino 180-8585, Japan
3 shared publications
Latest Publications
- Open Access
- 9 July 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 66  (14) , 8439-8451
Quantum Computing Calculations of Protein–Ligand Binding Energies Using Decomposition Methods on Simulated and Real Quantum Hardware
We analyzed the performance of quantum algorithms for studying protein–ligand systems, using both simulator and real hardware. To achieve this, we selected thrombin and 5 ligands as a test case and employed a decomposition strategy using density matrix embedded theory, dividing the ligand systems into three fragments each. First, the energy of one of the fragments was calculated using the Variational Quantum Eigensolver (VQE) using a state vector simulator, while the energy of the remaining fragments was calculated using Couple Cluster Singles and Doubles (CCSD), with the protein treated as point charges located at the respective atomic sites. Through these noiseless simulations, we evaluated the results under ideal conditions using the state-of-the-art Unitary CCSD ansatz to validate the efficacy of the strategy in a controlled setting without quantum noise. Subsequently, we evaluated the impact of approximations in the ansatz, optimizer, and active space size, which are necessary to decrease the computational cost, in order to target real hardware during the current Noisy Intermediate-Scale Quantum era. Finally, we performed the VQE calculations using a superconducting quantum computer developed by the RIKEN RQC–Fujitsu Collaboration Center and also analyzed the noise effect through simulations. The results demonstrated that the use of quantum algorithms can enhance the binding energy correlation value, offering potential applications in the workflow of computer-aided drug design.
- 9 July 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 66  (14) , 8439-8451
Open AccessQuantum Computing Calculations of Protein–Ligand Binding Energies Using Decomposition Methods on Simulated and Real Quantum Hardware
We analyzed the performance of quantum algorithms for studying protein–ligand systems, using both simulator and real hardware. To achieve this, we selected thrombin and 5 ligands as a test case and employed a decomposition strategy using density matrix embedded theory, dividing the ligand systems into three fragments each. First, the energy of one of the fragments was calculated using the Variational Quantum Eigensolver (VQE) using a state vector simulator, while the energy of the remaining fragments was calculated using Couple Cluster Singles and Doubles (CCSD), with the protein treated as point charges located at the respective atomic sites. Through these noiseless simulations, we evaluated the results under ideal conditions using the state-of-the-art Unitary CCSD ansatz to validate the efficacy of the strategy in a controlled setting without quantum noise. Subsequently, we evaluated the impact of approximations in the ansatz, optimizer, and active space size, which are necessary to decrease the computational cost, in order to target real hardware during the current Noisy Intermediate-Scale Quantum era. Finally, we performed the VQE calculations using a superconducting quantum computer developed by the RIKEN RQC–Fujitsu Collaboration Center and also analyzed the noise effect through simulations. The results demonstrated that the use of quantum algorithms can enhance the binding energy correlation value, offering potential applications in the workflow of computer-aided drug design.
- 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
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-13
Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement and feedback processes. The main idea is to generate the probability distribution defining a target randomized algorithm on a quantum computer, instead of a classical computer, which enables us to implement a variety of static circuits on a single dynamic circuit with many measurements. We applied the proposed method to the task of random Pauli measurement for one qubit on an IBM superconducting device, showing that a 14,000-fold acceleration of executing time was observed compared with a conventional method using static circuits. Additionally, for the problem of estimating expectation values of 28- and 40-qubit hydrogen chain models, we successfully applied the proposed method to realize the classical shadow with 10 million random circuits, which is the largest demonstration of classical shadow. This work significantly simplifies the execution of randomized algorithms on real quantum hardware.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 1-13
Open AccessEfficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement and feedback processes. The main idea is to generate the probability distribution defining a target randomized algorithm on a quantum computer, instead of a classical computer, which enables us to implement a variety of static circuits on a single dynamic circuit with many measurements. We applied the proposed method to the task of random Pauli measurement for one qubit on an IBM superconducting device, showing that a 14,000-fold acceleration of executing time was observed compared with a conventional method using static circuits. Additionally, for the problem of estimating expectation values of 28- and 40-qubit hydrogen chain models, we successfully applied the proposed method to realize the classical shadow with 10 million random circuits, which is the largest demonstration of classical shadow. This work significantly simplifies the execution of randomized algorithms on real quantum hardware.
- Open Access
- 13 January 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11  (1)
Optimizing a parameterized controlled gate using free quaternion selection
In variational quantum algorithms, parameterization is typically applied to single-qubit gates. In this study, we instead parameterize a generalized controlled gate and propose an algorithm to locally minimize the cost function by maximally optimizing these parameters. This method extends the Free Quaternion Selection (FQS) technique, which was originally developed for singlequbit gate optimization. To evaluate its performance, we apply the proposed method to a variety of quantum optimization tasks, including the Variational Quantum Eigensolver (VQE) for both Ising and molecular Hamiltonians, fidelity maximization in general variational quantum algorithms (VQAs), and unitary compilation of time evolution operators. Across these applications, our method demonstrates efficient optimization, enhanced expressibility, and the ability to construct shallower circuits compared to existing techniques. Moreover, the method can be generalized to optimize particle-number-conserving gates, which are particularly relevant for quantum chemistry. Leveraging this capability, we further demonstrate that the method achieves superior quantum compilation of molecular time-evolution operators by approximating them with shallower circuits than standard Trotter decomposition.
- 13 January 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11  (1)
Open AccessOptimizing a parameterized controlled gate using free quaternion selection
In variational quantum algorithms, parameterization is typically applied to single-qubit gates. In this study, we instead parameterize a generalized controlled gate and propose an algorithm to locally minimize the cost function by maximally optimizing these parameters. This method extends the Free Quaternion Selection (FQS) technique, which was originally developed for singlequbit gate optimization. To evaluate its performance, we apply the proposed method to a variety of quantum optimization tasks, including the Variational Quantum Eigensolver (VQE) for both Ising and molecular Hamiltonians, fidelity maximization in general variational quantum algorithms (VQAs), and unitary compilation of time evolution operators. Across these applications, our method demonstrates efficient optimization, enhanced expressibility, and the ability to construct shallower circuits compared to existing techniques. Moreover, the method can be generalized to optimize particle-number-conserving gates, which are particularly relevant for quantum chemistry. Leveraging this capability, we further demonstrate that the method achieves superior quantum compilation of molecular time-evolution operators by approximating them with shallower circuits than standard Trotter decomposition.
- 2 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113  (1)
Quantum-phase-estimation-based filtering: Performance analysis and application to low-energy spectral calculations
- 2 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113  (1)
Quantum-phase-estimation-based filtering: Performance analysis and application to low-energy spectral calculations
- Top Cited PapersOpen Access
- 3 September 2025
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 27  (38) , 20869-20884
Hamiltonian simulation-based quantum-selected configuration interaction for large-scale electronic structure calculations with a quantum computer
HSB-QSCI samples important Slater determinants from quantum states obtained via real-time evolution of approximate wave functions, removing the need to prepare high-quality initial states required in conventional QSCI.
- 3 September 2025
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 27  (38) , 20869-20884
Top Cited PapersOpen AccessHamiltonian simulation-based quantum-selected configuration interaction for large-scale electronic structure calculations with a quantum computer
HSB-QSCI samples important Slater determinants from quantum states obtained via real-time evolution of approximate wave functions, removing the need to prepare high-quality initial states required in conventional QSCI.
- Open Access
- 24 July 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122  (30)
Tensor-based quantum phase difference estimation for large-scale demonstration
We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous Quantum phase estimation (QPE) demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique toward molecular executions using spatial orbital localization and index sorting, verified linear polyene simulations up to 21 qubits. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices.
- 24 July 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122  (30)
Open AccessTensor-based quantum phase difference estimation for large-scale demonstration
We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous Quantum phase estimation (QPE) demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique toward molecular executions using spatial orbital localization and index sorting, verified linear polyene simulations up to 21 qubits. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices.
- Open Access
- 30 April 2025
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 10  (18) , 18332-18337
Resource Estimates for Excited-State Calculations of Diarylethenes on Fault-Tolerant Photonic Quantum Computers
- 30 April 2025
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 10  (18) , 18332-18337
Open AccessResource Estimates for Excited-State Calculations of Diarylethenes on Fault-Tolerant Photonic Quantum Computers
- 23 August 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110  (2) , 022618
Entanglement-assisted phase-estimation algorithm for calculating dynamical response functions
Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE), where the energy spectra are directly extracted from the QPE measurement outcomes in the frequency domain. Accurate estimation of excitation energies and transition probabilities with these QPE-based approaches is, however, challenging because of the problem of spectral leakage (or peak broadening) which is inherent in the QPE algorithm. To overcome this issue, in this work we consider an extension of the QPE-based approach adopting the optimal entangled input states, which is known to achieve the Heisenberg-limited scaling for the estimation precision. We show that with this method the peaks in the calculated energy spectra are more localized than those calculated by the original QPE-based approaches, suggesting the mitigation of the spectral leakage problem. By analyzing the probability distribution with the entangled phase estimation, we propose a simple scheme to better estimate both the transition energies and the corresponding transition probabilities of the peaks of interest in the spectra. The validity of our prescription is demonstrated by numerical simulations in various quantum many-body problems: the spectral function of a simple electron-plasmon model in condensed-matter physics, the dipole transitions of the molecule in quantum chemistry, and the electromagnetic transitions of the nucleus in nuclear physics.- 23 August 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110  (2) , 022618
Entanglement-assisted phase-estimation algorithm for calculating dynamical response functions
Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE), where the energy spectra are directly extracted from the QPE measurement outcomes in the frequency domain. Accurate estimation of excitation energies and transition probabilities with these QPE-based approaches is, however, challenging because of the problem of spectral leakage (or peak broadening) which is inherent in the QPE algorithm. To overcome this issue, in this work we consider an extension of the QPE-based approach adopting the optimal entangled input states, which is known to achieve the Heisenberg-limited scaling for the estimation precision. We show that with this method the peaks in the calculated energy spectra are more localized than those calculated by the original QPE-based approaches, suggesting the mitigation of the spectral leakage problem. By analyzing the probability distribution with the entangled phase estimation, we propose a simple scheme to better estimate both the transition energies and the corresponding transition probabilities of the peaks of interest in the spectra. The validity of our prescription is demonstrated by numerical simulations in various quantum many-body problems: the spectral function of a simple electron-plasmon model in condensed-matter physics, the dipole transitions of the molecule in quantum chemistry, and the electromagnetic transitions of the nucleus in nuclear physics.- 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.