arXiv subjects

Hajime Nakamura

Publications and source records attributed to Hajime Nakamura.

8 recordsLinked to original sources

arXiv2026

Point-group symmetry analysis of many-electron wavefunctions on a quantum computer

A point group is a set of spatial symmetry operations in molecular systems and is an indispensable tool for analyzing molecular orbitals and spectroscopy experiments in chemistry. Several quantum algorithms to exploit this symmetry have been proposed, but practical implementations of point-group symmetry operations and the detailed symmetry analysis of realistic many-electron wavefunctions are still missing. In this work, we propose an ancilla-free hybrid method to analyze point-group symmetries of many-electron states, which works for both abelian and non-abelian groups. For a given wavefunction, our method calculates the projection weights of point-group irreducible representations by applying orbital rotations derived from the eigenvectors of the representation matrices, making it applicable to arbitrary basis functions. The usefulness of our approach is demonstrated through numerical simulations of benzene and ferrocene molecules. Furthermore, we perform a hardware demonstration of the weight calculation of the ground state and the first excited state of benzene in $D_{2h}$ symmetry, using up to 32 qubits of IBM's ibm_kawasaki device. By combining a tensor-network based encoding scheme and error mitigation techniques, we find the weights of irreducible representations for both states are faithfully reproduced within a few percent error. Our results suggest that the proposed method serves as a practical tool for analyzing symmetry properties of many-electron wavefunctions in realistic material simulations on near-term and early fault-tolerant quantum computers.

quant-ph↗

arXiv2026

Tensor-based phase difference estimation on time series analysis

We propose a phase-difference estimation algorithm based on the tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy on a quantum phase estimation (QPE)-type algorithm. Using tensor networks, we construct circuits composed solely of nearest-neighbor gates and extract time-evolution data by four-type circuit measurements. In addition, to enhance the accuracy of time-evolution and state-preparation circuits, we propose techniques based on algorithmic error mitigation and on iterative circuit optimization combined with merging into matrix product states, respectively. Verifications using a noiseless simulator for the 8-qubit one-dimensional Hubbard model using an ancilla qubit show that the proposed algorithm achieves accuracies with 0.4--4.7\% error from a true energy gap on an appropriate time-step size, and that accuracy improvements due to the algorithmic error mitigation are observed. We also confirm the enhancement of the overlap with matrix product states through iterative optimization. Finally, the proposed algorithm is demonstrated on IBM Heron devices with Q-CTRL error suppression for 8-, 36-, and 52-qubit models using more than 4,000 2-qubit gates. These largest-scale demonstrations for the QPE-type algorithm represent significant progress not only toward practical applications of near-term quantum computing but also toward preparation for the era of error-corrected quantum devices.

quant-ph↗

arXiv2025

Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation

Filtering is an important technique in quantum computing used for isolating or enhancing some specific states of quantum many-body systems. In this paper, we analyze the performance of filters based on the quantum phase estimation (QPE) algorithm, in which filtering removes states associated with bitstrings in the ancilla register above a given threshold. We show that when the conventional rectangular window function is used for the QPE input state, the resulting filter function exhibits an oscillating behavior known as the Gibbs phenomenon. We also show that in the case of the sine and Kaiser windows, this phenomenon is suppressed. Furthermore, we perform numerical simulations to compare the number of necessary queries to the Hamiltonian time evolution operation of for the QPE-based filtering algorithm and the quantum eigenvalue transformation of unitary matrices with real polynomials (QETU). We find that the number of queries required for Kaiser window-based filtering is comparable to that for QETU with optimized phase angles. As an application of the QPE-based filter, we also study a two-step algorithm for low-energy spectral simulations, composed of a coarse grid for filtering and a fine grid for obtaining final high-resolution spectra. As a benchmark of the proposed scheme for realistic continuous spectra, we present the density-of-states (DOS) calculation of antiferromagnetic type-II MnO in a one-particle approximation.

quant-ph↗

arXiv2025

Tensor-based quantum phase difference estimation for large-scale demonstration

We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous QPE demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique towards molecular executions using spatial orbital localization and index sorting, verified linear polyene simulations up to 21 qubits. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices.

quant-ph↗

arXiv2024

Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations

Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.

quant-ph↗

arXiv2022

Excited state calculations using variational quantum eigensolver with spin-restricted ansätze and automatically-adjusted constraints

The ground and excited state calculations at key geometries, such as the Frank-Condon (FC) and the conical intersection (CI) geometries, are essential for understanding photophysical properties. To compute these geometries on noisy intermediate-scale quantum devices, we proposed a strategy that combined a chemistry-inspired spin-restricted ansatz and a new excited state calculation method called the variational quantum eigensolver under automatically-adjusted constraints (VQE/AC). Unlike the conventional excited state calculation method, called the variational quantum deflation, the VQE/AC does not require the pre-determination of constraint weights and has the potential to describe smooth potential energy surfaces. To validate this strategy, we performed the excited state calculations at the FC and CI geometries of ethylene and phenol blue at the complete active space self-consistent field (CASSCF) level of theory, and found that the energy errors were at most 2 kcal mol$^{-1}$ even on the ibm_kawasaki device.

quant-ph↗

arXiv2020

Applications of Quantum Computing for Investigations of Electronic Transitions in Phenylsulfonyl-carbazole TADF Emitters

A quantum chemistry study of the first singlet (S1) and triplet (T1) excited states of phenylsulfonyl-carbazole compounds, proposed as useful thermally activated delayed fluorescence (TADF) emitters for organic light emitting diode (OLED) applications, was performed with the quantum Equation-Of-Motion Variational Quantum Eigensolver (qEOM-VQE) and Variational Quantum Deflation (VQD) algorithms on quantum simulators and devices. These quantum simulations were performed with double zeta quality basis sets on an active space comprising the highest occupied and lowest unoccupied molecular orbitals (HOMO, LUMO) of the TADF molecules. The differences in energy separations between S1 and T1 ($ΔE_{st}$) predicted by calculations on quantum simulators were found to be in excellent agreement with experimental data. Differences of 16 and 88 mHa with respect to exact energies were found for excited states by using the qEOM-VQE and VQD algorithms, respectively, to perform simulations on quantum devices without error mitigation. By utilizing error mitigation by state tomography to purify the quantum states and correct energy values, the large errors found for unmitigated results could be improved to differences of, at most, 3 mHa with respect to exact values. Consequently, excellent agreement could be found between values of $ΔE_{st}$ predicted by quantum simulations and those found in experiments.

quant-ph↗

arXiv2019

Computational Investigations of the Lithium Superoxide Dimer Rearrangement on Noisy Quantum Devices

Currently available noisy intermediate-scale quantum (NISQ) devices are limited by the number of qubits that can be used for quantum chemistry calculations on molecules. We show herein that the number of qubits required for simulations on a quantum computer can be reduced by limiting the number of orbitals in the active space. Thus, we have utilized ansätze that approximate exact classical matrix eigenvalue decomposition methods (Full Configuration Interaction). Such methods are appropriate for computations with the Variational Quantum Eigensolver algorithm to perform computational investigations on the rearrangement of the lithium superoxide dimer with both quantum simulators and quantum devices. These results demonstrate that, even with a limited orbital active space, quantum simulators are capable of obtaining energy values that are similar to the exact ones. However, calculations on quantum hardware underestimate energies even after the application of readout error mitigation.

quant-ph↗