arXiv subjects

Taichi Kosugi

Publications and source records attributed to Taichi Kosugi.

At least 37 records · Page 2Linked to original sources

arXiv2023

First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration

We propose a novel adiabatic time evolution (ATE) method for obtaining the ground state of a quantum many-electron system on a quantum circuit based on first quantization. As a striking feature of the ATE method, it consists of only unitary operations representing real-time evolution, which means that it does not require any ancillary qubits, nor controlled real-time evolution operators. Especially, we explored the first-quantized formalism of ATE method in this study, since the implementation of first-quantized real-time evolution on quantum circuits is known to be efficient. However, when realizing the ATE quantum circuit in first-quantization formalism, obstacles are how to set the adiabatic Hamiltonian and how to prepare the corresponding initial ground state. We provide a way to prepare an antisymmetrized and non-degenerate initial ground state that is suitable as an input to an ATE circuit, which allows our ATE method to be applied to systems with any number of electrons. In addition, by considering a first-quantized Hamiltonian for quantum-mechanical electron system and classical nuclear system, we design a quantum circuit for optimal structure search based on ATE. Numerical simulations are demonstrated for simple systems, and it is confirmed that the ground state of the electronic system and optimal structure can be obtained by our method.

quant-ph↗

arXiv2023

Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer

Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla qubit and forward- and backward-controlled real-time evolution operators. The ground state preparation is a challenging task even in the quantum computation, classified as complexity-class quantum Merlin-Arthur. However, optimal parameters for PITE could potentially enhance the computational efficiency to a certain degree. In this study, we analyze the computational costs of the PITE method for both linear and exponential scheduling of the imaginary-time step size for reducing the computational cost. First, we analytically discuss an error defined as the closeness between the states acted on by exact and approximate imaginary-time evolution operators. The optimal imaginary-time step size and rate of change of imaginary time are also discussed. Subsequently, the analytical discussion is validated using numerical simulations for a one-dimensional Heisenberg chain. From the results, we find that linear scheduling works well in the case of unknown eigenvalues of the Hamiltonian. For a wide range of eigenstates, the linear scheduling returns smaller errors on average. However, the linearity of the scheduling causes problems for some specific energy regions of eigenstates. To avoid these problems, incorporating a certain level of nonlinearity into the scheduling, such as by inclusion of an exponential character, is preferable for reducing the computational costs of the PITE method. The findings of this study can make a significant contribute to the field of ground-state preparation of many-body Hamiltonians on quantum computers.

quant-ph↗

arXiv2023

Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer

We propose a nonvariational scheme for geometry optimization of molecules for the first-quantized eigensolver, a recently proposed framework for quantum chemistry using the probabilistic imaginary-time evolution (PITE) on a quantum computer. While the electrons in a molecule are treated in the scheme as quantum mechanical particles, the nuclei are treated as classical point charges. We encode both electronic states and candidate molecular geometries as a superposition of many-qubit states, leading to quantum advantage. The histogram formed by outcomes of repeated measurements gives the global minimum of the energy surface. We demonstrate that the circuit depth scales as O (n_e^2 poly(log n_e)) for the electron number n_e, which can be reduced to O (n_e poly(log n_e)) if extra O (n_e log n_e) qubits are available. We corroborate the scheme via numerical simulations. The new efficient scheme will be helpful for achieving scalability of practical quantum chemistry on quantum computers. As a special case of the scheme, a classical system composed only of charged particles is admitted. We also examine the scheme adapted to variational calculations that prioritize saving circuit depths for noisy intermediate-scale quantum (NISQ) devices.

quant-ph↗

arXiv2023

Annealing for prediction of grand canonical crystal structures: Efficient implementation of n-body atomic interactions

We propose an annealing scheme usable on modern Ising machines for crystal structures prediction (CSP) by taking into account the general n-body atomic interactions, and in particular three-body interactions which are necessary to simulate covalent bonds. The crystal structure is represented by discretizing a unit cell and placing binary variables which express the existence or non-existence of an atom on every grid point. The resulting quadratic unconstrained binary optimization (QUBO) or higher-order unconstrained binary optimization (HUBO) problems implement the CSP problem and is solved using simulated and quantum annealing. Using the example of Lennard-Jones clusters we show that it is not necessary to include the target atom number in the formulation allowing for simultaneous optimization of both the particle density and the configuration and argue that this is advantageous for use on annealing machines as it reduces the total amount of interactions. We further provide a scheme that allows for reduction of higher-order interaction terms that is inspired by the underlying physics. We show for a covalently bonded monolayer MoS2 crystal that we can simultaneously optimize for the particle density as well as the crystal structure using simulated annealing. We also show that we reproduce ground states of the interatomic potential with high probability that are not represented on the initial discretization of the unit cell.

quant-ph↗

arXiv2023

Quadratic acceleration of multi-step probabilistic algorithms for state preparation

For quantum state preparation, a non-unitary operator is typically designed to decay undesirable states contained in an initial state using ancilla qubits and a probabilistic action. Probabilistic algorithms do not accelerate the computational process compared to classical ones. In this study, quantum amplitude amplification (QAA) and multi-step probabilistic algorithms are combined to achieve quadratic acceleration. This method outperforms quantum phase estimation in terms of infidelity. The quadratic acceleration was confirmed by the probabilistic imaginary-time evolution (PITE) method.

quant-ph↗

arXiv2023

First-quantized eigensolver for ground and excited states of electrons under a uniform magnetic field

First-quantized eigensolver (FQE) is a recently proposed framework of quantum computation for obtaining the ground state of an interacting electronic system based on probabilistic imaginary-time evolution. In this study, we propose a method for introducing a uniform magnetic field to an FQE calculation. We demonstrate via resource estimation that the additional circuit responsible for the magnetic field can be implemented with a liner depth in terms of the number of qubits assigned to each electron, giving rise to no impact on the leading order of whole computational cost. We confirm the validity of our method via numerical simulations for ground and excited states by employing the filtration circuits for energy eigenstates. We also provide the generic construction of derivative circuits together with measurement-based formulae. As a special case of them, we can obtain the electric-current density in an electronic system to get insights into the microscopic origin of magnetic response.

quant-ph↗

arXiv2022

Acceleration of probabilistic imaginary-time evolution method combined with quantum amplitude amplification

A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators acting on the initial state decreases as the imaginary time proceeds. To alleviate the undesirable nature, we propose quantum circuits for PITE combined with the quantum amplitude amplification (QAA) method. We reduce the circuit depth in the combined circuit with QAA by introducing a pre-amplification operator. We successfully demonstrated that the combination of PITE and QAA works efficiently and reported a case in which the quantum acceleration is achieved. Additionally, we have found that by optimizing a parameter of PITE, we can reduce the number of QAA operations and that deterministic imaginary-time evolution (deterministic ITE) can be achieved which avoids the probabilistic nature of PITE. We applied the deterministic ITE procedure to multiple imaginary-time steps and discussed the computational cost for the circuits. Finally, as an example, we demonstrate the numerical results of the PITE circuit combined with QAA in the first- and second-quantized Hamiltonians.

quant-ph↗

arXiv2022

Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions

Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently warm-start approaches have been proposed to improve the performance of QAOA, where approximate solutions are obtained by classical algorithms in advance and incorporated into the initial state and/or unitary ansatz. In this work, we study in detail how the accuracy of approximate solutions affect the performance of the warm-start QAOA (WS-QAOA). We numerically find that in typical MAX-CUT problems, WS-QAOA tends to outperform QAOA as approximate solutions become closer to the exact solutions in terms of the Hamming distance. We reveal that this could be quantitatively attributed to the initial state of the ansatz. We also solve MAX-CUT problems by WS-QAOA with approximate solutions obtained via QAOA, having a better result than QAOA especially when the circuit is relatively shallow. We believe that our study may deepen understanding of the performance of WS-QAOA and also provide a guide as to the necessary quality of approximate solutions.

quant-ph↗

arXiv2022

Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states

Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. As a kind of it, the probabilistic ITE (PITE) takes advantage of measurements to implement the nonunitary operations. We propose a new approach of PITE which requires only a single ancillary qubit. Under a practical approximation, the circuit is constructed from the forward and backward real-time evolution (RTE) gates as black boxes, generated by the original many-qubit Hamiltonian. All the efficient unitary quantum algorithms for RTE proposed so far and those in the future can thus be transferred to ITE exactly as they are. Our approach can also be used for obtaining the Gibbs state at a finite temperature and the partition function. We apply the approach to several systems as illustrative examples to see its validity. We also discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost, leading to a novel framework denoted by first-quantized quantum eigensolver.

quant-ph↗

arXiv2020

Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation

The imaginary-time evolution method is widely known to be efficient for obtaining the ground state in quantum many-body problems on a classical computer. A recently proposed quantum imaginary-time evolution method (QITE) faces problems of deep circuit depth and difficulty in the implementation on noisy intermediate-scale quantum (NISQ) devices. In this study, a nonlocal approximation is developed to tackle this difficulty. We found that by removing the locality condition or local approximation (LA), which was imposed when the imaginary-time evolution operator is converted to a unitary operator, the quantum circuit depth is significantly reduced. We propose two-step approximation methods based on a nonlocality condition: extended LA (eLA) and nonlocal approximation (NLA). To confirm the validity of eLA and NLA, we apply them to the max-cut problem of an unweighted 3-regular graph and a weighted fully connected graph; we comparatively evaluate the performances of LA, eLA, and NLA. The eLA and NLA methods require far fewer circuit depths than LA to maintain the same level of computational accuracy. Further, we developed a ``compression'' method of the quantum circuit for the imaginary-time steps as a method to further reduce the circuit depth in the QITE method. The eLA, NLA, and the compression method introduced in this study allow us to reduce the circuit depth and the accumulation of error caused by the gate operation significantly and pave the way for implementing the QITE method on NISQ devices.

quant-ph↗

arXiv2020

Charge and spin response functions on a quantum computer: applications to molecules

We propose a scheme for the construction of charge and spin linear-response functions of an interacting electronic system via quantum phase estimation and statistical sampling on a quantum computer. By using the unitary decomposition of electronic operators for avoiding the difficulty due to their non-unitarity, we provide the circuits equipped with ancillae for probabilistic preparation of qubit states on which the necessary non-unitary operators have acted. We perform simulations of such construction of the response functions for C2 and N2 molecules by comparing with the accurate ones based on the full configuration interaction calculations. It is found that the accurate detection of subtle structures coming from the weak poles in the response functions requires a large number of measurements.

quant-ph↗

arXiv2020

Construction of Green's functions on a quantum computer: applications to molecular systems

We propose a scheme for the construction of one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the non-unitarity of creation and annihilation operators for the electronic spin orbitals prevents us from preparing specific states selectively, probabilistic state preparation is demonstrated to be possible for the qubits. We provide quantum circuits equipped with at most two ancillary qubits for obtaining all the components of GF. We perform simulations of such construction of GFs for LiH and H$_2$O molecules based on the unitary coupled-cluster (UCC) method to demonstrate the validity of our scheme by comparing the spectra exact within UCC and those from full configuration interaction calculations. We also examine the accuracy of sampling method by exploiting the Galitskii--Migdal formula, which gives the total energy only from the GF.

quant-ph↗

arXiv2020

RESPACK: An ab initio tool for derivation of effective low-energy model of material

RESPACK is a first-principles calculation software for evaluating the interaction parameters of materials and is able to calculate maximally localized Wannier functions, response functions based on the random phase approximation and related optical properties, and frequency-dependent electronic interaction parameters. RESPACK receives its input data from a band-calculation code using norm-conserving pseudopotentials with plane-wave basis sets. Automatic generation scripts that convert the band-structure results to the RESPACK inputs are prepared for xTAPP and Quantum ESPRESSO. An input file for specifying the RESPACK calculation conditions is designed pursuing simplicity and is given in the Fortran namelist format. RESPACK supports hybrid parallelization using OpenMP and MPI and can treat large systems including a few hundred atoms in the calculation cell.

cond-mat.str-el↗

arXiv2019

A Parallel Computing Method for the Coupled-Cluster Singles and Doubles

In this paper, we present a parallel computing method for the coupled-cluster singles and doubles (CCSD) in periodic systems. The CCSD in periodic systems solves simultaneous equations for single-excitation and double-excitation amplitudes. In the simultaneous equations for double-excitation amplitudes, each equations are characterized by four spin orbitals and three independent momentums of electrons. One of key ideas of our method is to use process numbers in parallel computing to identify two indices which represent momentum of an electron. When momentum of an electron takes $N_{\bm{k}}$ values, $N_{\bm{k}}^2$ processes are prepared in our method. Such parallel distribution processing and way of distribution of known quantities in the simultaneous equations reduces orders of computational cost and required memory scales by $N_{\bm{k}}^2$ compared with a sequential method. In implementation of out method, communication between processes in parallel computing appears in the outmost loop in a nested loop but does not appear inner nested loop.

cond-mat.str-el↗

arXiv2019

Wannier interpolation of one-particle Green's functions from coupled-cluster singles and doubles (CCSD)

We propose two schemes for interpolation of the one-particle Green's function (GF) calculated within coupled-cluster singles and doubles (CCSD) method for a periodic system. They use Wannier orbitals for circumventing huge cost for a large number of sampled k points. One of the schemes is the direct interpolation, which obtains the GF straightforwardly by using Fourier transformation. The other is the self-energy-mediated interpolation, which obtains the GF via the Dyson equation. We apply the schemes to a LiH chain and trans-polyacetylene and examine their validity in detail. It is demonstrated that the direct-interpolated GFs suffer from numerical artifacts stemming from slow convergence of CCSD GFs in real space, while the self-energy-mediated interpolation provides more physically appropriate GFs due to the localized nature of CCSD self-energies. Our schemes are also applicable to other explicitly correlated methods capable of providing GFs.

cond-mat.mtrl-sci↗

arXiv2018

One-particle Green's function of interacting two electrons using analytic solutions for a three-body problem: comparison with exact Kohn--Sham system

For a three-electron system with finite-strength interactions confined to a one-dimensional harmonic trap, we solve the Schroedinger equation analytically to obtain the exact solutions, from which we construct explicitly the simultaneous eigenstates of the energy and total spin for the first time. The solutions for the three-electron system allow us to derive analytic expressions for the exact one-particle Green's function (GF) for the corresponding two-electron system. We calculate the GF in frequency domain to examine systematically its behavior depending on the electronic interactions. We also compare the pole structure of non-interacting GF using the exact Kohn--Sham (KS) potential with that of the exact GF to find that the discrepancy of the energy gap between the KS system and the original system is larger for a stronger interaction. We perform numerical examination on the behavior of GFs in real space to demonstrate that the exact and KS GFs can have shapes quite different from each other. Our simple model will help to understand generic characteristics of interacting GFs.

cond-mat.mes-hall↗

arXiv2018

Comparison of Green's functions for transition metal atoms using self-energy functional theory and coupled-cluster singles and doubles (CCSD)

We demonstrate in the present study that self-consistent calculations based on the self-energy functional theory (SFT) are possible for the electronic structure of realistic systems in the context of quantum chemistry. We describe the procedure of a self-consistent SFT calculation in detail and perform the calculations for isolated $3 d$ transition metal atoms from V to Cu as a preliminary study. We compare the one-particle Green's functions (GFs) obtained in this way and those obtained from the coupled-cluster singles and doubles (CCSD) method. Although the SFT calculation starts from the spin-unpolarized Hartree--Fock (HF) state for each of the target systems, the self-consistency loop correctly leads to degenerate spin-polarized ground states. We examine the spectral functions in detail to find their commonalities and differences among the atoms by paying attention to the characteristics of the two approaches. It is demonstrated via the two approaches that calculations based on the density functional theory (DFT) can fail in predicting the orbital energy spectra for spherically symmetric systems. It is found that the two methods are quite reliable and useful beyond DFT.

cond-mat.mtrl-sci↗

arXiv2018

Quasiparticle energy spectra of isolated atoms from coupled-cluster singles and doubles (CCSD): Comparison with exact CI calculations

In this study, we have calculated single-electron energy spectra via the Green's function based on the coupled-cluster singles and doubles (GFCCSD) method for isolated atoms from H to Ne. In order to check the accuracy of the GFCCSD method, we compared the results with the exact ones calculated from the full-configuration interaction (FCI). Consequently, we have found that the GFCCSD method reproduces not only the correct quasiparticle peaks but also satellite ones by comparing the exact spectra with the 6-31G basis set. It is also found that open-shell atoms such as C atom exhibit Mott gaps at the Fermi level, which the exact density-functional theory (DFT) fails to describe. The GFCCSD successfully reproduces the Mott HOMO-LUMO (highest-occupied molecular orbital and lowest-unoccupied molecular orbital) gaps even quantitatively. We also discussed the origin of satellite peaks as shake-up effects by checking the components of wave function of the satellite peaks. The GFCCSD is a novel cutting edge to investigate the electronic states in detail.

cond-mat.mtrl-sci↗