KMKazunori Maruyama

Kazunori Maruyama

*This is an algorithmically generated author record based on publicly available information.

Kazunori Maruyama has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Mirror subspace diagonalization: a real-time quantum Krylov algorithm with near-optimal sampling cost

    by Shota Kanasugi, Yuya O. Nakagawa, Norifumi Matsumoto, Yuichiro Hidaka, Kazunori Maruyama, Hirotaka Oshima

  • Open Access

    Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition

    by Yuichiro Hidaka, Shoichiro Tsutsui, Shota Kanasugi, Norifumi Matsumoto, Kazunori Maruyama, Hirotaka Oshima

    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

    Subspace-based local compilation of variational quantum circuits for large-scale quantum many-body simulation

    by Shota Kanasugi, Yuichiro Hidaka, Yuya O. Nakagawa, Shoichiro Tsutsui, Norifumi Matsumoto, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato

    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

    Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution

    by Norifumi Matsumoto, Shoichiro Tsutsui, Yuya O. Nakagawa, Yuichiro Hidaka, Shota Kanasugi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato

    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

    Splitting and parallelizing of quantum convolutional neural networks for learning translationally symmetric data

    by Koki Chinzei, Quoc Hoan Tran, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato

    The quantum convolutional neural network (QCNN) is a promising quantum machine learning (QML) model that is expected to achieve quantum advantages in classically intractable problems. However, the QCNN requires a large number of measurements for data learning, limiting its practical applications in large-scale problems. To alleviate this requirement, we propose an architecture called split-parallelizing QCNN (sp-QCNN), which exploits the prior knowledge of quantum data to design an efficient model. This architecture draws inspiration from geometric quantum machine learning and targets translationally symmetric quantum data commonly encountered in physics and quantum computing science. By splitting the quantum circuit based on translational symmetry, the sp-QCNN can substantially parallelize the conventional QCNN without increasing the number of qubits and improve the measurement efficiency by an order of the number of qubits. To demonstrate its effectiveness, we apply the sp-QCNN to a quantum phase recognition task and show that it can achieve comparable classification accuracy to the conventional QCNN while considerably reducing the measurement resources required. Due to its high measurement efficiency, the sp-QCNN can mitigate statistical errors in estimating the gradient of the loss function, thereby accelerating the learning process. These results open up possibilities for incorporating the prior data knowledge into the efficient design of QML models, leading to practical quantum advantages. Published by the American Physical Society 2024


  • Top Cited Papers
    Open Access

    Partially Fault-Tolerant Quantum Computing Architecture with Error-Corrected Clifford Gates and Space-Time Efficient Analog Rotations

    by Yutaro Akahoshi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii

    Quantum computers are expected to drastically accelerate certain computing tasks versus classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually becoming available, but it is still challenging to achieve useful quantum advantages in meaningful tasks. On the other hand, full fault-tolerant quantum computing (FTQC) based on quantum error correction code remains far beyond realization due to its extremely large requirement of high-precision physical qubits. In this study, we propose a quantum computing architecture to close the gap between NISQ and FTQC architectures. Our architecture is based on erroneous arbitrary rotation gates and error-corrected Clifford gates implemented by lattice surgery. We omit the typical distillation protocol to achieve direct analog rotations and small qubit requirements, and minimize the remnant errors of the rotations by a carefully designed state injection protocol. Our estimation based on numerical simulations shows that for early-FTQC devices that consist of 104 physical qubits with physical error probability p=10−4, we can perform roughly 1.72×107 Clifford operations and 3.75×104 arbitrary rotations on 64 logical qubits. Such computations cannot be realized by the existing NISQ and FTQC architectures on the same device, as well as classical computers. We hope that our proposal and the corresponding development of quantum algorithms based on it will bring new insights into the realization of practical quantum computers in the future.


  • Open Access

    Quantum error correction with an Ising machine under circuit-level noise

    by Jun Fujisaki, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato, Tatsuya Sakashita, Yusaku Takeuchi, Keisuke Fujii

    Efficient decoding to estimate error locations from outcomes of syndrome measurements is the prerequisite for quantum error correction. Decoding in the presence of circuit-level noise including measurement errors should be considered in case of actual quantum computing devices. In this paper, we develop a decoder for circuit-level noise that solves the error estimation problems as Ising-type optimization problems. We confirm that the threshold theorem in the surface code under circuit-level noise is reproduced with an error threshold of approximately 0.4%. We also demonstrate the advantage of the decoder through which the Y error detection rate can be improved compared with other matching-based decoders. Our results reveal that a lower logical error rate can be obtained using our algorithm compared with that of the minimum-weight perfect matching algorithm.


  • Open Access

    Computation of Green's function by local variational quantum compilation

    by Shota Kanasugi, Shoichiro Tsutsui, Yuya O. Nakagawa, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato

    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 4×4 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

    Emission Spectra and Morphology of Carbon Films by ECR Plasma CVD

    by Kazunori Maruyama, Kiichiro Kamata, Tohru Inoue, Isao Tanabe


  • Rapid formation of TiO2 films by a conventional CVD method

    by Kiichiro Kamata, Kazunori Maruyama, Seiki Amano, Hiroyuki Fukazawa