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

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.

32 pages, 24 figures, 3 tables

References in corpus (42)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum algorithms for quantum chemistry and quantum materials science
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Classical simulation of quantum many-body systems with a tree tensor network
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Layerwise learning for quantum neural networks
• Towards Quantum Machine Learning with Tensor Networks
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Doubling the size of quantum simulators by entanglement forging
• Fermionic partial tomography via classical shadows
• Interactions between Large Molecules: Puzzle for Reference Quantum-Mechanical Methods
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum simulation with hybrid tensor networks
• Quantum-enhanced Markov chain Monte Carlo
• Selected Configuration Interaction in a Basis of Cluster State Tensor Products
• Computational Investigations of the Lithium Superoxide Dimer Rearrangement on Noisy Quantum Devices
• Calculating transition amplitudes by variational quantum deflation
• A cluster-based mean-field and perturbative description of strongly correlated fermion systems. Application to the 1D and 2D Hubbard model
• Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor
• Perturbative quantum simulation
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
• Doubly optimal parallel wire cutting without ancilla qubits
• Expressibility of comb tensor network states (CTNS) for the P-cluster and the FeMo-cofactor of nitrogenase
• Quantum-assisted Monte Carlo algorithms for fermions
• Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers
• Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
• Quantum algorithm for calculation of transition amplitudes in hybrid tensor networks
• Quantum-enhanced quantum Monte Carlo: an industrial view
• Classical and quantum cost of measurement strategies for quantum-enhanced auxiliary field Quantum Monte Carlo

Cited by in corpus (11)

• Integrating Quantum Computing Resources into Scientific HPC Ecosystems
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Unbiasing Fermionic Auxiliary-Field Quantum Monte Carlo with Matrix Product State Trial Wavefunctions
• Hybrid Tree Tensor Networks for quantum simulation
• Tensor-based quantum phase difference estimation for large-scale demonstration
• A quantum computing approach to fixed-node Monte Carlo using classical shadows
• Density matrix representation of hybrid tensor networks for noisy quantum devices
• Enhancing quantum computations with the synergy of auxiliary field quantum Monte Carlo and computational basis tomography
• A penalty-free quantum algorithm to find energy eigenstates