Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers

Abstract

We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an approximate ground state can be prepared on a quantum computer either by variational quantum eigensolver or by some other method. Then, by sampling the state in the computational basis, which is hard for classical computation in general, one can identify the electron configurations that are important for reproducing the ground state. The Hamiltonian in the subspace spanned by those important configurations is diagonalized on classical computers to output the ground-state energy and the corresponding eigenvector. The excited-state energies can be obtained similarly. The result is robust against statistical and physical errors because the noisy quantum devices are used only to define the subspace, and the resulting ground-state energy strictly satisfies the variational principle even in the presence of such errors. The expectation values of various other operators can also be estimated for obtained eigenstates with no additional quantum cost, since the explicit eigenvectors in the subspaces are known. We verified our proposal by numerical simulations, and demonstrated it on a quantum device for an 8-qubit molecular Hamiltonian. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits, assisted by high-performance classical computing resources for diagonalization.

arXiv comment28 pages, 15 figures

References in corpus (77)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group
• Variational Quantum Algorithms
• Quantum computational advantage using photons
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Dynamical Decoupling of Open Quantum Systems
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• The Variational Quantum Eigensolver: a review of methods and best practices
• Fermionic quantum computation
• Towards Practical Quantum Variational Algorithms
• Efficient quantum state tomography
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient variational quantum simulator incorporating active error minimisation
• Variational ansatz-based quantum simulation of imaginary time evolution
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
• Variational Quantum Computation of Excited States
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Semistochastic Heat-bath Configuration Interaction method: selected configuration interaction with semistochastic perturbation theory
• A deterministic alternative to the full configuration interaction quantum Monte Carlo method
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• An adaptive configuration interaction approach for strongly correlated electrons with tunable accuracy
• Low-cost error mitigation by symmetry verification
• Error-mitigated digital quantum simulation
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method
• Semistochastic Projector Monte Carlo Method
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs
• Quantum circuits for strongly correlated quantum systems
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Fundamental limits of quantum error mitigation
• Fermionic partial tomography via classical shadows
• A Non-Orthogonal Variational Quantum Eigensolver
• Exponential Error Suppression for Near-Term Quantum Devices
• Perfect Sampling with Unitary Tensor Networks
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Adaptive multiconfigurational wave functions
• Decoding quantum errors with subspace expansions
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Machine Learning Configuration Interaction
• Efficient heat-bath sampling in Fock space
• Quantum Power Method by a Superposition of Time-Evolved States
• Ground-state properties of the hydrogen chain: insulator-to-metal transition, dimerization, and magnetic phases
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Generalized quantum subspace expansion
• Exact and efficient Lanczos method on a quantum computer
• Selected Configuration Interaction in a Basis of Cluster State Tensor Products
• A theory of quantum subspace diagonalization
• Theory of analytical energy derivatives for the variational quantum eigensolver
• Penalty methods for variational quantum eigensolver
• Nonunitary quantum circuit
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Calculating transition amplitudes by variational quantum deflation
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Machine learning configuration interaction for ab initio potential energy curves
• Chemistry on quantum computers with virtual quantum subspace expansion
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Algebraic Bethe Circuits
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Identification of topological phases using classically-optimized variational quantum eigensolver
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era

Cited by in corpus (8)

• Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• A Parallel, Distributed Memory Implementation of the Adaptive Sampling Configuration Interaction Method
• Simulation of a Diels-Alder Reaction on a Quantum Computer
• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
• Generative flow-based warm start of the variational quantum eigensolver
• Rovibrational energy levels of H${}_2$O by quantum computing
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
• The Quantum Ensemble Variational Optimization Algorithm: Applications to Molecular Inverse Design