Shoichiro Tsutsui
Research Subjects
Shoichiro Tsutsui has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Hirotaka Oshima
Quantum Laboratory, Fujitsu Research, Fujitsu Limited, Kawasaki, Japan
4 shared publications - Kazunori Maruyama
Quantum Laboratory, Fujitsu Research, Fujitsu Limited, 4-1-1 Kawasaki, Kanagawa 211-8588, Japan
4 shared publications - Shota Kanasugi
Department of Physics, Kyoto University, Kyoto 606-8502, Japan
4 shared publications - Norifumi Matsumoto
Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan
3 shared publications Yuichiro Hidaka
QunaSys
3 shared publications- Yuya O. Nakagawa
QunaSys Inc., Aqua Hakusan Building 9F, 1-13-7 Hakusan, Bunkyo, Tokyo 113-0001, Japan
3 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition
We study the Hamiltonian algebra of qubit-mapped interacting fermion models and their fast-forwardability. We prove that the dimension of the Hamiltonian algebra of the fermion model with single-site Coulomb interaction is bounded from below by the exponential function of the number of sites, and the circuit depth of the Cartan-based fast-forwarding method for such a model also exhibits the same scaling. We apply this proposition to the Anderson impurity model and the Hubbard model and show that the dimension of the Hamiltonian algebra of these models scales exponentially with the number of sites. These behaviors of the Hamiltonian algebras imply that, under fermion-qubit mappings that map Majorana operators to single-term Pauli strings, the qubit models obtained from these fermion models cannot be efficiently simulated using the Cartan-based fast-forwarding method.
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3)
Open AccessFast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition
We study the Hamiltonian algebra of qubit-mapped interacting fermion models and their fast-forwardability. We prove that the dimension of the Hamiltonian algebra of the fermion model with single-site Coulomb interaction is bounded from below by the exponential function of the number of sites, and the circuit depth of the Cartan-based fast-forwarding method for such a model also exhibits the same scaling. We apply this proposition to the Anderson impurity model and the Hubbard model and show that the dimension of the Hamiltonian algebra of these models scales exponentially with the number of sites. These behaviors of the Hamiltonian algebras imply that, under fermion-qubit mappings that map Majorana operators to single-term Pauli strings, the qubit models obtained from these fermion models cannot be efficiently simulated using the Cartan-based fast-forwarding method.
- Open Access
- 14 October 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (10) , 1-24
On the validity of the complex Langevin method near the deconfining phase transition in QCD at finite density
A bstract: In our previous paper [1], we found that the complex Langevin (CL) method works for QCD at finite density on the 16 3 × 32 lattice in the low-temperature high-density regime within the range μ / T = 1.6 – 9.6 with μ and T being the quark chemical potential and the temperature, which enabled us to see a clear trend towards the formation of the Fermi sphere. Here we investigate the validity of the CL method on the 24 3 × 12 lattice in the deconfined phase near the deconfinement phase transition. As before, we use four-flavor staggered fermions and judge the validity using the criterion based on the probability distribution of the drift term. The spatial extent is L = (1.3 − 2.7 fm) > $$ {\Lambda}_{\textrm{LQCD}}^{-1} $$ ∼ 1 fm, in contrast to our previous study with L < $$ {\Lambda}_{\textrm{LQCD}}^{-1} $$ . We find that the CL method works in a broad region up to μ / T = 4.8, while it starts to fail as we approach the phase boundary due to the singular drift problem, which can be understood qualitatively by extending the Banks-Casher relation to the case at finite density.- 14 October 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (10) , 1-24
Open AccessOn the validity of the complex Langevin method near the deconfining phase transition in QCD at finite density
A bstract: In our previous paper [1], we found that the complex Langevin (CL) method works for QCD at finite density on the 16 3 × 32 lattice in the low-temperature high-density regime within the range μ / T = 1.6 – 9.6 with μ and T being the quark chemical potential and the temperature, which enabled us to see a clear trend towards the formation of the Fermi sphere. Here we investigate the validity of the CL method on the 24 3 × 12 lattice in the deconfined phase near the deconfinement phase transition. As before, we use four-flavor staggered fermions and judge the validity using the criterion based on the probability distribution of the drift term. The spatial extent is L = (1.3 − 2.7 fm) > $$ {\Lambda}_{\textrm{LQCD}}^{-1} $$ ∼ 1 fm, in contrast to our previous study with L < $$ {\Lambda}_{\textrm{LQCD}}^{-1} $$ . We find that the CL method works in a broad region up to μ / T = 4.8, while it starts to fail as we approach the phase boundary due to the singular drift problem, which can be understood qualitatively by extending the Banks-Casher relation to the case at finite density. - Open Access
- 24 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Subspace-based local compilation of variational quantum circuits for large-scale quantum many-body simulation
Simulation of quantum many-body systems is one of the most promising applications of quantum computers. It is crucial to efficiently implement the time-evolution operator as a quantum circuit to execute such simulations on near-term quantum computing devices with limited computational resources. However, standard approaches such as Trotterization sometimes require a deep quantum circuit, which is hard to implement on near-term quantum computers. Here, we propose a hybrid quantum-classical algorithm, called local subspace variational quantum compilation (LSVQC), for compiling the time-evolution operator of quantum many-body systems. The LSVQC performs a variational optimization to reproduce the action of the target time-evolution operator within a physically reasonable subspace. The optimization is performed for small local subsystems based on the Lieb-Robinson bound, which allows us to execute the cost function evaluation using small-scale quantum devices and/or classical computers. We demonstrate the validity of the LSVQC algorithm through numerical simulations of a simple spin-lattice model and an effective model of a parent compound of cuprate superconductors, Sr 2 CuO 3 , constructed by the downfolding method. It is shown that the LSVQC achieves a 95% reduction of the circuit depth for simulating quantum many-body dynamics compared to the Trotterization at best while maintaining the same computational accuracy. We also demonstrate that the restriction to a subspace leads to a substantial reduction of required resources and improved accuracy compared to the case of considering the entire Hilbert space. Furthermore, we estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures in the noisy intermediate-scale or early fault-tolerant quantum computing era. Our estimation suggests that the acceptable physical gate error rate for the LSVQC can be about one order of magnitude larger than that for the Trotterization.
- 24 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Open AccessSubspace-based local compilation of variational quantum circuits for large-scale quantum many-body simulation
Simulation of quantum many-body systems is one of the most promising applications of quantum computers. It is crucial to efficiently implement the time-evolution operator as a quantum circuit to execute such simulations on near-term quantum computing devices with limited computational resources. However, standard approaches such as Trotterization sometimes require a deep quantum circuit, which is hard to implement on near-term quantum computers. Here, we propose a hybrid quantum-classical algorithm, called local subspace variational quantum compilation (LSVQC), for compiling the time-evolution operator of quantum many-body systems. The LSVQC performs a variational optimization to reproduce the action of the target time-evolution operator within a physically reasonable subspace. The optimization is performed for small local subsystems based on the Lieb-Robinson bound, which allows us to execute the cost function evaluation using small-scale quantum devices and/or classical computers. We demonstrate the validity of the LSVQC algorithm through numerical simulations of a simple spin-lattice model and an effective model of a parent compound of cuprate superconductors, Sr 2 CuO 3 , constructed by the downfolding method. It is shown that the LSVQC achieves a 95% reduction of the circuit depth for simulating quantum many-body dynamics compared to the Trotterization at best while maintaining the same computational accuracy. We also demonstrate that the restriction to a subspace leads to a substantial reduction of required resources and improved accuracy compared to the case of considering the entire Hilbert space. Furthermore, we estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures in the noisy intermediate-scale or early fault-tolerant quantum computing era. Our estimation suggests that the acceptable physical gate error rate for the LSVQC can be about one order of magnitude larger than that for the Trotterization.
- Open Access
- 7 March 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
Simulating thermal-equilibrium properties at finite temperature is crucial for studying quantum many-body systems. Quantum computers are expected to enable us to simulate large systems at finite temperatures, overcoming challenges faced by classical computers, such as the sign problem of the quantum Monte Carlo technique. Conventional methods suitable for fault-tolerant quantum computing (FTQC) devices are designed for studying large-scale quantum many-body systems but require a large number of ancilla qubits and a deep quantum circuit with many basic gates, making them unsuitable for the early stage of the FTQC era, when the availability of qubits and quantum gates is limited. In this paper, we propose a method suitable for quantum devices in this early stage to calculate the thermal-equilibrium expectation value of an observable at finite temperatures. Our proposal, named the Markov chain Monte Carlo with sampled pairs of unitaries (MCMC-SPU) algorithm, involves sampling simple quantum circuits and generating the corresponding statistical ensembles. This approach addresses the issues of resource demand and the decay in probability associated with postselection of measurement outcomes on ancilla qubits. We validate our proposal with a numerical simulation of the one-dimensional transverse-field Ising model as an illustrative example.
- 7 March 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (1)
Open AccessQuantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
Simulating thermal-equilibrium properties at finite temperature is crucial for studying quantum many-body systems. Quantum computers are expected to enable us to simulate large systems at finite temperatures, overcoming challenges faced by classical computers, such as the sign problem of the quantum Monte Carlo technique. Conventional methods suitable for fault-tolerant quantum computing (FTQC) devices are designed for studying large-scale quantum many-body systems but require a large number of ancilla qubits and a deep quantum circuit with many basic gates, making them unsuitable for the early stage of the FTQC era, when the availability of qubits and quantum gates is limited. In this paper, we propose a method suitable for quantum devices in this early stage to calculate the thermal-equilibrium expectation value of an observable at finite temperatures. Our proposal, named the Markov chain Monte Carlo with sampled pairs of unitaries (MCMC-SPU) algorithm, involves sampling simple quantum circuits and generating the corresponding statistical ensembles. This approach addresses the issues of resource demand and the decay in probability associated with postselection of measurement outcomes on ancilla qubits. We validate our proposal with a numerical simulation of the one-dimensional transverse-field Ising model as an illustrative example.
- Open Access
- 17 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023290
Bias-preserving computation with the bit-flip code
We explore the feasibility of fault-tolerant quantum computation using the bit-flip repetition code in a biased noise channel where only the bit-flip error can occur. While several logic gates can potentially produce phase-flip errors even in such a channel, we propose bias-preserving implementation of , controlled- (CZ), and gates. We demonstrate that our scheme improves the computational precision in several tasks such as the time evolution of quantum systems and variational quantum eigensolver.- 17 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023290
Open AccessBias-preserving computation with the bit-flip code
We explore the feasibility of fault-tolerant quantum computation using the bit-flip repetition code in a biased noise channel where only the bit-flip error can occur. While several logic gates can potentially produce phase-flip errors even in such a channel, we propose bias-preserving implementation of , controlled- (CZ), and gates. We demonstrate that our scheme improves the computational precision in several tasks such as the time evolution of quantum systems and variational quantum eigensolver. - Open Access
- 1 August 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (3) , 033070
Computation of Green's function by local variational quantum compilation
Computation of the Green's function is crucial to study the properties of quantum many-body systems such as strongly correlated systems. Although the high-precision calculation of the Green's function is a notoriously challenging task on classical computers, the development of quantum computers may enable us to compute the Green's function with high accuracy even for classically-intractable large-scale systems. Here, we propose an efficient method to compute the real-time Green's function based on the local variational quantum compilation (LVQC) algorithm, which simulates the time evolution of a large-scale quantum system using a low-depth quantum circuit constructed through optimization on a smaller-size subsystem. Our method requires shallow quantum circuits to calculate the Green's function and can be utilized on both near-term noisy intermediate-scale and long-term fault-tolerant quantum computers depending on the computational resources we have. We perform a numerical simulation of the Green's function for the one- and two-dimensional Fermi-Hubbard model up to sites lattice (32 qubits) and demonstrate the validity of our protocol compared to a standard method based on the Trotter decomposition. We finally present a detailed estimation of the gate count for the large-scale Fermi-Hubbard model, which also illustrates the advantage of our method over the Trotter decomposition.- 1 August 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (3) , 033070
Open AccessComputation of Green's function by local variational quantum compilation
Computation of the Green's function is crucial to study the properties of quantum many-body systems such as strongly correlated systems. Although the high-precision calculation of the Green's function is a notoriously challenging task on classical computers, the development of quantum computers may enable us to compute the Green's function with high accuracy even for classically-intractable large-scale systems. Here, we propose an efficient method to compute the real-time Green's function based on the local variational quantum compilation (LVQC) algorithm, which simulates the time evolution of a large-scale quantum system using a low-depth quantum circuit constructed through optimization on a smaller-size subsystem. Our method requires shallow quantum circuits to calculate the Green's function and can be utilized on both near-term noisy intermediate-scale and long-term fault-tolerant quantum computers depending on the computational resources we have. We perform a numerical simulation of the Green's function for the one- and two-dimensional Fermi-Hubbard model up to sites lattice (32 qubits) and demonstrate the validity of our protocol compared to a standard method based on the Trotter decomposition. We finally present a detailed estimation of the gate count for the large-scale Fermi-Hubbard model, which also illustrates the advantage of our method over the Trotter decomposition. - Open Access
Density-Induced Hadron–Quark Crossover via the Formation of Cooper Triples
We discuss the hadron–quark crossover accompanied by the formation of Cooper triples (three-body counterpart of Cooper pairs) by analogy with the Bose–Einstein condensate to Bardeen–Cooper–Schrieffer crossover in two-component fermionic systems. Such a crossover is different from a phase transition, which often involves symmetry breaking. We calculate the in-medium three-body energy from the three-body T-matrix with a phenomenological three-body force characterizing a bound hadronic state in vacuum. With increasing density, the hadronic bound-state pole smoothly undergoes a crossover toward the Cooper triple phase where the in-medium three-body clusters coexist with the quark Fermi sea. The relation to the quarkyonic matter model can also be found in a natural manner.
Open AccessDensity-Induced Hadron–Quark Crossover via the Formation of Cooper Triples
We discuss the hadron–quark crossover accompanied by the formation of Cooper triples (three-body counterpart of Cooper pairs) by analogy with the Bose–Einstein condensate to Bardeen–Cooper–Schrieffer crossover in two-component fermionic systems. Such a crossover is different from a phase transition, which often involves symmetry breaking. We calculate the in-medium three-body energy from the three-body T-matrix with a phenomenological three-body force characterizing a bound hadronic state in vacuum. With increasing density, the hadronic bound-state pole smoothly undergoes a crossover toward the Cooper triple phase where the in-medium three-body clusters coexist with the quark Fermi sea. The relation to the quarkyonic matter model can also be found in a natural manner.
- Open Access
- 19 July 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (3) , 033059
Quantum hydrodynamics from local thermal pure states
We provide a pure state formulation for hydrodynamics of isolated quantum many-body systems. A pure state describing quantum systems in local thermal equilibrium is constructed, which we call a local thermal pure quantum () state. We show that the thermodynamic functional and the expectation values of local operators (including a real-time correlation function) calculated from the state converge to those from a local Gibbs ensemble in the large fluid-cell limit. As a numerical demonstration, we investigate a one-dimensional spin chain and observe the hydrodynamic relaxation obeying Fourier's law. We further prove the second law of thermodynamics and the quantum fluctuation theorem, which are also validated numerically. The formulation gives a useful theoretical basis to describe the emergent hydrodynamic behavior of quantum many-body systems furnished with a numerical efficiency applicable to both the nonrelativistic and relativistic regimes.- 19 July 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (3) , 033059
Open AccessQuantum hydrodynamics from local thermal pure states
We provide a pure state formulation for hydrodynamics of isolated quantum many-body systems. A pure state describing quantum systems in local thermal equilibrium is constructed, which we call a local thermal pure quantum () state. We show that the thermodynamic functional and the expectation values of local operators (including a real-time correlation function) calculated from the state converge to those from a local Gibbs ensemble in the large fluid-cell limit. As a numerical demonstration, we investigate a one-dimensional spin chain and observe the hydrodynamic relaxation obeying Fourier's law. We further prove the second law of thermodynamics and the quantum fluctuation theorem, which are also validated numerically. The formulation gives a useful theoretical basis to describe the emergent hydrodynamic behavior of quantum many-body systems furnished with a numerical efficiency applicable to both the nonrelativistic and relativistic regimes. - Open Access
- 1 October 2019
- Published by Elsevier in Annals of Physics
- Vol. 409, 167924
Distribution of solutions of the fastest apparent convergence condition in optimized perturbation theory and its relation to anti-Stokes lines
- 1 October 2019
- Published by Elsevier in Annals of Physics
- Vol. 409, 167924
Open AccessDistribution of solutions of the fastest apparent convergence condition in optimized perturbation theory and its relation to anti-Stokes lines