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

• URL: http://arxiv.org/abs/2303.18095v3
• Date: Thu, 6 Jun 2024 07:00:04 GMT
• Title: Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• Authors: Shu Kanno, Hajime Nakamura, Takao Kobayashi, Shigeki Gocho, Miho Hatanaka, Naoki Yamamoto, Qi Gao,
• Abstract summary: 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. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC.
• Score: 3.642843803494657
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
  We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-10-18T10:30:14Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Simulating electronic structure on bosonic quantum computers [35.884125235274865]
  One of the most promising applications of quantum computing is the simulation of many-fermion problems. We show how an electronic structure Hamiltonian can be transformed into a system of qumodes through qubit-assisted fermion-to-qumode mapping.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation [0.0]
  We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory and quantum algorithms. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods.
  arXiv  Detail & Related papers  (2023-10-31T20:07:15Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [59.07246314484875]
  TeD-Q is an open-source software framework for quantum machine learning. It seamlessly integrates classical machine learning libraries with quantum simulators. It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Deterministic and random features for large-scale quantum kernel machine [0.9404723842159504]
  We show that the quantum kernel method (QKM) can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including $O(1,000) sim O(10,000)$ training data, supports the validity of our method.
  arXiv  Detail & Related papers  (2022-09-05T13:22:34Z)
• On the Super-exponential Quantum Speedup of Equivariant Quantum Machine Learning Algorithms with SU($d$) Symmetry [14.281289319738633]
  We enhance a natural model of quantum computation--permutational quantum computing (PQC)--and defines a more powerful model: PQC+. While PQC was shown to be effectively classically simulatable, we exhibit a problem which can be efficiently solved on PQC+ machine. We discuss practical quantum machine learning algorithms which can be carried out in the paradigm of PQC+.
  arXiv  Detail & Related papers  (2022-07-15T01:41:53Z)
• Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture [0.0]
  We show that the Quantum Singular Value Transformation can be efficiently "dequantized" We show that with inverse-polynomial precision, the same problem becomes BQP-complete. We also discuss how this dequantization technique may help make progress on the central quantum PCP.
  arXiv  Detail & Related papers  (2021-11-17T12:50:13Z)
• Estimating Phosphorescent Emission Energies in Ir(III) Complexes using Large-Scale Quantum Computing Simulations [0.0]
  We apply the iterative qubit coupled cluster (iQCC) method on classical hardware to the calculation of the transition energies in nine phosphorescent iridium complexes. Our simulations would require a gate-based quantum computer with a minimum of 72 fully-connected and error-corrected logical qubits. The iQCC quantum method is found to match the accuracy of the fine-tuned DFT functionals, has a better Pearson correlation coefficient, and still has considerable potential for systematic improvement.
  arXiv  Detail & Related papers  (2021-11-07T20:02:10Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.