A quantum eigenvalue solver based on tensor networks

Abstract

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

29 pages, 15 figures

References in corpus (63)

• A variational eigenvalue solver on a quantum processor
• Area laws for the entanglement entropy - a review
• Barren plateaus in quantum neural network training landscapes
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• Predicting Many Properties of a Quantum System from Very Few Measurements
• The Variational Quantum Eigensolver: a review of methods and best practices
• The ITensor Software Library for Tensor Network Calculations
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Quantum algorithms for quantum chemistry and quantum materials science
• Towards Practical Quantum Variational Algorithms
• Synthesis of Quantum Logic Circuits
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Entropy scaling and simulability by Matrix Product States
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Sequential generation of entangled multi-qubit states
• Orbital Optimization in the Density Matrix Renormalization Group, with applications to polyenes and β-carotene
• Variational quantum algorithms for nonlinear problems
• The Density Matrix Renormalization Group in Chemistry and Molecular Physics: Recent Developments and New Challenges
• Low-energy spectrum of iron-sulfur clusters directly from many-particle quantum mechanics
• The computational complexity of PEPS
• Towards Quantum Machine Learning with Tensor Networks
• Tensor network states and algorithms in the presence of a global U(1) symmetry
• Tensor network decompositions in the presence of a global symmetry
• A spin-adapted Density Matrix Renormalization Group algorithm for quantum chemistry
• Measuring orbital interaction using quantum information theory
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Quantum circuits for strongly correlated quantum systems
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• A Non-Orthogonal Variational Quantum Eigensolver
• Isometric Tensor Network States in Two Dimensions
• Orbital optimized unitary coupled cluster theory for quantum computer
• Efficient quantum circuits for quantum computational chemistry
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Preparation of matrix product states with log-depth quantum circuits
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Fermionic orbital optimisation in tensor network states
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Classically optimized Hamiltonian simulation
• Barren plateaus in quantum tensor network optimization
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• A theory of quantum subspace diagonalization
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Contracting projected entangled pair states is average-case hard
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
• Initial state preparation for quantum chemistry on quantum computers
• Augmenting Density Matrix Renormalization Group with Clifford Circuits
• Dequantizing quantum machine learning models using tensor networks
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Approximate encoding of quantum states using shallow circuits
• Quantum-classical eigensolver using multiscale entanglement renormalization
• Optimizing the information extracted by a single qubit measurement
• Tensor-network-assisted variational quantum algorithm
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Bilinear Majorana representations for spin operators with spin magnitudes $S>1/2$
• Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
• Anderson impurity solver integrating tensor network methods with quantum computing
• Noise-robust exploration of many-body quantum states on near-term quantum devices
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane