arXiv subjects

Wataru Mizukami

Publications and source records attributed to Wataru Mizukami.

At least 37 records · Page 2Linked to original sources

arXiv2024

ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction

We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian by proposing an adaptive construction of a quantum state for the quantum-selected configuration interaction (QSCI) method. QSCI allows us to select important electronic configurations in the system to perform CI calculation (subspace diagonalization of the Hamiltonian) by sampling measurement for a proper input quantum state on a quantum computer, but how we prepare a desirable input state has remained a challenge. We propose an adaptive construction of the input state for QSCI in which we run QSCI repeatedly to grow the input state iteratively. We numerically illustrate that our method, dubbed ADAPT-QSCI, can yield accurate ground-state energies for small molecules, including a noisy situation for eight qubits where error rates of two-qubit gates and the measurement are both as large as 1%. ADAPT-QSCI serves as a promising method to take advantage of current noisy quantum devices and pushes forward its application to quantum chemistry.

quant-ph↗

arXiv2024

Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation

This paper proposes two quantum operation scheduling methods for accelerating parallel state-vector-based quantum circuit simulation using multiple graphics processing units (GPUs). The proposed methods reduce all-to-all communication caused by qubit reordering (QR), which can dominate the overhead of parallel simulation. Our approach eliminates redundant QRs by introducing intentional delays in QR communications such that multiple QRs can be aggregated into a single QR. The delays are carefully introduced based on the principles of time-space tiling, or a cache optimization technique for classical computers, which we use to arrange the execution order of quantum operations. Moreover, we present an extended scheduling method for the hierarchical interconnection of GPU cluster systems to avoid slow inter-node communication. We develop these methods tailored for two primary procedures in variational quantum eigensolver (VQE) simulation: quantum state update (QSU) and expectation value computation (EVC). Experimental validation on 32-GPU executions demonstrates acceleration in QSU and EVC -- up to 54$\times$ and 606$\times$, respectively -- compared to existing methods. Moreover, our extended scheduling method further reduced communication time by up to 15\% in a two-layered interconnected cluster system. Our approach is useful for any quantum circuit simulations, including QSU and/or EVC.

quant-ph↗

arXiv2024

Universal neural network potentials as descriptors: Towards scalable chemical property prediction using quantum and classical computers

Accurate prediction of diverse chemical properties is crucial for advancing molecular design and materials discovery. Here we present a versatile approach that uses the intermediate information of a universal neural network potential as a general-purpose descriptor for chemical property prediction. Our method is based on the insight that by training a sophisticated neural network architecture for universal force fields, it learns transferable representations of atomic environments. We show that transfer learning with graph neural network potentials such as M3GNet and MACE achieves accuracy comparable to state-of-the-art methods for predicting the NMR chemical shifts of using quantum machine learning as well as a standard classical regression model, despite the compactness of its descriptors. In particular, the MACE descriptor demonstrates the highest accuracy to date on the ${^{13}}$C NMR chemical shift benchmarks for drug molecules. This work provides an efficient way to accurately predict properties, potentially accelerating the discovery of new molecules and materials.

quant-ph↗

arXiv2024

Chebyshev Approximated Variational Coupled Cluster for Quantum Computing

We propose an approach to approximately implement the variational coupled cluster (VCC) theory on quantum computers, which struggles with exponential scaling of computational costs on classical computers. To this end, we employ expanding the exponential cluster operator using Chebyshev polynomials and introduce two methods: the Chebyshev approximated VCC (C$^d$-VCC) and the Hermitian-part Chebyshev approximated VCC (HC$^d$-VCC), where $d$ indicates the maximum degree of the Chebyshev polynomials. The latter method decomposes the cluster operator into anti-Hermitian and Hermitian parts, with the anti-Hermitian part represented by the disentangled unitary coupled cluster ansatz and the Hermitian part approximated using Chebyshev expansion. We illustrate the implementation of the HC$^d$-VCC in a quantum circuit using the quantum singular value transformation technique. Numerical simulations show that the C$^d$-VCC rapidly converges to the exact VCC with increasing truncation degree $d$, and the HC$^d$-VCC effectively reduces the Chebyshev expansion error compared to the C$^d$-VCC. The HC$^d$-VCC method for realizing non-unitary coupled cluster wave functions on quantum computers is expected to be useful for initial state preparation on quantum computers and efficient tomography of the quantum state for post-processing on classical computers after quantum computations.

quant-ph↗

arXiv2024

Coupled cluster method tailored with quantum computing

Introducing an active space approximation is inevitable for the quantum computations of chemical systems. However, this approximation ignores the electron correlations related to non-active orbitals. Here, we propose a computational method for correcting quantum computing results using a well-established classical theory called coupled cluster theory. Our approach efficiently extracts the quantum state from a quantum device by computational basis tomography. The extracted expansion coefficients of the quantum state are embedded into the coupled cluster ansatz within the framework of the tailored coupled cluster method. We demonstrate the performance of our method by verifying the potential energy curves of LiH, H2O, and N2 with a correlation-energy correction scheme. Our method demonstrates reasonable potential energy curves even when the standard coupled cluster fails. The sufficient numbers of measurements for tomography were also investigated. Furthermore, this method successfully estimated the activation energy of the Cope rearrangement reaction of 1,5-hexadiene together with perturbative triples correction. These demonstrations suggest that our approach has the potential for practical quantum chemical calculations using quantum computers.

quant-ph↗

arXiv2024

Ab initio extended Hubbard model of short polyenes for efficient quantum computing

We propose introducing an extended Hubbard Hamiltonian derived via the ab initio downfolding method, which was originally formulated for periodic materials, towards efficient quantum computing of molecular electronic structure calculations. By utilizing this method, the first-principles Hamiltonian of chemical systems can be coarse-grained by eliminating the electronic degrees of freedom in higher energy space and reducing the number of terms of electron repulsion integral from $\mathcal{O}(N^4)$ to $\mathcal{O}(N^2)$. Our approach is validated numerically on the vertical excitation energies and excitation characters of ethylene, butadiene, and hexatriene. The dynamical electron correlation is incorporated within the framework of the constrained random phase approximation in advance of quantum computations, and the constructed models capture the trend of experimental and high-level quantum chemical calculation results. As expected, the $L^1$-norm of the fermion-to-qubit mapped model Hamiltonians is significantly lower than that of conventional ab initio Hamiltonians, suggesting improved scalability of quantum computing. Those numerical outcomes and the results of the simulation of excited-state sampling demonstrate that the ab initio extended Hubbard Hamiltonian may hold significant potential for quantum chemical calculations using quantum computers.

quant-ph↗

arXiv2024

Hunting for quantum-classical crossover in condensed matter problems

The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question: {\it When and how will quantum computers outperform classical computers?} The next milestone is undoubtedly the realization of quantum acceleration in practical problems. Here we provide a clear evidence and arguments that the primary target is likely to be condensed matter physics. Our primary contributions are summarized as follows: 1) Proposal of systematic error/runtime analysis on state-of-the-art classical algorithm based on tensor networks; 2) Dedicated and high-resolution analysis on quantum resource performed at the level of executable logical instructions; 3) Clarification of quantum-classical crosspoint for ground-state simulation to be within runtime of hours using only a few hundreds of thousand physical qubits for 2d Heisenberg and 2d Fermi-Hubbard models, assuming that logical qubits are encoded via the surface code with the physical error rate of $p=10^{-3}$. To our knowledge, we argue that condensed matter problems offer the earliest platform for demonstration of practical quantum advantage that is order-of-magnitude more feasible than ever known candidates, in terms of both qubit counts and total runtime.

quant-ph↗

arXiv2023

Balancing error budget for fermionic k-RDM estimation

The reduced density matrix (RDM) is crucial in quantum many-body systems for understanding physical properties, including all local physical quantity information. This study aims to minimize various error constraints that causes challenges in higher-order RDMs estimation in quantum computing. We identify the optimal balance between statistical and systematic errors in higher-order RDM estimation in particular when cumulant expansion is used to suppress the sample complexity. Furthermore, we show via numerical demonstration of quantum subspace methods for one and two dimensional Fermi Hubbard model that, biased yet efficient estimations better suppress hardware noise in excited state calculations. Our work paves a path towards cost-efficient practical quantum computing that in reality is constrained by multiple aspects of errors.

quant-ph↗

arXiv2023

Comparative study on compact quantum circuits of hybrid quantum-classical algorithms for quantum impurity models

Predicting the properties of strongly correlated materials is a significant challenge in condensed matter theory. The widely used dynamical mean-field theory faces difficulty in solving quantum impurity models numerically. Hybrid quantum--classical algorithms such as variational quantum eigensolver emerge as a potential solution for quantum impurity models. A common challenge in these algorithms is the rapid growth of the number of variational parameters with the number of spin-orbitals in the impurity. In our approach to this problem, we develop compact ansatzes using a combination of two different strategies. First, we employ compact physics-inspired ansatz, $k$-unitary cluster Jastrow ansatz, developed in the field of quantum chemistry. Second, we eliminate largely redundant variational parameters of physics-inspired ansatzes associated with bath sites based on physical intuition. This is based on the fact that a quantum impurity model with a star-like geometry has no direct hopping between bath sites. We benchmark the accuracy of these ansatzes for both ground-state energy and dynamic quantities by solving typical quantum impurity models with/without shot noise. The results suggest that we can maintain the accuracy of ground-state energy while we drop the number of variational parameters associated with bath sites. Furthermore, we demonstrate that a moment expansion, when combined with the proposed ansatzes, can calculate the imaginary-time Green's functions under the influence of shot noise. This study demonstrates the potential for addressing complex impurity models in large-scale quantum simulations with fewer variational parameters without sacrificing accuracy.

quant-ph↗

arXiv2023

A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?

Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last decade, research and development of QCs have rapidly advanced. Now hundreds of physical qubits are at our disposal, and one can find several remarkable experiments actually outperforming the classical computer in a specific computational task. On the other hand, it is unclear what the typical usages of the QCs are. Here we conduct an extensive survey on the papers that are posted in the quant-ph section in arXiv and claim to have used QCs in their abstracts. To understand the current situation of the research and development of the QCs, we evaluated the descriptive statistics about the papers, including the number of qubits employed, QPU vendors, application domains and so on. Our survey shows that the annual number of publications is increasing, and the typical number of qubits employed is about six to ten, growing along with the increase in the quantum volume (QV). Most of the preprints are devoted to applications such as quantum machine learning, condensed matter physics, and quantum chemistry, while quantum error correction and quantum noise mitigation use more qubits than the other topics. These imply that the increase in QV is fundamentally relevant, and more experiments for quantum error correction, and noise mitigation using shallow circuits with more qubits will take place.

quant-ph↗

arXiv2023

Perturbation theory with quantum signal processing

Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on quantum computers. The benefit of using quantum computers is that we can start the perturbation from a Hamiltonian that is classically hard to solve. The proposed algorithm uses quantum signal processing (QSP) to achieve this goal. Along with the perturbation theory, we construct a technique for ground state preparation with detailed computational cost analysis, which can be of independent interest. We also estimate a rough computational cost of the algorithm for simple chemical systems such as water clusters and polyacene molecules. To the best of our knowledge, this is the first of such estimates for practical applications of QSP. Unfortunately, we find that the proposed algorithm, at least in its current form, does not exhibit practical numbers despite of the efficiency of QSP compared to conventional quantum algorithms. However, perturbation theory itself is an attractive direction to explore because of its physical interpretability; it provides us insights about what interaction gives an important contribution to the properties of systems. This is in sharp contrast to the conventional approaches based on the quantum phase estimation algorithm, where we can only obtain values of energy. From this aspect, this work is a first step towards ``explainable'' quantum simulation on fault-tolerant quantum computers.

quant-ph↗

arXiv2023

Universal noise-precision relations in variational quantum algorithms

Variational quantum algorithms (VQAs) are expected to become a practical application of near-term noisy quantum computers. Although the effect of the noise crucially determines whether a VQA works or not, the heuristic nature of VQAs makes it difficult to establish analytic theories. Analytic estimations of the impact of the noise are urgent for searching for quantum advantages, as numerical simulations of noisy quantum computers on classical computers are heavy and quite limited to small scale problems. In this paper, we establish analytic estimations of the error in the cost function of VQAs due to the noise. The estimations are applicable to any typical VQAs under the Gaussian noise, which is equivalent to a class of stochastic noise models. Notably, the depolarizing noise is included in this model. As a result, we obtain estimations of the noise level to guarantee a required precision. Our formulae show how the Hessian of the cost function, the spectrum of the target operator, and the geometry of the ansatz affect the sensitivity to the noise. This insight implies trade-off relations between the trainability and the noise resilience of the cost function. We also obtain rough estimations which can be easily calculated without detailed information of the cost function. As a highlight of the applications of the formula, we propose a quantum error mitigation method which is different from the extrapolation and the probabilistic error cancellation.

quant-ph↗

arXiv2023

Analytical formulation of the second-order derivative of energy for orbital-optimized variational quantum eigensolver: application to polarizability

We develop a quantum-classical hybrid algorithm to calculate the analytical second-order derivative of the energy for the orbital-optimized variational quantum eigensolver (OO-VQE), which is a method to calculate eigenenergies of a given molecular Hamiltonian by utilizing near-term quantum computers and classical computers. We show that all quantities required in the algorithm to calculate the derivative can be evaluated on quantum computers as standard quantum expectation values without using any ancillary qubits. We validate our formula by numerical simulations of quantum circuits for computing the polarizability of the water molecule, which is the second-order derivative of the energy with respect to the electric field. Moreover, the polarizabilities and refractive indices of thiophene and furan molecules are calculated as a testbed for possible industrial applications. We finally analyze the error-scaling of the estimated polarizabilities obtained by the proposed analytical derivative versus the numerical one obtained by the finite difference. Numerical calculations suggest that our analytical derivative requires fewer measurements (runs) on quantum computers than the numerical derivative to achieve the same fixed accuracy.

physics.chem-ph↗

arXiv2023

Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers

We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an approximate ground state can be prepared on a quantum computer either by variational quantum eigensolver or by some other method. Then, by sampling the state in the computational basis, which is hard for classical computation in general, one can identify the electron configurations that are important for reproducing the ground state. The Hamiltonian in the subspace spanned by those important configurations is diagonalized on classical computers to output the ground-state energy and the corresponding eigenvector. The excited-state energies can be obtained similarly. The result is robust against statistical and physical errors because the noisy quantum devices are used only to define the subspace, and the resulting ground-state energy strictly satisfies the variational principle even in the presence of such errors. The expectation values of various other operators can also be estimated for obtained eigenstates with no additional quantum cost, since the explicit eigenvectors in the subspaces are known. We verified our proposal by numerical simulations, and demonstrated it on a quantum device for an 8-qubit molecular Hamiltonian. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits, assisted by high-performance classical computing resources for diagonalization.

quant-ph↗

arXiv2023

Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems

Current quantum computers are limited in the number of qubits and coherence time, constraining the algorithms executable with sufficient fidelity. The variational quantum eigensolver (VQE) is an algorithm to find an approximate ground state of a quantum system and is expected to work on even such a device. The deep VQE [K. Fujii, et al., arXiv:2007.10917] is an extension of the original VQE algorithm, which takes a divide-and-conquer approach to relax the hardware requirement. While the deep VQE is successfully applied for spin models and periodic material, its validity on a molecule, where the Hamiltonian is highly nonlocal in the qubit basis, is still unexplored. Here, we discuss the performance of the deep VQE algorithm applied to quantum chemistry problems. Specifically, we examine different subspaceforming methods and compare their accuracy and complexity on a 10 H-atom treelike molecule as well as a 13 H-atom version. Additionally, we examine the performance on the natural occurring molecule retinal. This work also proposes multiple methods to lower the number of qubits required to calculate the ground state of a molecule. We find that the deep VQE can simulate the electron-correlation energy of the ground state to an error of below 1%, thus helping us to reach chemical accuracy in some cases. The accuracy differences and qubits' reduction highlights the basis creation method's impact on the deep VQE.

quant-ph↗

arXiv2022

Quantifying fermionic nonlinearity of quantum circuits

Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain quantum advantage under the intrinsic noise of the NISQ devices, which deteriorates the quantumness. Here we propose a measure, called fermionic nonlinearity, to quantify the classical simulatability of quantum circuits designed for simulating fermionic Hamiltonians. Specifically, we construct a Monte Carlo type classical algorithm based on the classical simulatability of fermionic linear optics, whose sampling overhead is characterized by the fermionic nonlinearity. As a demonstration of these techniques, we calculate the upper bound of the fermionic nonlinearity of a rotation gate generated by four fermionic modes under the dephasing noise. Moreover, we estimate the sampling costs of the unitary coupled cluster singles and doubles quantum circuits for hydrogen chains subject to the dephasing noise. We find that, depending on the error probability and atomic spacing, there are regions where the fermionic nonlinearity becomes very small or unity, and hence the circuits are classically simulatable. We believe that our method and results help to design quantum circuits for fermionic systems with potential quantum advantages.

quant-ph↗

arXiv2022

Quantum expectation-value estimation by computational basis sampling

Measuring expectation values of observables is an essential ingredient in variational quantum algorithms. A practical obstacle is the necessity of a large number of measurements for statistical convergence to meet requirements of precision, such as chemical accuracy in the application to quantum chemistry computations. Here we propose an algorithm to estimate the expectation value based on its approximate expression as a weighted sum of classically-tractable matrix elements with some modulation, where the weight and modulation factors are evaluated by sampling appropriately prepared quantum states in the computational basis on quantum computers. Each of those states is prepared by applying a unitary transformation consisting of at most N CNOT gates, where N is the number of qubits, to a target quantum state whose expectation value is evaluated. Our algorithm is expected to require fewer measurements than conventional methods for a required statistical precision of the expectation value when the target quantum state is concentrated in particular computational basis states. We provide numerical comparisons of our method with existing ones for measuring electronic ground state energies (expectation values of electronic Hamiltonians for the lowest-energy states) of various small molecules. Numerical results show that our method can reduce the numbers of measurements to obtain the ground state energies for a targeted precision by several orders of magnitudes for molecules whose ground states are concentrated. Our results provide another route to measure expectation values of observables, which could accelerate the variational quantum algorithms.

quant-ph↗

arXiv2022

Solvent distribution effects on quantum chemical calculations with quantum computers

We present a combination of three-dimensional reference interaction site model self-consistent field (3D-RISM-SCF) theory and the variational quantum eigensolver (VQE) to consider the solvent distribution effects within the framework of quantum-classical hybrid computing. The present method, 3D-RISM-VQE, does not include any statistical errors from the solvent configuration sampling owing to the analytical treatment of the statistical solvent distribution. We apply 3D-RISM-VQE to compute the spatial distribution functions of solvent water around a water molecule, the potential and Helmholtz energy curves of NaCl, and to conduct Helmholtz energy component analysis of H$_2$O and NH$_4^+$. Moreover, we utilize 3D-RISM-VQE to analyze the extent to which solvent effects alter the efficiency of quantum calculations compared with calculations in the gas phase using the $L^1$-norms of molecular electronic Hamiltonians. Our results demonstrate that the efficiency of quantum chemical calculations on a quantum computer in solution is virtually the same as in the gas phase.

quant-ph↗