arXiv subjects

Mikio Morita

Publications and source records attributed to Mikio Morita.

3 recordsLinked to original sources

arXiv2024

Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster

Advances in quantum simulator technology is increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially with respect to the number of qubits; furthermore, in a variational quantum algorithm, the large number of repeated runs by classical optimization is also a heavy load. This problem has been addressed by preparing numerous computing nodes or simulation frameworks that work effectively. This study aimed to accelerate quantum simulation using two newly proposed methods: to efficiently utilize limited computational resources by adjusting the ratio of the MPI and distributed processing parallelism corresponding to the target problem settings and to slim down the Hamiltonian by considering the effect of accuracy on the calculation result. Ground-state energy calculations of fermionic model were performed using variational quantum eigensolver (VQE) on an HPC cluster with up to 1024 FUJITSU Processor A64FX connected to each other by InfiniBand; the processor is also used on supercomputer Fugaku. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time. This result indicates that > 30 qubit state vector simulations can be realistically utilized to further research on variational quantum algorithms.

quant-ph↗

arXiv2023

Towards Accurate Quantum Chemical Calculations on Noisy Quantum Computers

Variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for noisy intermediate-scale quantum (NISQ) computers. It is promising for quantum chemical calculations (QCC) because it can calculate the ground-state energy of a target molecule. Although VQE has a potential to achieve a higher accuracy than classical approximation methods in QCC, it is challenging to achieve it on current NISQ computers due to the significant impact of noises. Density matrix embedding theory (DMET) is a well-known technique to divide a molecule into multiple fragments, which is available to mitigate the noise impact on VQE. However, our preliminary evaluation shows that the naive combination of DMET and VQE does not outperform a gold standard classical method. In this work, we present three approaches to mitigate the noise impact for the DMET+VQE combination. (1) The size of quantum circuits used by VQE is decreased by reducing the number of bath orbitals which represent interactions between multiple fragments in DMET. (2) Reduced density matrices (RDMs), which are used to calculate a molecular energy in DMET, are calculated accurately based on expectation values obtained by executing quantum circuits using a noise-less quantum computer simulator. (3) The parameters of a quantum circuit optimized by VQE are refined with mathematical post-processing. The evaluation using a noisy quantum computer simulator shows that our approaches significantly improve the accuracy of the DMET+VQE combination. Moreover, we demonstrate that on a real NISQ device, the DMET+VQE combination applying our three approaches achieves a higher accuracy than the gold standard classical method.

quant-ph↗

arXiv2022

Pauli String Partitioning Algorithm with the Ising Model for Simultaneous Measurement

We propose an efficient algorithm for partitioning Pauli strings into subgroups, which can be simultaneously measured in a single quantum circuit. Our partitioning algorithm drastically reduces the total number of measurements in a variational quantum eigensolver for a quantum chemistry, one of the most promising applications of quantum computing. The algorithm is based on the Ising model optimization problem, which can be quickly solved using an Ising machine. We develop an algorithm that is applicable to problems with sizes larger than the maximum number of variables that an Ising machine can handle ($n_\text{bit}$) through its iterative use. The algorithm has much better time complexity and solution optimality than other algorithms such as Boppana--Halldórsson algorithm and Bron--Kerbosch algorithm, making it useful for the quick and effective reduction of the number of quantum circuits required for measuring the expectation values of multiple Pauli strings. We investigate the performance of the algorithm using the second-generation Digital Annealer, a high-performance Ising hardware, for up to $65,535$ Pauli strings using Hamiltonians of molecules and the full tomography of quantum states. We demonstrate that partitioning problems for quantum chemical calculations can be solved with a time complexity of $O(N)$ for $N\leq n_\text{bit}$ and $O(N^2)$ for $N>n_\text{bit}$ for the worst case, where $N$ denotes the number of candidate Pauli strings and $n_\text{bit}=8,192$ for the second-generation Digital Annealer used in this study. The reduction factor, which is the number of Pauli strings divided by the number of obtained partitions, can be $200$ at maximum.

quant-ph↗